/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 23:11:19,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 23:11:19,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 23:11:19,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 23:11:19,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 23:11:19,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 23:11:19,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 23:11:19,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 23:11:19,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 23:11:19,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 23:11:19,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 23:11:19,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 23:11:19,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 23:11:19,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 23:11:19,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 23:11:19,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 23:11:19,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 23:11:19,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 23:11:19,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 23:11:19,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 23:11:19,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 23:11:19,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 23:11:19,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 23:11:19,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 23:11:19,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 23:11:19,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 23:11:19,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 23:11:19,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 23:11:19,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 23:11:19,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 23:11:19,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 23:11:19,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 23:11:19,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 23:11:19,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 23:11:19,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 23:11:19,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 23:11:19,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 23:11:19,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 23:11:19,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 23:11:19,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 23:11:19,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 23:11:19,561 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-09-20 23:11:19,590 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 23:11:19,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 23:11:19,591 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 23:11:19,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 23:11:19,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 23:11:19,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 23:11:19,592 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 23:11:19,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 23:11:19,592 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 23:11:19,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 23:11:19,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 23:11:19,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 23:11:19,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 23:11:19,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 23:11:19,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 23:11:19,593 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 23:11:19,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 23:11:19,593 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 23:11:19,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 23:11:19,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 23:11:19,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 23:11:19,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 23:11:19,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 23:11:19,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 23:11:19,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 23:11:19,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 23:11:19,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 23:11:19,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 23:11:19,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 23:11:19,595 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 23:11:19,595 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 23:11:19,595 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 [2022-09-20 23:11:19,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 23:11:19,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 23:11:19,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 23:11:19,792 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 23:11:19,793 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 23:11:19,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-09-20 23:11:19,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/093e8ac6a/621d74cf3ec04b55b6031886a46b4266/FLAGdf20dd089 [2022-09-20 23:11:20,195 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 23:11:20,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-09-20 23:11:20,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/093e8ac6a/621d74cf3ec04b55b6031886a46b4266/FLAGdf20dd089 [2022-09-20 23:11:20,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/093e8ac6a/621d74cf3ec04b55b6031886a46b4266 [2022-09-20 23:11:20,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 23:11:20,212 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 23:11:20,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 23:11:20,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 23:11:20,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 23:11:20,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775e5ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20, skipping insertion in model container [2022-09-20 23:11:20,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 23:11:20,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 23:11:20,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c[3424,3437] [2022-09-20 23:11:20,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 23:11:20,392 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 23:11:20,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c[3424,3437] [2022-09-20 23:11:20,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 23:11:20,419 INFO L208 MainTranslator]: Completed translation [2022-09-20 23:11:20,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20 WrapperNode [2022-09-20 23:11:20,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 23:11:20,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 23:11:20,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 23:11:20,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 23:11:20,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,449 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-09-20 23:11:20,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 23:11:20,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 23:11:20,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 23:11:20,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 23:11:20,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 23:11:20,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 23:11:20,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 23:11:20,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 23:11:20,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20" (1/1) ... [2022-09-20 23:11:20,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 23:11:20,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:11:20,517 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-09-20 23:11:20,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 23:11:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 23:11:20,536 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-09-20 23:11:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 23:11:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-20 23:11:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-20 23:11:20,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-20 23:11:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-20 23:11:20,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-20 23:11:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-20 23:11:20,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-20 23:11:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 23:11:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 23:11:20,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 23:11:20,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-20 23:11:20,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 23:11:20,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 23:11:20,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 23:11:20,554 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 23:11:20,666 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 23:11:20,667 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 23:11:20,965 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 23:11:21,070 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 23:11:21,070 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-09-20 23:11:21,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:11:21 BoogieIcfgContainer [2022-09-20 23:11:21,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 23:11:21,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 23:11:21,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 23:11:21,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 23:11:21,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 11:11:20" (1/3) ... [2022-09-20 23:11:21,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe7cd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:11:21, skipping insertion in model container [2022-09-20 23:11:21,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:11:20" (2/3) ... [2022-09-20 23:11:21,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe7cd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:11:21, skipping insertion in model container [2022-09-20 23:11:21,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:11:21" (3/3) ... [2022-09-20 23:11:21,078 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2022-09-20 23:11:21,089 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 23:11:21,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-20 23:11:21,090 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 23:11:21,150 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-20 23:11:21,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 211 transitions, 446 flow [2022-09-20 23:11:21,235 INFO L130 PetriNetUnfolder]: 18/208 cut-off events. [2022-09-20 23:11:21,236 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 23:11:21,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 208 events. 18/208 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 117 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 170. Up to 3 conditions per place. [2022-09-20 23:11:21,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 211 transitions, 446 flow [2022-09-20 23:11:21,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 197 transitions, 412 flow [2022-09-20 23:11:21,252 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 23:11:21,257 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;@4def7916, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 23:11:21,257 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-09-20 23:11:21,286 INFO L130 PetriNetUnfolder]: 18/196 cut-off events. [2022-09-20 23:11:21,286 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 23:11:21,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:11:21,287 INFO L208 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, 1, 1, 1] [2022-09-20 23:11:21,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:11:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:11:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2001340375, now seen corresponding path program 1 times [2022-09-20 23:11:21,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:11:21,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836950684] [2022-09-20 23:11:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:11:21,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:11:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:11:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:11:21,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:11:21,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836950684] [2022-09-20 23:11:21,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836950684] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:11:21,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:11:21,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 23:11:21,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814968525] [2022-09-20 23:11:21,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:11:21,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-20 23:11:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:11:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-20 23:11:21,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-20 23:11:21,528 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 211 [2022-09-20 23:11:21,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 197 transitions, 412 flow. Second operand has 2 states, 2 states have (on average 191.5) internal successors, (383), 2 states have internal predecessors, (383), 0 states have call successors, (0), 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-09-20 23:11:21,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:11:21,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 211 [2022-09-20 23:11:21,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:11:21,675 INFO L130 PetriNetUnfolder]: 71/370 cut-off events. [2022-09-20 23:11:21,676 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-09-20 23:11:21,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 370 events. 71/370 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1048 event pairs, 38 based on Foata normal form. 60/393 useless extension candidates. Maximal degree in co-relation 331. Up to 106 conditions per place. [2022-09-20 23:11:21,683 INFO L137 encePairwiseOnDemand]: 198/211 looper letters, 11 selfloop transitions, 0 changer transitions 6/184 dead transitions. [2022-09-20 23:11:21,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 184 transitions, 408 flow [2022-09-20 23:11:21,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-20 23:11:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-09-20 23:11:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 396 transitions. [2022-09-20 23:11:21,700 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9383886255924171 [2022-09-20 23:11:21,701 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 396 transitions. [2022-09-20 23:11:21,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 396 transitions. [2022-09-20 23:11:21,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:11:21,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 396 transitions. [2022-09-20 23:11:21,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 198.0) internal successors, (396), 2 states have internal predecessors, (396), 0 states have call successors, (0), 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-09-20 23:11:21,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 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-09-20 23:11:21,717 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 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-09-20 23:11:21,719 INFO L175 Difference]: Start difference. First operand has 189 places, 197 transitions, 412 flow. Second operand 2 states and 396 transitions. [2022-09-20 23:11:21,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 184 transitions, 408 flow [2022-09-20 23:11:21,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 184 transitions, 396 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-09-20 23:11:21,729 INFO L231 Difference]: Finished difference. Result has 184 places, 178 transitions, 362 flow [2022-09-20 23:11:21,731 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=362, PETRI_PLACES=184, PETRI_TRANSITIONS=178} [2022-09-20 23:11:21,733 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -5 predicate places. [2022-09-20 23:11:21,734 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 178 transitions, 362 flow [2022-09-20 23:11:21,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 191.5) internal successors, (383), 2 states have internal predecessors, (383), 0 states have call successors, (0), 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-09-20 23:11:21,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:11:21,734 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:11:21,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 23:11:21,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:11:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:11:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash -688370326, now seen corresponding path program 1 times [2022-09-20 23:11:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:11:21,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14268966] [2022-09-20 23:11:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:11:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:11:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:11:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:11:21,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:11:21,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14268966] [2022-09-20 23:11:21,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14268966] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:11:21,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:11:21,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 23:11:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982280809] [2022-09-20 23:11:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:11:21,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 23:11:21,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:11:21,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 23:11:21,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-09-20 23:11:22,002 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 211 [2022-09-20 23:11:22,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 178 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 164.66666666666666) internal successors, (988), 6 states have internal predecessors, (988), 0 states have call successors, (0), 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-09-20 23:11:22,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:11:22,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 211 [2022-09-20 23:11:22,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:11:22,229 INFO L130 PetriNetUnfolder]: 73/454 cut-off events. [2022-09-20 23:11:22,229 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-09-20 23:11:22,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 454 events. 73/454 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1286 event pairs, 38 based on Foata normal form. 11/430 useless extension candidates. Maximal degree in co-relation 622. Up to 118 conditions per place. [2022-09-20 23:11:22,232 INFO L137 encePairwiseOnDemand]: 199/211 looper letters, 33 selfloop transitions, 8 changer transitions 17/199 dead transitions. [2022-09-20 23:11:22,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 199 transitions, 523 flow [2022-09-20 23:11:22,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 23:11:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 23:11:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1501 transitions. [2022-09-20 23:11:22,236 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7904160084254871 [2022-09-20 23:11:22,236 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1501 transitions. [2022-09-20 23:11:22,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1501 transitions. [2022-09-20 23:11:22,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:11:22,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1501 transitions. [2022-09-20 23:11:22,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 166.77777777777777) internal successors, (1501), 9 states have internal predecessors, (1501), 0 states have call successors, (0), 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-09-20 23:11:22,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 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-09-20 23:11:22,244 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 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-09-20 23:11:22,244 INFO L175 Difference]: Start difference. First operand has 184 places, 178 transitions, 362 flow. Second operand 9 states and 1501 transitions. [2022-09-20 23:11:22,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 199 transitions, 523 flow [2022-09-20 23:11:22,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 199 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 23:11:22,249 INFO L231 Difference]: Finished difference. Result has 188 places, 179 transitions, 394 flow [2022-09-20 23:11:22,249 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=394, PETRI_PLACES=188, PETRI_TRANSITIONS=179} [2022-09-20 23:11:22,251 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -1 predicate places. [2022-09-20 23:11:22,251 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 179 transitions, 394 flow [2022-09-20 23:11:22,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.66666666666666) internal successors, (988), 6 states have internal predecessors, (988), 0 states have call successors, (0), 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-09-20 23:11:22,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:11:22,252 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:11:22,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 23:11:22,253 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:11:22,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:11:22,255 INFO L85 PathProgramCache]: Analyzing trace with hash -78510394, now seen corresponding path program 1 times [2022-09-20 23:11:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:11:22,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757227063] [2022-09-20 23:11:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:11:22,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:11:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:11:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:11:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:11:22,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757227063] [2022-09-20 23:11:22,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757227063] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:11:22,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:11:22,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 23:11:22,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58351629] [2022-09-20 23:11:22,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:11:22,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 23:11:22,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:11:22,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 23:11:22,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-09-20 23:11:22,427 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 211 [2022-09-20 23:11:22,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 179 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 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-09-20 23:11:22,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:11:22,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 211 [2022-09-20 23:11:22,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:11:22,554 INFO L130 PetriNetUnfolder]: 92/479 cut-off events. [2022-09-20 23:11:22,554 INFO L131 PetriNetUnfolder]: For 83/95 co-relation queries the response was YES. [2022-09-20 23:11:22,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 479 events. 92/479 cut-off events. For 83/95 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1578 event pairs, 50 based on Foata normal form. 15/452 useless extension candidates. Maximal degree in co-relation 775. Up to 115 conditions per place. [2022-09-20 23:11:22,557 INFO L137 encePairwiseOnDemand]: 202/211 looper letters, 36 selfloop transitions, 6 changer transitions 8/191 dead transitions. [2022-09-20 23:11:22,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 191 transitions, 528 flow [2022-09-20 23:11:22,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 23:11:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 23:11:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1171 transitions. [2022-09-20 23:11:22,559 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7928232904536222 [2022-09-20 23:11:22,559 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1171 transitions. [2022-09-20 23:11:22,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1171 transitions. [2022-09-20 23:11:22,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:11:22,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1171 transitions. [2022-09-20 23:11:22,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.28571428571428) internal successors, (1171), 7 states have internal predecessors, (1171), 0 states have call successors, (0), 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-09-20 23:11:22,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 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-09-20 23:11:22,564 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 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-09-20 23:11:22,564 INFO L175 Difference]: Start difference. First operand has 188 places, 179 transitions, 394 flow. Second operand 7 states and 1171 transitions. [2022-09-20 23:11:22,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 191 transitions, 528 flow [2022-09-20 23:11:22,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 191 transitions, 514 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-09-20 23:11:22,570 INFO L231 Difference]: Finished difference. Result has 189 places, 180 transitions, 404 flow [2022-09-20 23:11:22,570 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=189, PETRI_TRANSITIONS=180} [2022-09-20 23:11:22,574 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 0 predicate places. [2022-09-20 23:11:22,574 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 180 transitions, 404 flow [2022-09-20 23:11:22,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 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-09-20 23:11:22,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:11:22,575 INFO L208 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, 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-09-20 23:11:22,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 23:11:22,575 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:11:22,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:11:22,576 INFO L85 PathProgramCache]: Analyzing trace with hash -878834439, now seen corresponding path program 1 times [2022-09-20 23:11:22,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:11:22,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776717861] [2022-09-20 23:11:22,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:11:22,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:11:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:11:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:11:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:11:22,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776717861] [2022-09-20 23:11:22,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776717861] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:11:22,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:11:22,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-20 23:11:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270946612] [2022-09-20 23:11:22,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:11:22,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-20 23:11:22,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:11:22,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-20 23:11:22,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-20 23:11:22,794 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 211 [2022-09-20 23:11:22,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 180 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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-09-20 23:11:22,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:11:22,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 211 [2022-09-20 23:11:22,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:11:22,870 INFO L130 PetriNetUnfolder]: 82/405 cut-off events. [2022-09-20 23:11:22,870 INFO L131 PetriNetUnfolder]: For 87/91 co-relation queries the response was YES. [2022-09-20 23:11:22,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 405 events. 82/405 cut-off events. For 87/91 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1112 event pairs, 23 based on Foata normal form. 8/390 useless extension candidates. Maximal degree in co-relation 647. Up to 81 conditions per place. [2022-09-20 23:11:22,873 INFO L137 encePairwiseOnDemand]: 206/211 looper letters, 20 selfloop transitions, 4 changer transitions 0/186 dead transitions. [2022-09-20 23:11:22,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 186 transitions, 474 flow [2022-09-20 23:11:22,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-20 23:11:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-09-20 23:11:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 741 transitions. [2022-09-20 23:11:22,875 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8779620853080569 [2022-09-20 23:11:22,875 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 741 transitions. [2022-09-20 23:11:22,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 741 transitions. [2022-09-20 23:11:22,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:11:22,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 741 transitions. [2022-09-20 23:11:22,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.25) internal successors, (741), 4 states have internal predecessors, (741), 0 states have call successors, (0), 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-09-20 23:11:22,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 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-09-20 23:11:22,879 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 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-09-20 23:11:22,879 INFO L175 Difference]: Start difference. First operand has 189 places, 180 transitions, 404 flow. Second operand 4 states and 741 transitions. [2022-09-20 23:11:22,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 186 transitions, 474 flow [2022-09-20 23:11:22,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 186 transitions, 464 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 23:11:22,882 INFO L231 Difference]: Finished difference. Result has 188 places, 181 transitions, 412 flow [2022-09-20 23:11:22,882 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=188, PETRI_TRANSITIONS=181} [2022-09-20 23:11:22,884 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -1 predicate places. [2022-09-20 23:11:22,884 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 181 transitions, 412 flow [2022-09-20 23:11:22,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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-09-20 23:11:22,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:11:22,891 INFO L208 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, 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-09-20 23:11:22,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 23:11:22,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:11:22,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:11:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1591575709, now seen corresponding path program 2 times [2022-09-20 23:11:22,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:11:22,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602943404] [2022-09-20 23:11:22,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:11:22,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:11:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:11:22,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:11:22,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:11:22,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602943404] [2022-09-20 23:11:22,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602943404] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:11:22,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:11:22,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-20 23:11:22,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410041770] [2022-09-20 23:11:22,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:11:22,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 23:11:22,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:11:22,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 23:11:22,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 23:11:22,989 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 211 [2022-09-20 23:11:22,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 181 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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-09-20 23:11:22,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:11:22,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 211 [2022-09-20 23:11:22,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:11:23,041 INFO L130 PetriNetUnfolder]: 58/357 cut-off events. [2022-09-20 23:11:23,042 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2022-09-20 23:11:23,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 357 events. 58/357 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 849 event pairs, 15 based on Foata normal form. 2/338 useless extension candidates. Maximal degree in co-relation 576. Up to 91 conditions per place. [2022-09-20 23:11:23,044 INFO L137 encePairwiseOnDemand]: 207/211 looper letters, 17 selfloop transitions, 3 changer transitions 0/185 dead transitions. [2022-09-20 23:11:23,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 185 transitions, 466 flow [2022-09-20 23:11:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 23:11:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 23:11:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2022-09-20 23:11:23,045 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8941548183254344 [2022-09-20 23:11:23,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 566 transitions. [2022-09-20 23:11:23,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 566 transitions. [2022-09-20 23:11:23,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:11:23,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 566 transitions. [2022-09-20 23:11:23,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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-09-20 23:11:23,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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-09-20 23:11:23,048 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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-09-20 23:11:23,048 INFO L175 Difference]: Start difference. First operand has 188 places, 181 transitions, 412 flow. Second operand 3 states and 566 transitions. [2022-09-20 23:11:23,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 185 transitions, 466 flow [2022-09-20 23:11:23,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 185 transitions, 454 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-09-20 23:11:23,051 INFO L231 Difference]: Finished difference. Result has 188 places, 183 transitions, 423 flow [2022-09-20 23:11:23,052 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=423, PETRI_PLACES=188, PETRI_TRANSITIONS=183} [2022-09-20 23:11:23,053 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -1 predicate places. [2022-09-20 23:11:23,053 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 183 transitions, 423 flow [2022-09-20 23:11:23,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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-09-20 23:11:23,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:11:23,054 INFO L208 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, 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-09-20 23:11:23,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 23:11:23,054 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:11:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:11:23,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1192944727, now seen corresponding path program 3 times [2022-09-20 23:11:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:11:23,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228727960] [2022-09-20 23:11:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:11:23,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:11:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:11:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:11:25,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:11:25,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228727960] [2022-09-20 23:11:25,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228727960] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:11:25,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005608602] [2022-09-20 23:11:25,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-20 23:11:25,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:11:25,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:11:25,891 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-09-20 23:11:25,942 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-09-20 23:11:26,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-09-20 23:11:26,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:11:26,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 44 conjunts are in the unsatisfiable core [2022-09-20 23:11:26,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:11:27,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:11:27,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:11:27,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:11:27,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:11:27,979 INFO L356 Elim1Store]: treesize reduction 3, result has 85.0 percent of original size [2022-09-20 23:11:27,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 34 [2022-09-20 23:11:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:11:28,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-20 23:11:28,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005608602] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:11:28,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-20 23:11:28,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [40] total 55 [2022-09-20 23:11:28,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025035830] [2022-09-20 23:11:28,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:11:28,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-09-20 23:11:28,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:11:28,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-09-20 23:11:28,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2740, Unknown=0, NotChecked=0, Total=2970 [2022-09-20 23:11:28,080 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 211 [2022-09-20 23:11:28,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 183 transitions, 423 flow. Second operand has 23 states, 23 states have (on average 103.65217391304348) internal successors, (2384), 23 states have internal predecessors, (2384), 0 states have call successors, (0), 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-09-20 23:11:28,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:11:28,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 211 [2022-09-20 23:11:28,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:11:29,202 INFO L130 PetriNetUnfolder]: 1076/2261 cut-off events. [2022-09-20 23:11:29,202 INFO L131 PetriNetUnfolder]: For 1134/1206 co-relation queries the response was YES. [2022-09-20 23:11:29,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4926 conditions, 2261 events. 1076/2261 cut-off events. For 1134/1206 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12691 event pairs, 94 based on Foata normal form. 1/2057 useless extension candidates. Maximal degree in co-relation 4917. Up to 817 conditions per place. [2022-09-20 23:11:29,213 INFO L137 encePairwiseOnDemand]: 177/211 looper letters, 144 selfloop transitions, 56 changer transitions 4/297 dead transitions. [2022-09-20 23:11:29,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 297 transitions, 1144 flow [2022-09-20 23:11:29,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-20 23:11:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-09-20 23:11:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3004 transitions. [2022-09-20 23:11:29,230 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5084631008801624 [2022-09-20 23:11:29,230 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 3004 transitions. [2022-09-20 23:11:29,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 3004 transitions. [2022-09-20 23:11:29,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:11:29,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 3004 transitions. [2022-09-20 23:11:29,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 107.28571428571429) internal successors, (3004), 28 states have internal predecessors, (3004), 0 states have call successors, (0), 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-09-20 23:11:29,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 211.0) internal successors, (6119), 29 states have internal predecessors, (6119), 0 states have call successors, (0), 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-09-20 23:11:29,248 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 211.0) internal successors, (6119), 29 states have internal predecessors, (6119), 0 states have call successors, (0), 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-09-20 23:11:29,248 INFO L175 Difference]: Start difference. First operand has 188 places, 183 transitions, 423 flow. Second operand 28 states and 3004 transitions. [2022-09-20 23:11:29,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 297 transitions, 1144 flow [2022-09-20 23:11:29,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 297 transitions, 1141 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 23:11:29,256 INFO L231 Difference]: Finished difference. Result has 221 places, 223 transitions, 708 flow [2022-09-20 23:11:29,256 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=708, PETRI_PLACES=221, PETRI_TRANSITIONS=223} [2022-09-20 23:11:29,258 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 32 predicate places. [2022-09-20 23:11:29,258 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 223 transitions, 708 flow [2022-09-20 23:11:29,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 103.65217391304348) internal successors, (2384), 23 states have internal predecessors, (2384), 0 states have call successors, (0), 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-09-20 23:11:29,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:11:29,260 INFO L208 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, 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-09-20 23:11:29,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-09-20 23:11:29,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-09-20 23:11:29,475 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:11:29,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:11:29,476 INFO L85 PathProgramCache]: Analyzing trace with hash 137465123, now seen corresponding path program 4 times [2022-09-20 23:11:29,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:11:29,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957907618] [2022-09-20 23:11:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:11:29,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:11:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:11:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:11:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:11:33,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957907618] [2022-09-20 23:11:33,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957907618] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:11:33,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844877880] [2022-09-20 23:11:33,024 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-20 23:11:33,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:11:33,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:11:33,040 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-09-20 23:11:33,041 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-09-20 23:11:33,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-20 23:11:33,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:11:33,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 74 conjunts are in the unsatisfiable core [2022-09-20 23:11:33,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:11:34,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:11:35,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:11:35,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:11:35,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:11:36,382 INFO L356 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-09-20 23:11:36,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 38 [2022-09-20 23:11:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:11:36,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:11:38,315 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((~q1~0.base Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_177))) (let ((.cse3 (select .cse4 c_~q2~0.base))) (let ((.cse2 (select .cse3 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse0 (select .cse4 ~q1~0.base)) (.cse1 (+ .cse2 1))) (or (not (= (select .cse0 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (not (<= (select .cse0 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse1)) (not (<= .cse1 0)) (<= (+ c_~s~0 .cse2) (+ (* c_~t~0 2) (* 2 (select .cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) 1)))))))) (forall ((~q1~0.base Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_177))) (let ((.cse5 (select .cse9 c_~q2~0.base))) (let ((.cse6 (select .cse5 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse7 (select .cse9 ~q1~0.base)) (.cse8 (+ .cse6 1))) (or (< (+ (* c_~t~0 2) (* 2 (select .cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (+ c_~s~0 .cse6)) (not (= (select .cse7 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (not (<= (select .cse7 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse8)) (not (<= .cse8 0))))))))) (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:11:38,968 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((~q1~0.base Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_177))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse0 (select .cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (let ((.cse3 (select .cse4 ~q1~0.base)) (.cse2 (+ .cse0 1))) (or (<= (+ .cse0 c_~s~0) (+ (* c_~t~0 2) (* 2 (select .cse1 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 1)) (not (<= .cse2 0)) (not (= (select .cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (not (<= (select .cse3 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse2)))))))) (forall ((~q1~0.base Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_177))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse8 (select .cse7 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (let ((.cse6 (select .cse9 ~q1~0.base)) (.cse5 (+ .cse8 1))) (or (not (<= .cse5 0)) (not (= (select .cse6 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (< (+ (* c_~t~0 2) (* 2 (select .cse7 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (+ .cse8 c_~s~0)) (not (<= (select .cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse5))))))))) (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:11:39,240 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((~q1~0.base Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_177))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse3 (select .cse4 ~q1~0.base)) (.cse2 (+ .cse0 1))) (or (<= (+ c_~s~0 .cse0) (+ (* c_~t~0 2) (* (select .cse1 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2) 1)) (not (<= .cse2 0)) (not (= (select .cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (not (<= (select .cse3 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse2)))))))) (forall ((~q1~0.base Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_177))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse5 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse8 (select .cse9 ~q1~0.base)) (.cse7 (+ .cse6 1))) (or (< (+ (* c_~t~0 2) (* (select .cse5 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2)) (+ c_~s~0 .cse6)) (not (<= .cse7 0)) (not (= (select .cse8 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (not (<= (select .cse8 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse7))))))))) (not (<= 0 c_~q1_back~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:11:39,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:11:39,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 202 treesize of output 142 [2022-09-20 23:11:39,917 INFO L356 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2022-09-20 23:11:39,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 8472 treesize of output 7992 [2022-09-20 23:11:39,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:11:39,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7896 treesize of output 7128 [2022-09-20 23:11:40,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:11:40,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7032 treesize of output 5400 [2022-09-20 23:11:40,151 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:11:40,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5304 treesize of output 4968 [2022-09-20 23:13:10,200 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:13:10,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 203 treesize of output 143 [2022-09-20 23:13:10,296 INFO L356 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2022-09-20 23:13:10,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 4386 treesize of output 4186 [2022-09-20 23:13:10,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:13:10,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3971 treesize of output 3845 [2022-09-20 23:13:10,416 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:13:10,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3868 treesize of output 3520 [2022-09-20 23:13:10,483 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:13:10,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3424 treesize of output 2632 [2022-09-20 23:14:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-20 23:14:15,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844877880] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:14:15,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:14:15,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 38, 34] total 100 [2022-09-20 23:14:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119679861] [2022-09-20 23:14:15,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:14:15,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-09-20 23:14:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:14:15,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-09-20 23:14:15,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1009, Invalid=8220, Unknown=95, NotChecked=576, Total=9900 [2022-09-20 23:14:15,345 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 211 [2022-09-20 23:14:15,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 223 transitions, 708 flow. Second operand has 100 states, 100 states have (on average 79.71) internal successors, (7971), 100 states have internal predecessors, (7971), 0 states have call successors, (0), 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-09-20 23:14:15,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:14:15,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 211 [2022-09-20 23:14:15,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:14:40,513 INFO L130 PetriNetUnfolder]: 5824/12117 cut-off events. [2022-09-20 23:14:40,513 INFO L131 PetriNetUnfolder]: For 16494/16842 co-relation queries the response was YES. [2022-09-20 23:14:40,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34142 conditions, 12117 events. 5824/12117 cut-off events. For 16494/16842 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 104829 event pairs, 366 based on Foata normal form. 16/11233 useless extension candidates. Maximal degree in co-relation 34126. Up to 2295 conditions per place. [2022-09-20 23:14:40,600 INFO L137 encePairwiseOnDemand]: 152/211 looper letters, 870 selfloop transitions, 523 changer transitions 14/1477 dead transitions. [2022-09-20 23:14:40,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1477 transitions, 9540 flow [2022-09-20 23:14:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-09-20 23:14:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2022-09-20 23:14:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 12165 transitions. [2022-09-20 23:14:40,617 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.4003751974723539 [2022-09-20 23:14:40,618 INFO L72 ComplementDD]: Start complementDD. Operand 144 states and 12165 transitions. [2022-09-20 23:14:40,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 12165 transitions. [2022-09-20 23:14:40,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:14:40,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 144 states and 12165 transitions. [2022-09-20 23:14:40,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 145 states, 144 states have (on average 84.47916666666667) internal successors, (12165), 144 states have internal predecessors, (12165), 0 states have call successors, (0), 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-09-20 23:14:40,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 145 states, 145 states have (on average 211.0) internal successors, (30595), 145 states have internal predecessors, (30595), 0 states have call successors, (0), 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-09-20 23:14:40,682 INFO L81 ComplementDD]: Finished complementDD. Result has 145 states, 145 states have (on average 211.0) internal successors, (30595), 145 states have internal predecessors, (30595), 0 states have call successors, (0), 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-09-20 23:14:40,683 INFO L175 Difference]: Start difference. First operand has 221 places, 223 transitions, 708 flow. Second operand 144 states and 12165 transitions. [2022-09-20 23:14:40,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 1477 transitions, 9540 flow [2022-09-20 23:14:40,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1477 transitions, 9393 flow, removed 46 selfloop flow, removed 17 redundant places. [2022-09-20 23:14:40,713 INFO L231 Difference]: Finished difference. Result has 396 places, 785 transitions, 5467 flow [2022-09-20 23:14:40,714 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=144, PETRI_FLOW=5467, PETRI_PLACES=396, PETRI_TRANSITIONS=785} [2022-09-20 23:14:40,714 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 207 predicate places. [2022-09-20 23:14:40,714 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 785 transitions, 5467 flow [2022-09-20 23:14:40,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 79.71) internal successors, (7971), 100 states have internal predecessors, (7971), 0 states have call successors, (0), 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-09-20 23:14:40,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:14:40,717 INFO L208 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, 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-09-20 23:14:40,748 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-09-20 23:14:40,948 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,SelfDestructingSolverStorable6 [2022-09-20 23:14:40,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:14:40,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:14:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1574208141, now seen corresponding path program 5 times [2022-09-20 23:14:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:14:40,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833433088] [2022-09-20 23:14:40,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:14:40,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:14:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:14:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:14:43,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:14:43,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833433088] [2022-09-20 23:14:43,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833433088] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:14:43,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938670100] [2022-09-20 23:14:43,453 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-09-20 23:14:43,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:14:43,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:14:43,455 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-09-20 23:14:43,455 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-09-20 23:14:43,565 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-20 23:14:43,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:14:43,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 94 conjunts are in the unsatisfiable core [2022-09-20 23:14:43,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:14:43,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:14:43,697 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-20 23:14:43,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:14:44,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:14:44,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-20 23:14:45,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:14:46,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:14:46,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:14:46,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:14:46,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:14:46,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:14:47,166 INFO L356 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-09-20 23:14:47,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 30 [2022-09-20 23:14:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:14:47,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:14:49,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:14:49,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 161 treesize of output 113 [2022-09-20 23:14:50,065 INFO L356 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2022-09-20 23:14:50,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 3928 treesize of output 3744 [2022-09-20 23:14:50,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:14:50,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3624 treesize of output 2856 [2022-09-20 23:14:50,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:14:50,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2808 treesize of output 2448 [2022-09-20 23:14:50,266 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:14:50,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2345 treesize of output 2231 [2022-09-20 23:16:01,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:16:01,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 162 treesize of output 114 [2022-09-20 23:16:01,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 23:16:01,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 23:16:01,682 INFO L356 Elim1Store]: treesize reduction 85, result has 22.0 percent of original size [2022-09-20 23:16:01,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2988 treesize of output 2619 [2022-09-20 23:16:01,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:16:01,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2556 treesize of output 2108 [2022-09-20 23:16:01,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:16:01,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2108 treesize of output 1884 [2022-09-20 23:16:01,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:16:01,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:16:01,732 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:16:01,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1626 treesize of output 1332 [2022-09-20 23:16:05,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:16:05,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 107 treesize of output 112 [2022-09-20 23:16:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:16:05,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938670100] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:16:05,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:16:05,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 42, 40] total 109 [2022-09-20 23:16:05,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886430525] [2022-09-20 23:16:05,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:16:05,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-09-20 23:16:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:16:05,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-09-20 23:16:05,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1032, Invalid=10692, Unknown=48, NotChecked=0, Total=11772 [2022-09-20 23:16:05,185 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 211 [2022-09-20 23:16:05,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 785 transitions, 5467 flow. Second operand has 109 states, 109 states have (on average 76.55963302752293) internal successors, (8345), 109 states have internal predecessors, (8345), 0 states have call successors, (0), 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-09-20 23:16:05,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:16:05,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 211 [2022-09-20 23:16:05,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:16:20,549 INFO L130 PetriNetUnfolder]: 7725/16057 cut-off events. [2022-09-20 23:16:20,549 INFO L131 PetriNetUnfolder]: For 88690/89809 co-relation queries the response was YES. [2022-09-20 23:16:20,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66005 conditions, 16057 events. 7725/16057 cut-off events. For 88690/89809 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 147704 event pairs, 1276 based on Foata normal form. 158/15278 useless extension candidates. Maximal degree in co-relation 65940. Up to 8257 conditions per place. [2022-09-20 23:16:20,757 INFO L137 encePairwiseOnDemand]: 152/211 looper letters, 797 selfloop transitions, 428 changer transitions 8/1300 dead transitions. [2022-09-20 23:16:20,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 1300 transitions, 11875 flow [2022-09-20 23:16:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-09-20 23:16:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2022-09-20 23:16:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 7457 transitions. [2022-09-20 23:16:20,769 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.37201297081566476 [2022-09-20 23:16:20,769 INFO L72 ComplementDD]: Start complementDD. Operand 95 states and 7457 transitions. [2022-09-20 23:16:20,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 7457 transitions. [2022-09-20 23:16:20,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:16:20,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 95 states and 7457 transitions. [2022-09-20 23:16:20,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 96 states, 95 states have (on average 78.49473684210527) internal successors, (7457), 95 states have internal predecessors, (7457), 0 states have call successors, (0), 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-09-20 23:16:20,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 96 states, 96 states have (on average 211.0) internal successors, (20256), 96 states have internal predecessors, (20256), 0 states have call successors, (0), 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-09-20 23:16:20,803 INFO L81 ComplementDD]: Finished complementDD. Result has 96 states, 96 states have (on average 211.0) internal successors, (20256), 96 states have internal predecessors, (20256), 0 states have call successors, (0), 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-09-20 23:16:20,803 INFO L175 Difference]: Start difference. First operand has 396 places, 785 transitions, 5467 flow. Second operand 95 states and 7457 transitions. [2022-09-20 23:16:20,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 1300 transitions, 11875 flow [2022-09-20 23:16:21,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 1300 transitions, 10548 flow, removed 646 selfloop flow, removed 19 redundant places. [2022-09-20 23:16:21,331 INFO L231 Difference]: Finished difference. Result has 497 places, 1064 transitions, 8359 flow [2022-09-20 23:16:21,332 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=4486, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=785, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=8359, PETRI_PLACES=497, PETRI_TRANSITIONS=1064} [2022-09-20 23:16:21,332 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 308 predicate places. [2022-09-20 23:16:21,332 INFO L495 AbstractCegarLoop]: Abstraction has has 497 places, 1064 transitions, 8359 flow [2022-09-20 23:16:21,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 76.55963302752293) internal successors, (8345), 109 states have internal predecessors, (8345), 0 states have call successors, (0), 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-09-20 23:16:21,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:16:21,334 INFO L208 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, 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-09-20 23:16:21,352 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-09-20 23:16:21,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:16:21,547 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:16:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:16:21,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1362171347, now seen corresponding path program 6 times [2022-09-20 23:16:21,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:16:21,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688542503] [2022-09-20 23:16:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:16:21,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:16:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:16:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:16:24,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:16:24,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688542503] [2022-09-20 23:16:24,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688542503] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:16:24,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961421309] [2022-09-20 23:16:24,892 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-09-20 23:16:24,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:16:24,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:16:24,893 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-09-20 23:16:24,894 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-09-20 23:16:24,994 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-09-20 23:16:24,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:16:24,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 44 conjunts are in the unsatisfiable core [2022-09-20 23:16:24,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:16:26,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:16:26,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:16:26,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:16:26,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:16:26,466 INFO L356 Elim1Store]: treesize reduction 3, result has 85.0 percent of original size [2022-09-20 23:16:26,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 39 [2022-09-20 23:16:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:16:26,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-20 23:16:26,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961421309] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:16:26,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-20 23:16:26,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [43] total 61 [2022-09-20 23:16:26,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128077920] [2022-09-20 23:16:26,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:16:26,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-09-20 23:16:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:16:26,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-09-20 23:16:26,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3430, Unknown=0, NotChecked=0, Total=3660 [2022-09-20 23:16:26,598 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 211 [2022-09-20 23:16:26,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 1064 transitions, 8359 flow. Second operand has 24 states, 24 states have (on average 103.5) internal successors, (2484), 24 states have internal predecessors, (2484), 0 states have call successors, (0), 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-09-20 23:16:26,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:16:26,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 211 [2022-09-20 23:16:26,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:16:31,496 INFO L130 PetriNetUnfolder]: 7947/16628 cut-off events. [2022-09-20 23:16:31,496 INFO L131 PetriNetUnfolder]: For 132708/133561 co-relation queries the response was YES. [2022-09-20 23:16:31,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74661 conditions, 16628 events. 7947/16628 cut-off events. For 132708/133561 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 154767 event pairs, 1358 based on Foata normal form. 236/15916 useless extension candidates. Maximal degree in co-relation 74571. Up to 9413 conditions per place. [2022-09-20 23:16:31,733 INFO L137 encePairwiseOnDemand]: 174/211 looper letters, 862 selfloop transitions, 206 changer transitions 5/1189 dead transitions. [2022-09-20 23:16:31,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 1189 transitions, 11850 flow [2022-09-20 23:16:31,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-09-20 23:16:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-09-20 23:16:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2967 transitions. [2022-09-20 23:16:31,736 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5022004062288422 [2022-09-20 23:16:31,736 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2967 transitions. [2022-09-20 23:16:31,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2967 transitions. [2022-09-20 23:16:31,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:16:31,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2967 transitions. [2022-09-20 23:16:31,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 105.96428571428571) internal successors, (2967), 28 states have internal predecessors, (2967), 0 states have call successors, (0), 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-09-20 23:16:31,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 211.0) internal successors, (6119), 29 states have internal predecessors, (6119), 0 states have call successors, (0), 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-09-20 23:16:31,743 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 211.0) internal successors, (6119), 29 states have internal predecessors, (6119), 0 states have call successors, (0), 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-09-20 23:16:31,743 INFO L175 Difference]: Start difference. First operand has 497 places, 1064 transitions, 8359 flow. Second operand 28 states and 2967 transitions. [2022-09-20 23:16:31,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 1189 transitions, 11850 flow [2022-09-20 23:16:32,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 1189 transitions, 11380 flow, removed 159 selfloop flow, removed 68 redundant places. [2022-09-20 23:16:32,734 INFO L231 Difference]: Finished difference. Result has 460 places, 1129 transitions, 9367 flow [2022-09-20 23:16:32,735 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=7919, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=878, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=9367, PETRI_PLACES=460, PETRI_TRANSITIONS=1129} [2022-09-20 23:16:32,736 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 271 predicate places. [2022-09-20 23:16:32,736 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 1129 transitions, 9367 flow [2022-09-20 23:16:32,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 103.5) internal successors, (2484), 24 states have internal predecessors, (2484), 0 states have call successors, (0), 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-09-20 23:16:32,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:16:32,736 INFO L208 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, 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-09-20 23:16:32,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-09-20 23:16:32,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:16:32,952 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:16:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:16:32,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1221522165, now seen corresponding path program 7 times [2022-09-20 23:16:32,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:16:32,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461702896] [2022-09-20 23:16:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:16:32,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:16:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:16:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:16:34,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:16:34,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461702896] [2022-09-20 23:16:34,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461702896] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:16:34,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679706034] [2022-09-20 23:16:34,781 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-09-20 23:16:34,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:16:34,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:16:34,782 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-09-20 23:16:34,783 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-09-20 23:16:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:16:34,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 92 conjunts are in the unsatisfiable core [2022-09-20 23:16:34,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:16:34,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:16:35,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:16:35,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-20 23:16:37,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:16:38,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:16:38,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:16:38,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:16:38,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:16:38,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:16:39,112 INFO L356 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-09-20 23:16:39,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 30 [2022-09-20 23:16:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:16:39,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:16:41,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:16:41,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 161 treesize of output 113 [2022-09-20 23:16:41,937 INFO L356 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2022-09-20 23:16:41,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 118892 treesize of output 110660 [2022-09-20 23:16:42,201 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:16:42,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110540 treesize of output 85628 [2022-09-20 23:16:42,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:16:42,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84794 treesize of output 78644 [2022-09-20 23:16:42,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:16:42,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79340 treesize of output 66908 [2022-09-20 23:19:16,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:19:16,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 162 treesize of output 114 [2022-09-20 23:19:16,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 23:19:16,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 23:19:16,322 INFO L356 Elim1Store]: treesize reduction 85, result has 22.0 percent of original size [2022-09-20 23:19:16,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1500 treesize of output 1323 [2022-09-20 23:19:16,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:19:16,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:19:16,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:19:16,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1042 treesize of output 900 [2022-09-20 23:19:16,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:19:16,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1116 treesize of output 892 [2022-09-20 23:19:16,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:19:16,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 892 treesize of output 780 [2022-09-20 23:19:24,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:19:24,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 74 [2022-09-20 23:19:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:19:24,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679706034] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:19:24,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:19:24,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 42, 40] total 109 [2022-09-20 23:19:24,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456220678] [2022-09-20 23:19:24,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:19:24,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-09-20 23:19:24,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:19:24,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-09-20 23:19:24,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=10681, Unknown=68, NotChecked=0, Total=11772 [2022-09-20 23:19:24,821 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 211 [2022-09-20 23:19:24,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 1129 transitions, 9367 flow. Second operand has 109 states, 109 states have (on average 76.59633027522936) internal successors, (8349), 109 states have internal predecessors, (8349), 0 states have call successors, (0), 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-09-20 23:19:24,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:19:24,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 211 [2022-09-20 23:19:24,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:19:42,661 INFO L130 PetriNetUnfolder]: 8967/19057 cut-off events. [2022-09-20 23:19:42,661 INFO L131 PetriNetUnfolder]: For 226675/227463 co-relation queries the response was YES. [2022-09-20 23:19:42,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94048 conditions, 19057 events. 8967/19057 cut-off events. For 226675/227463 co-relation queries the response was YES. Maximal size of possible extension queue 1039. Compared 184080 event pairs, 1631 based on Foata normal form. 209/18172 useless extension candidates. Maximal degree in co-relation 93968. Up to 10964 conditions per place. [2022-09-20 23:19:42,968 INFO L137 encePairwiseOnDemand]: 148/211 looper letters, 1107 selfloop transitions, 343 changer transitions 8/1525 dead transitions. [2022-09-20 23:19:42,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 1525 transitions, 16300 flow [2022-09-20 23:19:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-09-20 23:19:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2022-09-20 23:19:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 7309 transitions. [2022-09-20 23:19:42,976 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.3724710798552719 [2022-09-20 23:19:42,976 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 7309 transitions. [2022-09-20 23:19:42,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 7309 transitions. [2022-09-20 23:19:42,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:19:42,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 7309 transitions. [2022-09-20 23:19:42,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 78.59139784946237) internal successors, (7309), 93 states have internal predecessors, (7309), 0 states have call successors, (0), 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-09-20 23:19:43,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 211.0) internal successors, (19834), 94 states have internal predecessors, (19834), 0 states have call successors, (0), 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-09-20 23:19:43,003 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 211.0) internal successors, (19834), 94 states have internal predecessors, (19834), 0 states have call successors, (0), 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-09-20 23:19:43,003 INFO L175 Difference]: Start difference. First operand has 460 places, 1129 transitions, 9367 flow. Second operand 93 states and 7309 transitions. [2022-09-20 23:19:43,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 1525 transitions, 16300 flow [2022-09-20 23:19:44,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 1525 transitions, 15786 flow, removed 211 selfloop flow, removed 19 redundant places. [2022-09-20 23:19:44,299 INFO L231 Difference]: Finished difference. Result has 552 places, 1309 transitions, 12259 flow [2022-09-20 23:19:44,300 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=9094, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=851, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=12259, PETRI_PLACES=552, PETRI_TRANSITIONS=1309} [2022-09-20 23:19:44,300 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 363 predicate places. [2022-09-20 23:19:44,300 INFO L495 AbstractCegarLoop]: Abstraction has has 552 places, 1309 transitions, 12259 flow [2022-09-20 23:19:44,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 76.59633027522936) internal successors, (8349), 109 states have internal predecessors, (8349), 0 states have call successors, (0), 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-09-20 23:19:44,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:19:44,301 INFO L208 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, 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-09-20 23:19:44,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-09-20 23:19:44,515 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,SelfDestructingSolverStorable9 [2022-09-20 23:19:44,516 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:19:44,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:19:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2018850787, now seen corresponding path program 8 times [2022-09-20 23:19:44,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:19:44,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306561696] [2022-09-20 23:19:44,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:44,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:19:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:19:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:19:46,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:19:46,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306561696] [2022-09-20 23:19:46,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306561696] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:19:46,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769592942] [2022-09-20 23:19:46,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 23:19:46,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:19:46,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:19:46,902 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-09-20 23:19:46,903 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-09-20 23:19:47,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-20 23:19:47,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:19:47,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-20 23:19:47,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:19:48,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:19:48,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:19:48,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:19:48,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:19:48,929 INFO L356 Elim1Store]: treesize reduction 89, result has 21.2 percent of original size [2022-09-20 23:19:48,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 40 [2022-09-20 23:19:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:19:49,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-20 23:19:49,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769592942] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:19:49,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-20 23:19:49,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [40] total 53 [2022-09-20 23:19:49,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985352952] [2022-09-20 23:19:49,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:19:49,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-09-20 23:19:49,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:19:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-09-20 23:19:49,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2538, Unknown=0, NotChecked=0, Total=2756 [2022-09-20 23:19:49,035 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 211 [2022-09-20 23:19:49,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 1309 transitions, 12259 flow. Second operand has 23 states, 23 states have (on average 103.65217391304348) internal successors, (2384), 23 states have internal predecessors, (2384), 0 states have call successors, (0), 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-09-20 23:19:49,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:19:49,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 211 [2022-09-20 23:19:49,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:19:55,967 INFO L130 PetriNetUnfolder]: 9317/19764 cut-off events. [2022-09-20 23:19:55,967 INFO L131 PetriNetUnfolder]: For 266690/267586 co-relation queries the response was YES. [2022-09-20 23:19:56,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104549 conditions, 19764 events. 9317/19764 cut-off events. For 266690/267586 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 191253 event pairs, 1686 based on Foata normal form. 293/18906 useless extension candidates. Maximal degree in co-relation 104449. Up to 12137 conditions per place. [2022-09-20 23:19:56,402 INFO L137 encePairwiseOnDemand]: 173/211 looper letters, 1106 selfloop transitions, 350 changer transitions 4/1577 dead transitions. [2022-09-20 23:19:56,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 1577 transitions, 18432 flow [2022-09-20 23:19:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-20 23:19:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-09-20 23:19:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3180 transitions. [2022-09-20 23:19:56,405 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.5023696682464455 [2022-09-20 23:19:56,405 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3180 transitions. [2022-09-20 23:19:56,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3180 transitions. [2022-09-20 23:19:56,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:19:56,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3180 transitions. [2022-09-20 23:19:56,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 106.0) internal successors, (3180), 30 states have internal predecessors, (3180), 0 states have call successors, (0), 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-09-20 23:19:56,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 211.0) internal successors, (6541), 31 states have internal predecessors, (6541), 0 states have call successors, (0), 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-09-20 23:19:56,412 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 211.0) internal successors, (6541), 31 states have internal predecessors, (6541), 0 states have call successors, (0), 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-09-20 23:19:56,412 INFO L175 Difference]: Start difference. First operand has 552 places, 1309 transitions, 12259 flow. Second operand 30 states and 3180 transitions. [2022-09-20 23:19:56,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 1577 transitions, 18432 flow [2022-09-20 23:19:58,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 1577 transitions, 17962 flow, removed 165 selfloop flow, removed 63 redundant places. [2022-09-20 23:19:58,067 INFO L231 Difference]: Finished difference. Result has 526 places, 1504 transitions, 15873 flow [2022-09-20 23:19:58,068 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=11880, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=15873, PETRI_PLACES=526, PETRI_TRANSITIONS=1504} [2022-09-20 23:19:58,069 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 337 predicate places. [2022-09-20 23:19:58,069 INFO L495 AbstractCegarLoop]: Abstraction has has 526 places, 1504 transitions, 15873 flow [2022-09-20 23:19:58,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 103.65217391304348) internal successors, (2384), 23 states have internal predecessors, (2384), 0 states have call successors, (0), 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-09-20 23:19:58,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:19:58,069 INFO L208 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, 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-09-20 23:19:58,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-09-20 23:19:58,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:19:58,278 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:19:58,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:19:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash 524927217, now seen corresponding path program 9 times [2022-09-20 23:19:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:19:58,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23987166] [2022-09-20 23:19:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:19:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:20:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:20:01,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:20:01,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23987166] [2022-09-20 23:20:01,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23987166] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:20:01,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027547890] [2022-09-20 23:20:01,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-20 23:20:01,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:20:01,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:20:01,191 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-09-20 23:20:01,192 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-09-20 23:20:01,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-09-20 23:20:01,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:20:01,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 51 conjunts are in the unsatisfiable core [2022-09-20 23:20:01,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:20:02,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:20:02,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:20:02,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:20:02,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:20:02,833 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-09-20 23:20:02,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 45 [2022-09-20 23:20:02,941 INFO L356 Elim1Store]: treesize reduction 3, result has 85.0 percent of original size [2022-09-20 23:20:02,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 32 [2022-09-20 23:20:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:20:03,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-20 23:20:03,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027547890] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:20:03,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-20 23:20:03,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [43] total 62 [2022-09-20 23:20:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894447369] [2022-09-20 23:20:03,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:20:03,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-09-20 23:20:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:20:03,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-09-20 23:20:03,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=3533, Unknown=0, NotChecked=0, Total=3782 [2022-09-20 23:20:03,066 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 211 [2022-09-20 23:20:03,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 1504 transitions, 15873 flow. Second operand has 28 states, 28 states have (on average 102.03571428571429) internal successors, (2857), 28 states have internal predecessors, (2857), 0 states have call successors, (0), 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-09-20 23:20:03,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:20:03,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 211 [2022-09-20 23:20:03,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:20:11,968 INFO L130 PetriNetUnfolder]: 11068/23246 cut-off events. [2022-09-20 23:20:11,969 INFO L131 PetriNetUnfolder]: For 386873/387852 co-relation queries the response was YES. [2022-09-20 23:20:12,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131596 conditions, 23246 events. 11068/23246 cut-off events. For 386873/387852 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 230579 event pairs, 2090 based on Foata normal form. 129/21966 useless extension candidates. Maximal degree in co-relation 131487. Up to 9086 conditions per place. [2022-09-20 23:20:12,336 INFO L137 encePairwiseOnDemand]: 173/211 looper letters, 1166 selfloop transitions, 595 changer transitions 4/1880 dead transitions. [2022-09-20 23:20:12,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 1880 transitions, 23537 flow [2022-09-20 23:20:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-20 23:20:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-09-20 23:20:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3358 transitions. [2022-09-20 23:20:12,339 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.49733412322274884 [2022-09-20 23:20:12,339 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3358 transitions. [2022-09-20 23:20:12,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3358 transitions. [2022-09-20 23:20:12,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:20:12,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3358 transitions. [2022-09-20 23:20:12,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 104.9375) internal successors, (3358), 32 states have internal predecessors, (3358), 0 states have call successors, (0), 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-09-20 23:20:12,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 211.0) internal successors, (6963), 33 states have internal predecessors, (6963), 0 states have call successors, (0), 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-09-20 23:20:12,359 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 211.0) internal successors, (6963), 33 states have internal predecessors, (6963), 0 states have call successors, (0), 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-09-20 23:20:12,359 INFO L175 Difference]: Start difference. First operand has 526 places, 1504 transitions, 15873 flow. Second operand 32 states and 3358 transitions. [2022-09-20 23:20:12,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 1880 transitions, 23537 flow [2022-09-20 23:20:14,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 1880 transitions, 23164 flow, removed 151 selfloop flow, removed 18 redundant places. [2022-09-20 23:20:14,587 INFO L231 Difference]: Finished difference. Result has 544 places, 1666 transitions, 19284 flow [2022-09-20 23:20:14,588 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=15552, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=456, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=19284, PETRI_PLACES=544, PETRI_TRANSITIONS=1666} [2022-09-20 23:20:14,589 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 355 predicate places. [2022-09-20 23:20:14,589 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 1666 transitions, 19284 flow [2022-09-20 23:20:14,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 102.03571428571429) internal successors, (2857), 28 states have internal predecessors, (2857), 0 states have call successors, (0), 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-09-20 23:20:14,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:20:14,590 INFO L208 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, 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-09-20 23:20:14,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-09-20 23:20:14,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:20:14,803 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:20:14,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:20:14,804 INFO L85 PathProgramCache]: Analyzing trace with hash 995522895, now seen corresponding path program 10 times [2022-09-20 23:20:14,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:20:14,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354234402] [2022-09-20 23:20:14,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:20:14,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:20:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:20:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:20:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:20:16,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354234402] [2022-09-20 23:20:16,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354234402] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:20:16,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066383582] [2022-09-20 23:20:16,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-20 23:20:16,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:20:16,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:20:16,560 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-09-20 23:20:16,562 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-09-20 23:20:16,659 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-20 23:20:16,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:20:16,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 74 conjunts are in the unsatisfiable core [2022-09-20 23:20:16,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:20:18,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:20:18,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:20:19,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 23:20:19,048 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:19,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:20:19,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 23:20:19,307 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:19,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 12 [2022-09-20 23:20:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:20:19,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:20:19,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:19,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 48 [2022-09-20 23:20:20,040 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~q2_back~0 c_~n2~0)) (let ((.cse1 (forall ((v_ArrVal_437 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_437) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))))) (and (forall ((v_ArrVal_437 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_437) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (or (< c_~s~0 (+ (* c_~t~0 2) .cse0 1)) (< 0 .cse0)))) (or .cse1 (< (* c_~t~0 2) (+ c_~s~0 1))) (or .cse1 (= (+ (* c_~q2_back~0 4) c_~q2~0.offset) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:20:20,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:20,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 161 treesize of output 137 [2022-09-20 23:20:20,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 112 treesize of output 100 [2022-09-20 23:20:20,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 100 treesize of output 94 [2022-09-20 23:20:20,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 94 treesize of output 88 [2022-09-20 23:20:22,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:20:22,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066383582] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:20:22,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:20:22,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39, 34] total 95 [2022-09-20 23:20:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806708706] [2022-09-20 23:20:22,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:20:22,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-09-20 23:20:22,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:20:22,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-09-20 23:20:22,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=8077, Unknown=1, NotChecked=184, Total=8930 [2022-09-20 23:20:22,287 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 211 [2022-09-20 23:20:22,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 1666 transitions, 19284 flow. Second operand has 95 states, 95 states have (on average 83.82105263157895) internal successors, (7963), 95 states have internal predecessors, (7963), 0 states have call successors, (0), 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-09-20 23:20:22,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:20:22,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 211 [2022-09-20 23:20:22,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:21:07,563 INFO L130 PetriNetUnfolder]: 19069/40246 cut-off events. [2022-09-20 23:21:07,563 INFO L131 PetriNetUnfolder]: For 683478/684742 co-relation queries the response was YES. [2022-09-20 23:21:08,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233438 conditions, 40246 events. 19069/40246 cut-off events. For 683478/684742 co-relation queries the response was YES. Maximal size of possible extension queue 1925. Compared 433816 event pairs, 2074 based on Foata normal form. 834/38574 useless extension candidates. Maximal degree in co-relation 233323. Up to 11210 conditions per place. [2022-09-20 23:21:09,009 INFO L137 encePairwiseOnDemand]: 151/211 looper letters, 1359 selfloop transitions, 2585 changer transitions 10/4024 dead transitions. [2022-09-20 23:21:09,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 730 places, 4024 transitions, 57226 flow [2022-09-20 23:21:09,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2022-09-20 23:21:09,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2022-09-20 23:21:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 16576 transitions. [2022-09-20 23:21:09,020 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.4156573635246621 [2022-09-20 23:21:09,021 INFO L72 ComplementDD]: Start complementDD. Operand 189 states and 16576 transitions. [2022-09-20 23:21:09,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 16576 transitions. [2022-09-20 23:21:09,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:21:09,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 189 states and 16576 transitions. [2022-09-20 23:21:09,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 190 states, 189 states have (on average 87.70370370370371) internal successors, (16576), 189 states have internal predecessors, (16576), 0 states have call successors, (0), 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-09-20 23:21:09,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 190 states, 190 states have (on average 211.0) internal successors, (40090), 190 states have internal predecessors, (40090), 0 states have call successors, (0), 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-09-20 23:21:09,069 INFO L81 ComplementDD]: Finished complementDD. Result has 190 states, 190 states have (on average 211.0) internal successors, (40090), 190 states have internal predecessors, (40090), 0 states have call successors, (0), 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-09-20 23:21:09,069 INFO L175 Difference]: Start difference. First operand has 544 places, 1666 transitions, 19284 flow. Second operand 189 states and 16576 transitions. [2022-09-20 23:21:09,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 730 places, 4024 transitions, 57226 flow [2022-09-20 23:21:14,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 4024 transitions, 56631 flow, removed 100 selfloop flow, removed 25 redundant places. [2022-09-20 23:21:14,630 INFO L231 Difference]: Finished difference. Result has 751 places, 3421 transitions, 49290 flow [2022-09-20 23:21:14,631 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=18928, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=189, PETRI_FLOW=49290, PETRI_PLACES=751, PETRI_TRANSITIONS=3421} [2022-09-20 23:21:14,632 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, 562 predicate places. [2022-09-20 23:21:14,632 INFO L495 AbstractCegarLoop]: Abstraction has has 751 places, 3421 transitions, 49290 flow [2022-09-20 23:21:14,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 83.82105263157895) internal successors, (7963), 95 states have internal predecessors, (7963), 0 states have call successors, (0), 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-09-20 23:21:14,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:21:14,633 INFO L208 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, 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-09-20 23:21:14,675 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-09-20 23:21:14,847 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,SelfDestructingSolverStorable12 [2022-09-20 23:21:14,848 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:21:14,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:21:14,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1063839135, now seen corresponding path program 11 times [2022-09-20 23:21:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:21:14,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447580459] [2022-09-20 23:21:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:21:14,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:21:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:21:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:21:16,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:21:16,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447580459] [2022-09-20 23:21:16,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447580459] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:21:16,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216782069] [2022-09-20 23:21:16,507 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-09-20 23:21:16,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:21:16,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:21:16,508 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-09-20 23:21:16,510 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-09-20 23:21:16,616 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-20 23:21:16,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:21:16,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 92 conjunts are in the unsatisfiable core [2022-09-20 23:21:16,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:21:16,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:21:16,713 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-20 23:21:16,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:21:17,329 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-20 23:21:17,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-09-20 23:21:17,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:21:18,780 INFO L356 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-09-20 23:21:18,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-09-20 23:21:19,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:21:19,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-09-20 23:21:20,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:21:20,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:21:20,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-20 23:21:20,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:21:20,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 33 [2022-09-20 23:21:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:21:20,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:21:21,434 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((~q2~0.base Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse0 (select .cse3 ~q2~0.base))) (let ((.cse1 (select .cse0 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse2 (+ .cse1 1))) (or (< (+ (* c_~t~0 2) (* (select .cse0 (+ c_~q2~0.offset (* c_~q2_front~0 4))) 2)) (+ c_~s~0 .cse1)) (not (<= .cse2 0)) (not (<= (select (select .cse3 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse2)))))))) (forall ((~q2~0.base Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse7 (select .cse5 ~q2~0.base))) (let ((.cse6 (select .cse7 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse4 (+ .cse6 1))) (or (not (<= .cse4 0)) (not (<= (select (select .cse5 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse4)) (<= (+ c_~s~0 .cse6) (+ (* c_~t~0 2) (* (select .cse7 (+ c_~q2~0.offset (* c_~q2_front~0 4))) 2) 1))))))))) (not (< c_~q2_back~0 c_~n2~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:21:21,558 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~q2_back~0 c_~n2~0)) (not (<= 0 c_~q2_back~0)) (and (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse0 (select .cse2 ~q2~0.base))) (let ((.cse1 (select .cse0 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse3 (+ .cse1 1))) (or (< (+ (* c_~t~0 2) (* 2 (select .cse0 (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (+ c_~s~0 .cse1)) (not (<= (select (select .cse2 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse3)) (not (<= .cse3 0)))))))) (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse5 (select .cse6 ~q2~0.base))) (let ((.cse4 (select .cse5 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse7 (+ .cse4 1))) (or (<= (+ c_~s~0 .cse4) (+ (* c_~t~0 2) (* 2 (select .cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) 1)) (not (<= (select (select .cse6 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse7)) (not (<= .cse7 0)))))))))) is different from false [2022-09-20 23:21:21,656 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (= (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (not (<= 0 c_~q2_back~0)) (and (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse0 (select .cse2 ~q2~0.base))) (let ((.cse1 (select .cse0 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse3 (+ .cse1 1))) (or (< (+ (* c_~t~0 2) (* 2 (select .cse0 (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (+ c_~s~0 .cse1)) (not (<= (select (select .cse2 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse3)) (not (<= .cse3 0)))))))) (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse5 (select .cse6 ~q2~0.base))) (let ((.cse4 (select .cse5 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse7 (+ .cse4 1))) (or (<= (+ c_~s~0 .cse4) (+ (* c_~t~0 2) (* 2 (select .cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) 1)) (not (<= (select (select .cse6 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse7)) (not (<= .cse7 0)))))))))) is different from false [2022-09-20 23:21:21,762 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (and (forall ((v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse1 (select .cse2 ~q2~0.base))) (let ((.cse0 (select .cse1 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse3 (+ 1 .cse0))) (or (<= (+ c_~s~0 .cse0) (+ (* c_~t~0 2) (* (select .cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) 2) 1)) (not (<= (select (select .cse2 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse3)) (not (<= .cse3 0)))))))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)))) (forall ((v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse4 (select .cse6 ~q2~0.base))) (let ((.cse5 (select .cse4 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse7 (+ 1 .cse5))) (or (< (+ (* c_~t~0 2) (* (select .cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) 2)) (+ c_~s~0 .cse5)) (not (<= (select (select .cse6 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse7)) (not (<= .cse7 0)))))))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0))))) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:21:22,176 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (and (forall ((v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse3 (select .cse0 ~q2~0.base))) (let ((.cse2 (select .cse3 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_main_#t~ret17#1.offset|)))) (let ((.cse1 (+ .cse2 1))) (or (not (<= (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse1)) (<= (+ c_~s~0 .cse2) (+ (* c_~t~0 2) (* (select .cse3 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* c_~q2_front~0 4))) 2) 1)) (not (<= .cse1 0)))))))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)))) (forall ((v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse4 ~q2~0.base))) (let ((.cse7 (select .cse6 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_main_#t~ret17#1.offset|)))) (let ((.cse5 (+ .cse7 1))) (or (not (<= (select (select .cse4 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse5)) (not (<= .cse5 0)) (< (+ (* c_~t~0 2) (* (select .cse6 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* c_~q2_front~0 4))) 2)) (+ c_~s~0 .cse7)))))))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0))))) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:21:22,240 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (and (forall ((v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse1 (select .cse3 ~q2~0.base))) (let ((.cse2 (select .cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (let ((.cse0 (+ .cse2 1))) (or (not (<= .cse0 0)) (< (+ (* c_~t~0 2) (* (select .cse1 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 2)) (+ c_~s~0 .cse2)) (not (<= (select (select .cse3 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse0)))))))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)))) (forall ((v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse7 (select .cse5 ~q2~0.base))) (let ((.cse6 (select .cse7 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (let ((.cse4 (+ .cse6 1))) (or (not (<= .cse4 0)) (not (<= (select (select .cse5 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse4)) (<= (+ c_~s~0 .cse6) (+ (* c_~t~0 2) (* (select .cse7 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 2) 1)))))))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0))))) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:21:22,274 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (and (forall ((v_ArrVal_484 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse2 (select .cse3 ~q2~0.base))) (let ((.cse1 (select .cse2 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse0 (+ .cse1 1))) (or (not (<= .cse0 0)) (<= (+ c_~s~0 .cse1) (+ (* c_~t~0 2) (* 2 (select .cse2 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)) (not (<= (select (select .cse3 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse0)))))))))) (forall ((v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 ~q2~0.base))) (let ((.cse7 (select .cse6 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse4 (+ .cse7 1))) (or (not (<= .cse4 0)) (not (<= (select (select .cse5 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse4)) (< (+ (* c_~t~0 2) (* 2 (select .cse6 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse7)))))))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0))))) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:21:22,312 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~q2_back~0 c_~n2~0)) (and (forall ((v_ArrVal_484 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse2 (select .cse3 ~q2~0.base))) (let ((.cse1 (select .cse2 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse0 (+ .cse1 1))) (or (not (<= .cse0 0)) (<= (+ c_~s~0 .cse1) (+ (* c_~t~0 2) (* 2 (select .cse2 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)) (not (<= (select (select .cse3 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse0)))))))))) (forall ((v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 ~q2~0.base))) (let ((.cse7 (select .cse6 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse4 (+ .cse7 1))) (or (not (<= .cse4 0)) (not (<= (select (select .cse5 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse4)) (< (+ (* c_~t~0 2) (* 2 (select .cse6 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse7)))))))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0))))) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:21:22,383 WARN L833 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post29#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (and (forall ((v_ArrVal_484 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse2 (select .cse3 ~q2~0.base))) (let ((.cse1 (select .cse2 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse0 (+ .cse1 1))) (or (not (<= .cse0 0)) (<= (+ c_~s~0 .cse1) (+ (* c_~t~0 2) (* 2 (select .cse2 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)) (not (<= (select (select .cse3 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse0)))))))))) (forall ((v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 ~q2~0.base))) (let ((.cse7 (select .cse6 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse4 (+ .cse7 1))) (or (not (<= .cse4 0)) (not (<= (select (select .cse5 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse4)) (< (+ (* c_~t~0 2) (* 2 (select .cse6 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse7)))))))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0))))) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:21:22,422 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (and (forall ((v_ArrVal_484 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse2 (select .cse3 ~q2~0.base))) (let ((.cse1 (select .cse2 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse0 (+ .cse1 1))) (or (not (<= .cse0 0)) (<= (+ c_~s~0 .cse1) (+ (* c_~t~0 2) (* 2 (select .cse2 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)) (not (<= (select (select .cse3 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse0)))))))))) (forall ((v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 ~q2~0.base))) (let ((.cse7 (select .cse6 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse4 (+ .cse7 1))) (or (not (<= .cse4 0)) (not (<= (select (select .cse5 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse4)) (< (+ (* c_~t~0 2) (* 2 (select .cse6 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse7)))))))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0))))) (not (< c_~q1_back~0 c_~n1~0)) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:21:22,498 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (and (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse2 (select .cse1 ~q2~0.base))) (let ((.cse3 (select .cse2 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse0 (+ .cse3 1))) (or (not (<= .cse0 0)) (not (<= (select (select .cse1 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse0)) (< (+ (* c_~t~0 2) (* 2 (select .cse2 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse3)))))))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)))) (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse5 (select .cse7 ~q2~0.base))) (let ((.cse4 (select .cse5 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse6 (+ .cse4 1))) (or (<= (+ c_~s~0 .cse4) (+ (* c_~t~0 2) (* 2 (select .cse5 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)) (not (<= .cse6 0)) (not (<= (select (select .cse7 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse6)))))))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0))))) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:21:22,622 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse2 (select .cse1 ~q2~0.base))) (let ((.cse3 (select .cse2 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse0 (+ .cse3 1))) (or (not (<= .cse0 0)) (not (<= (select (select .cse1 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse0)) (< (+ (* c_~t~0 2) (* 2 (select .cse2 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ c_~s~0 .cse3)))))))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)))) (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse5 (select .cse7 ~q2~0.base))) (let ((.cse4 (select .cse5 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse6 (+ .cse4 1))) (or (<= (+ c_~s~0 .cse4) (+ (* c_~t~0 2) (* 2 (select .cse5 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1)) (not (<= .cse6 0)) (not (<= (select (select .cse7 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse6)))))))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0))))) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:21:22,696 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse2 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse0 (select .cse2 ~q2~0.base))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset| (* c_~q2_back~0 4))))) (let ((.cse3 (+ .cse1 1))) (or (< (+ (* c_~t~0 2) (* 2 (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset| (* c_~q2_front~0 4))))) (+ c_~s~0 .cse1)) (not (<= (select (select .cse2 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse3)) (not (<= .cse3 0)))))))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)))) (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (or (forall ((~q2~0.base Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse4 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse7 (select .cse4 ~q2~0.base))) (let ((.cse6 (select .cse7 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset| (* c_~q2_back~0 4))))) (let ((.cse5 (+ .cse6 1))) (or (not (<= (select (select .cse4 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse5)) (not (<= .cse5 0)) (<= (+ c_~s~0 .cse6) (+ (* c_~t~0 2) (* 2 (select .cse7 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.offset| (* c_~q2_front~0 4)))) 1)))))))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0))))) (not (<= 0 c_~q1_back~0)) (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2022-09-20 23:21:32,125 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:21:32,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 207 treesize of output 147 [2022-09-20 23:21:32,196 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:21:32,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 54690 treesize of output 52960 [2022-09-20 23:21:32,372 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:21:32,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52637 treesize of output 51417 [2022-09-20 23:21:32,541 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:21:32,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51434 treesize of output 41138 [2022-09-20 23:21:32,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:21:32,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41224 treesize of output 38700 [2022-09-20 23:21:32,952 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:21:32,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38514 treesize of output 33386 Received shutdown request... [2022-09-20 23:25:17,416 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-09-20 23:25:17,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-09-20 23:25:17,424 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-20 23:25:17,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-09-20 23:25:17,438 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-09-20 23:25:17,634 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,SelfDestructingSolverStorable13 [2022-09-20 23:25:17,634 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 172 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 101ms.. [2022-09-20 23:25:17,636 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-09-20 23:25:17,636 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-09-20 23:25:17,636 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-09-20 23:25:17,636 INFO L444 BasicCegarLoop]: Path program histogram: [11, 1, 1, 1] [2022-09-20 23:25:17,639 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 23:25:17,639 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 23:25:17,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 11:25:17 BasicIcfg [2022-09-20 23:25:17,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 23:25:17,641 INFO L158 Benchmark]: Toolchain (without parser) took 837429.09ms. Allocated memory was 205.5MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 146.5MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. [2022-09-20 23:25:17,641 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 205.5MB. Free memory is still 163.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 23:25:17,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.06ms. Allocated memory was 205.5MB in the beginning and 250.6MB in the end (delta: 45.1MB). Free memory was 146.2MB in the beginning and 220.8MB in the end (delta: -74.6MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2022-09-20 23:25:17,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.89ms. Allocated memory is still 250.6MB. Free memory was 220.3MB in the beginning and 218.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 23:25:17,642 INFO L158 Benchmark]: Boogie Preprocessor took 18.45ms. Allocated memory is still 250.6MB. Free memory was 218.2MB in the beginning and 216.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-20 23:25:17,642 INFO L158 Benchmark]: RCFGBuilder took 604.13ms. Allocated memory is still 250.6MB. Free memory was 216.1MB in the beginning and 187.3MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-09-20 23:25:17,642 INFO L158 Benchmark]: TraceAbstraction took 836567.52ms. Allocated memory was 250.6MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 186.7MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. [2022-09-20 23:25:17,643 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.12ms. Allocated memory is still 205.5MB. Free memory is still 163.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.06ms. Allocated memory was 205.5MB in the beginning and 250.6MB in the end (delta: 45.1MB). Free memory was 146.2MB in the beginning and 220.8MB in the end (delta: -74.6MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.89ms. Allocated memory is still 250.6MB. Free memory was 220.3MB in the beginning and 218.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.45ms. Allocated memory is still 250.6MB. Free memory was 218.2MB in the beginning and 216.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 604.13ms. Allocated memory is still 250.6MB. Free memory was 216.1MB in the beginning and 187.3MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 836567.52ms. Allocated memory was 250.6MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 186.7MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 172 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 101ms.. - TimeoutResultAtElement [Line: 120]: 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 172 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 101ms.. - TimeoutResultAtElement [Line: 121]: 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 172 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 101ms.. - TimeoutResultAtElement [Line: 119]: 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 172 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 101ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 224 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 836.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 142.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11099 SdHoareTripleChecker+Valid, 13.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11099 mSDsluCounter, 18975 SdHoareTripleChecker+Invalid, 11.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12699 IncrementalHoareTripleChecker+Unchecked, 25802 mSDsCounter, 1846 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27675 IncrementalHoareTripleChecker+Invalid, 42220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1846 mSolverCounterUnsat, 759 mSDtfsCounter, 27675 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2982 GetRequests, 1758 SyntacticMatches, 68 SemanticMatches, 1156 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 68621 ImplicationChecksByTransitivity, 96.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49290occurred in iteration=13, InterpolantAutomatonStates: 664, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 447.8s InterpolantComputationTime, 3549 NumberOfCodeBlocks, 3465 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4208 ConstructedInterpolants, 281 QuantifiedInterpolants, 164811 SizeOfPredicates, 297 NumberOfNonLiveVariables, 3100 ConjunctsInSsa, 513 ConjunctsInUnsatCore, 25 InterpolantComputations, 9 PerfectInterpolantSequences, 13/45 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