/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:12:08,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:12:08,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:12:08,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:12:08,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:12:08,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:12:08,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:12:08,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:12:08,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:12:08,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:12:08,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:12:09,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:12:09,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:12:09,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:12:09,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:12:09,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:12:09,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:12:09,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:12:09,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:12:09,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:12:09,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:12:09,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:12:09,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:12:09,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:12:09,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:12:09,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:12:09,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:12:09,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:12:09,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:12:09,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:12:09,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:12:09,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:12:09,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:12:09,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:12:09,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:12:09,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:12:09,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:12:09,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:12:09,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:12:09,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:12:09,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:12:09,028 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-SemanticLbe.epf [2022-12-05 20:12:09,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:12:09,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:12:09,062 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:12:09,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:12:09,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:12:09,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:12:09,064 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:12:09,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:12:09,064 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:12:09,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:12:09,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:12:09,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:12:09,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:12:09,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:12:09,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:12:09,066 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:12:09,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:12:09,066 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:12:09,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:12:09,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:12:09,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:12:09,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:12:09,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:12:09,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:12:09,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:12:09,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:12:09,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:12:09,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:12:09,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:12:09,068 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:12:09,068 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-12-05 20:12:09,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:12:09,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:12:09,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:12:09,397 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:12:09,398 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:12:09,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-05 20:12:10,449 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:12:10,774 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:12:10,775 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-05 20:12:10,787 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b47559b2/94a8ac7eabe64f73be1f8074c0839e60/FLAGc81776433 [2022-12-05 20:12:10,801 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b47559b2/94a8ac7eabe64f73be1f8074c0839e60 [2022-12-05 20:12:10,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:12:10,805 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:12:10,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:12:10,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:12:10,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:12:10,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:12:10" (1/1) ... [2022-12-05 20:12:10,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a22d62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:10, skipping insertion in model container [2022-12-05 20:12:10,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:12:10" (1/1) ... [2022-12-05 20:12:10,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:12:10,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:12:11,212 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2022-12-05 20:12:11,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:12:11,252 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:12:11,305 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2022-12-05 20:12:11,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:12:11,402 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:12:11,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11 WrapperNode [2022-12-05 20:12:11,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:12:11,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:12:11,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:12:11,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:12:11,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (1/1) ... [2022-12-05 20:12:11,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (1/1) ... [2022-12-05 20:12:11,463 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-05 20:12:11,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:12:11,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:12:11,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:12:11,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:12:11,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (1/1) ... [2022-12-05 20:12:11,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (1/1) ... [2022-12-05 20:12:11,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (1/1) ... [2022-12-05 20:12:11,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (1/1) ... [2022-12-05 20:12:11,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (1/1) ... [2022-12-05 20:12:11,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (1/1) ... [2022-12-05 20:12:11,488 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (1/1) ... [2022-12-05 20:12:11,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (1/1) ... [2022-12-05 20:12:11,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:12:11,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:12:11,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:12:11,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:12:11,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (1/1) ... [2022-12-05 20:12:11,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:12:11,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:12:11,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 20:12:11,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 20:12:11,560 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 20:12:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 20:12:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 20:12:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 20:12:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:12:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:12:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 20:12:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:12:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 20:12:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:12:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:12:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:12:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:12:11,563 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:12:11,736 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:12:11,738 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:12:12,024 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:12:12,031 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:12:12,032 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-05 20:12:12,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:12:12 BoogieIcfgContainer [2022-12-05 20:12:12,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:12:12,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:12:12,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:12:12,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:12:12,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:12:10" (1/3) ... [2022-12-05 20:12:12,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52483bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:12:12, skipping insertion in model container [2022-12-05 20:12:12,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:12:11" (2/3) ... [2022-12-05 20:12:12,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52483bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:12:12, skipping insertion in model container [2022-12-05 20:12:12,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:12:12" (3/3) ... [2022-12-05 20:12:12,046 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2022-12-05 20:12:12,062 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:12:12,062 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:12:12,062 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:12:12,173 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 20:12:12,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-05 20:12:12,295 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-05 20:12:12,296 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 20:12:12,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 10/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-05 20:12:12,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-05 20:12:12,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-05 20:12:12,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:12:12,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-05 20:12:12,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 287 flow [2022-12-05 20:12:12,412 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-05 20:12:12,412 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 20:12:12,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 139 events. 10/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 307 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-05 20:12:12,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-05 20:12:12,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-05 20:12:16,356 INFO L203 LiptonReduction]: Total number of compositions: 109 [2022-12-05 20:12:16,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:12:16,375 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;@488d2920, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:12:16,375 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:12:16,379 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-05 20:12:16,379 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 20:12:16,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:16,380 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 20:12:16,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 973860878, now seen corresponding path program 1 times [2022-12-05 20:12:16,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:16,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930563222] [2022-12-05 20:12:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:16,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:16,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:16,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930563222] [2022-12-05 20:12:16,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930563222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:16,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:16,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:12:16,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929500219] [2022-12-05 20:12:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:16,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:12:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:16,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:12:16,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:12:16,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:12:16,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:16,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:16,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:12:16,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:16,905 INFO L130 PetriNetUnfolder]: 828/1410 cut-off events. [2022-12-05 20:12:16,906 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-05 20:12:16,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 1410 events. 828/1410 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5969 event pairs, 371 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 2635. Up to 880 conditions per place. [2022-12-05 20:12:16,916 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 55 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-05 20:12:16,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 253 flow [2022-12-05 20:12:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:12:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:12:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-05 20:12:16,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-05 20:12:16,928 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 89 flow. Second operand 3 states and 73 transitions. [2022-12-05 20:12:16,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 253 flow [2022-12-05 20:12:16,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:12:16,933 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 97 flow [2022-12-05 20:12:16,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-05 20:12:16,937 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-05 20:12:16,938 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 97 flow [2022-12-05 20:12:16,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:16,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:16,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:16,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:12:16,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1325177997, now seen corresponding path program 1 times [2022-12-05 20:12:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:16,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208735655] [2022-12-05 20:12:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:17,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:17,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208735655] [2022-12-05 20:12:17,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208735655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:17,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:17,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:12:17,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77928162] [2022-12-05 20:12:17,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:17,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:12:17,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:17,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:12:17,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:12:17,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2022-12-05 20:12:17,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:17,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:17,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2022-12-05 20:12:17,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:17,169 INFO L130 PetriNetUnfolder]: 686/1260 cut-off events. [2022-12-05 20:12:17,170 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-05 20:12:17,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2547 conditions, 1260 events. 686/1260 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6454 event pairs, 313 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 2130. Up to 1025 conditions per place. [2022-12-05 20:12:17,176 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 48 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-12-05 20:12:17,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 242 flow [2022-12-05 20:12:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:12:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:12:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-05 20:12:17,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-05 20:12:17,178 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 97 flow. Second operand 3 states and 69 transitions. [2022-12-05 20:12:17,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 242 flow [2022-12-05 20:12:17,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:12:17,180 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 109 flow [2022-12-05 20:12:17,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2022-12-05 20:12:17,181 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-05 20:12:17,182 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 109 flow [2022-12-05 20:12:17,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:17,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:17,182 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:17,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:12:17,182 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:17,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:17,183 INFO L85 PathProgramCache]: Analyzing trace with hash 963601012, now seen corresponding path program 1 times [2022-12-05 20:12:17,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:17,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721421214] [2022-12-05 20:12:17,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:17,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:17,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721421214] [2022-12-05 20:12:17,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721421214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:12:17,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710151256] [2022-12-05 20:12:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:17,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:12:17,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:12:17,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:12:17,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-05 20:12:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:17,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 20:12:17,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:12:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:17,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:12:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:17,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710151256] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:12:17,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:12:17,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-05 20:12:17,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096151026] [2022-12-05 20:12:17,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:12:17,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 20:12:17,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:17,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 20:12:17,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-05 20:12:17,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:12:17,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 109 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:17,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:17,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:12:17,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:18,149 INFO L130 PetriNetUnfolder]: 2004/3438 cut-off events. [2022-12-05 20:12:18,149 INFO L131 PetriNetUnfolder]: For 880/880 co-relation queries the response was YES. [2022-12-05 20:12:18,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 3438 events. 2004/3438 cut-off events. For 880/880 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 17981 event pairs, 302 based on Foata normal form. 88/2886 useless extension candidates. Maximal degree in co-relation 6886. Up to 999 conditions per place. [2022-12-05 20:12:18,167 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 166 selfloop transitions, 26 changer transitions 5/200 dead transitions. [2022-12-05 20:12:18,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 200 transitions, 913 flow [2022-12-05 20:12:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 20:12:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 20:12:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2022-12-05 20:12:18,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2022-12-05 20:12:18,171 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 109 flow. Second operand 12 states and 236 transitions. [2022-12-05 20:12:18,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 200 transitions, 913 flow [2022-12-05 20:12:18,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 200 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:12:18,178 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 321 flow [2022-12-05 20:12:18,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=321, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2022-12-05 20:12:18,179 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-12-05 20:12:18,179 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 65 transitions, 321 flow [2022-12-05 20:12:18,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:18,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:18,179 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:18,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-05 20:12:18,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:12:18,385 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:18,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1107267027, now seen corresponding path program 1 times [2022-12-05 20:12:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:18,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606413425] [2022-12-05 20:12:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:18,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606413425] [2022-12-05 20:12:18,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606413425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:18,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:18,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:12:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258824809] [2022-12-05 20:12:18,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:18,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:12:18,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:18,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:12:18,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:12:18,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2022-12-05 20:12:18,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 65 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:18,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:18,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2022-12-05 20:12:18,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:18,660 INFO L130 PetriNetUnfolder]: 558/1135 cut-off events. [2022-12-05 20:12:18,660 INFO L131 PetriNetUnfolder]: For 558/558 co-relation queries the response was YES. [2022-12-05 20:12:18,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2726 conditions, 1135 events. 558/1135 cut-off events. For 558/558 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5569 event pairs, 98 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 2614. Up to 758 conditions per place. [2022-12-05 20:12:18,666 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 6 changer transitions 3/63 dead transitions. [2022-12-05 20:12:18,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 358 flow [2022-12-05 20:12:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:12:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:12:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-05 20:12:18,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-05 20:12:18,670 INFO L175 Difference]: Start difference. First operand has 60 places, 65 transitions, 321 flow. Second operand 3 states and 62 transitions. [2022-12-05 20:12:18,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 358 flow [2022-12-05 20:12:18,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 337 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-05 20:12:18,677 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 222 flow [2022-12-05 20:12:18,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2022-12-05 20:12:18,679 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-05 20:12:18,679 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 222 flow [2022-12-05 20:12:18,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:18,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:18,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:18,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:12:18,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1348456744, now seen corresponding path program 1 times [2022-12-05 20:12:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:18,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041196933] [2022-12-05 20:12:18,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:18,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:18,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:18,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041196933] [2022-12-05 20:12:18,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041196933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:18,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:18,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:12:18,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919500981] [2022-12-05 20:12:18,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:18,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:12:18,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:18,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:12:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:12:18,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:12:18,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:18,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:18,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:12:18,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:18,978 INFO L130 PetriNetUnfolder]: 624/1197 cut-off events. [2022-12-05 20:12:18,978 INFO L131 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2022-12-05 20:12:18,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3014 conditions, 1197 events. 624/1197 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5266 event pairs, 391 based on Foata normal form. 24/1221 useless extension candidates. Maximal degree in co-relation 2254. Up to 849 conditions per place. [2022-12-05 20:12:18,985 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 56 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2022-12-05 20:12:18,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 389 flow [2022-12-05 20:12:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:12:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:12:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-05 20:12:18,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 20:12:18,986 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 222 flow. Second operand 3 states and 60 transitions. [2022-12-05 20:12:18,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 389 flow [2022-12-05 20:12:18,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:12:18,991 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 254 flow [2022-12-05 20:12:18,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2022-12-05 20:12:18,992 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-05 20:12:18,992 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 254 flow [2022-12-05 20:12:18,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:18,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:18,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:18,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:12:18,993 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:18,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1882915942, now seen corresponding path program 1 times [2022-12-05 20:12:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:18,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617529480] [2022-12-05 20:12:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:19,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:19,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617529480] [2022-12-05 20:12:19,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617529480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:19,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:19,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 20:12:19,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499662955] [2022-12-05 20:12:19,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:19,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 20:12:19,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:19,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 20:12:19,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-05 20:12:19,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2022-12-05 20:12:19,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 254 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:19,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:19,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2022-12-05 20:12:19,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:20,300 INFO L130 PetriNetUnfolder]: 993/2080 cut-off events. [2022-12-05 20:12:20,300 INFO L131 PetriNetUnfolder]: For 1605/1607 co-relation queries the response was YES. [2022-12-05 20:12:20,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 2080 events. 993/2080 cut-off events. For 1605/1607 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 11080 event pairs, 337 based on Foata normal form. 0/2046 useless extension candidates. Maximal degree in co-relation 3282. Up to 835 conditions per place. [2022-12-05 20:12:20,312 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 99 selfloop transitions, 13 changer transitions 15/139 dead transitions. [2022-12-05 20:12:20,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 139 transitions, 861 flow [2022-12-05 20:12:20,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:12:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:12:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2022-12-05 20:12:20,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-05 20:12:20,314 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 254 flow. Second operand 9 states and 153 transitions. [2022-12-05 20:12:20,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 139 transitions, 861 flow [2022-12-05 20:12:20,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 139 transitions, 805 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-05 20:12:20,322 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 339 flow [2022-12-05 20:12:20,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=339, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2022-12-05 20:12:20,325 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2022-12-05 20:12:20,325 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 339 flow [2022-12-05 20:12:20,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:20,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:20,325 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:20,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:12:20,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:20,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:20,326 INFO L85 PathProgramCache]: Analyzing trace with hash -913865646, now seen corresponding path program 2 times [2022-12-05 20:12:20,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:20,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42843310] [2022-12-05 20:12:20,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:20,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:20,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:20,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42843310] [2022-12-05 20:12:20,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42843310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:20,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:20,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 20:12:20,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438765603] [2022-12-05 20:12:20,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:20,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 20:12:20,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:20,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 20:12:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-05 20:12:20,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2022-12-05 20:12:20,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 339 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:20,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:20,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2022-12-05 20:12:20,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:21,727 INFO L130 PetriNetUnfolder]: 1423/2979 cut-off events. [2022-12-05 20:12:21,728 INFO L131 PetriNetUnfolder]: For 2143/2147 co-relation queries the response was YES. [2022-12-05 20:12:21,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7609 conditions, 2979 events. 1423/2979 cut-off events. For 2143/2147 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 17524 event pairs, 336 based on Foata normal form. 6/2961 useless extension candidates. Maximal degree in co-relation 5681. Up to 796 conditions per place. [2022-12-05 20:12:21,749 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 100 selfloop transitions, 21 changer transitions 13/146 dead transitions. [2022-12-05 20:12:21,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 146 transitions, 939 flow [2022-12-05 20:12:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:12:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:12:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-12-05 20:12:21,750 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2022-12-05 20:12:21,750 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 339 flow. Second operand 9 states and 151 transitions. [2022-12-05 20:12:21,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 146 transitions, 939 flow [2022-12-05 20:12:21,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 146 transitions, 939 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:12:21,760 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 478 flow [2022-12-05 20:12:21,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=478, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2022-12-05 20:12:21,761 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2022-12-05 20:12:21,761 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 478 flow [2022-12-05 20:12:21,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:21,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:21,765 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:21,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:12:21,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:21,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:21,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1306793429, now seen corresponding path program 1 times [2022-12-05 20:12:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:21,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398699086] [2022-12-05 20:12:21,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:21,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:21,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:21,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398699086] [2022-12-05 20:12:21,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398699086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:12:21,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841924970] [2022-12-05 20:12:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:21,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:12:21,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:12:21,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:12:21,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-05 20:12:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:21,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 20:12:21,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:12:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 20:12:22,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 20:12:22,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841924970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:22,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 20:12:22,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-05 20:12:22,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486538517] [2022-12-05 20:12:22,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:22,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:12:22,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:22,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:12:22,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:12:22,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:12:22,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 478 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:22,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:22,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:12:22,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:22,492 INFO L130 PetriNetUnfolder]: 1834/3536 cut-off events. [2022-12-05 20:12:22,492 INFO L131 PetriNetUnfolder]: For 3388/3388 co-relation queries the response was YES. [2022-12-05 20:12:22,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9700 conditions, 3536 events. 1834/3536 cut-off events. For 3388/3388 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 19277 event pairs, 613 based on Foata normal form. 42/3562 useless extension candidates. Maximal degree in co-relation 7396. Up to 1234 conditions per place. [2022-12-05 20:12:22,516 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 107 selfloop transitions, 16 changer transitions 0/125 dead transitions. [2022-12-05 20:12:22,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 125 transitions, 922 flow [2022-12-05 20:12:22,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:12:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:12:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-05 20:12:22,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-05 20:12:22,518 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 478 flow. Second operand 6 states and 102 transitions. [2022-12-05 20:12:22,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 125 transitions, 922 flow [2022-12-05 20:12:22,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 125 transitions, 904 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-05 20:12:22,530 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 531 flow [2022-12-05 20:12:22,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2022-12-05 20:12:22,533 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2022-12-05 20:12:22,533 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 531 flow [2022-12-05 20:12:22,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:22,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:22,534 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-12-05 20:12:22,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-05 20:12:22,739 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,SelfDestructingSolverStorable7 [2022-12-05 20:12:22,739 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1220552396, now seen corresponding path program 2 times [2022-12-05 20:12:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:22,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136725232] [2022-12-05 20:12:22,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:22,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:22,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136725232] [2022-12-05 20:12:22,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136725232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:12:22,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779136659] [2022-12-05 20:12:22,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 20:12:22,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:12:22,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:12:22,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:12:22,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-05 20:12:22,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 20:12:22,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 20:12:22,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 20:12:22,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:12:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:23,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:12:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:23,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779136659] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:12:23,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:12:23,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-05 20:12:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555900277] [2022-12-05 20:12:23,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:12:23,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-05 20:12:23,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:23,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-05 20:12:23,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-12-05 20:12:23,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:12:23,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 531 flow. Second operand has 18 states, 18 states have (on average 6.444444444444445) internal successors, (116), 18 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:23,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:23,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:12:23,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:24,058 INFO L130 PetriNetUnfolder]: 2698/5171 cut-off events. [2022-12-05 20:12:24,058 INFO L131 PetriNetUnfolder]: For 7895/7895 co-relation queries the response was YES. [2022-12-05 20:12:24,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15091 conditions, 5171 events. 2698/5171 cut-off events. For 7895/7895 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 27300 event pairs, 633 based on Foata normal form. 64/5219 useless extension candidates. Maximal degree in co-relation 9626. Up to 1536 conditions per place. [2022-12-05 20:12:24,095 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 233 selfloop transitions, 31 changer transitions 6/272 dead transitions. [2022-12-05 20:12:24,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 272 transitions, 1994 flow [2022-12-05 20:12:24,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 20:12:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 20:12:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 274 transitions. [2022-12-05 20:12:24,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40294117647058825 [2022-12-05 20:12:24,097 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 531 flow. Second operand 17 states and 274 transitions. [2022-12-05 20:12:24,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 272 transitions, 1994 flow [2022-12-05 20:12:24,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 272 transitions, 1990 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-05 20:12:24,117 INFO L231 Difference]: Finished difference. Result has 101 places, 91 transitions, 769 flow [2022-12-05 20:12:24,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=769, PETRI_PLACES=101, PETRI_TRANSITIONS=91} [2022-12-05 20:12:24,117 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2022-12-05 20:12:24,117 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 91 transitions, 769 flow [2022-12-05 20:12:24,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.444444444444445) internal successors, (116), 18 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:24,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:24,118 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:24,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-05 20:12:24,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:12:24,323 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:24,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash 908400452, now seen corresponding path program 3 times [2022-12-05 20:12:24,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:24,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182067814] [2022-12-05 20:12:24,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:24,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 20:12:24,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:24,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182067814] [2022-12-05 20:12:24,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182067814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:12:24,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:12:24,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 20:12:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524175355] [2022-12-05 20:12:24,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:12:24,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 20:12:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:24,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 20:12:24,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-05 20:12:24,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:12:24,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 769 flow. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:24,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:24,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:12:24,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:12:27,184 INFO L130 PetriNetUnfolder]: 4268/8171 cut-off events. [2022-12-05 20:12:27,185 INFO L131 PetriNetUnfolder]: For 14843/14843 co-relation queries the response was YES. [2022-12-05 20:12:27,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25477 conditions, 8171 events. 4268/8171 cut-off events. For 14843/14843 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 48406 event pairs, 960 based on Foata normal form. 12/8152 useless extension candidates. Maximal degree in co-relation 19484. Up to 1812 conditions per place. [2022-12-05 20:12:27,242 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 184 selfloop transitions, 130 changer transitions 4/320 dead transitions. [2022-12-05 20:12:27,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 320 transitions, 2934 flow [2022-12-05 20:12:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-05 20:12:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-05 20:12:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 228 transitions. [2022-12-05 20:12:27,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2111111111111111 [2022-12-05 20:12:27,244 INFO L175 Difference]: Start difference. First operand has 101 places, 91 transitions, 769 flow. Second operand 27 states and 228 transitions. [2022-12-05 20:12:27,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 320 transitions, 2934 flow [2022-12-05 20:12:27,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 320 transitions, 2657 flow, removed 96 selfloop flow, removed 7 redundant places. [2022-12-05 20:12:27,345 INFO L231 Difference]: Finished difference. Result has 127 places, 187 transitions, 1787 flow [2022-12-05 20:12:27,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1787, PETRI_PLACES=127, PETRI_TRANSITIONS=187} [2022-12-05 20:12:27,347 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2022-12-05 20:12:27,347 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 187 transitions, 1787 flow [2022-12-05 20:12:27,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:27,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:12:27,347 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:12:27,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:12:27,348 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:12:27,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:12:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1998404668, now seen corresponding path program 4 times [2022-12-05 20:12:27,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:12:27,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918195624] [2022-12-05 20:12:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:12:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:12:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:12:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 20:12:28,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:12:28,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918195624] [2022-12-05 20:12:28,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918195624] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:12:28,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907598228] [2022-12-05 20:12:28,018 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 20:12:28,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:12:28,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:12:28,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:12:28,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-05 20:12:28,127 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 20:12:28,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 20:12:28,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-05 20:12:28,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:12:28,177 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-05 20:12:28,178 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 34 [2022-12-05 20:12:28,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-12-05 20:12:28,632 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 54 [2022-12-05 20:12:29,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-05 20:12:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:12:40,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:12:41,356 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_360 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_360) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-05 20:12:41,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:12:41,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-05 20:12:41,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:12:41,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-12-05 20:12:41,381 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 22 [2022-12-05 20:12:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 20:12:41,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907598228] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:12:41,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:12:41,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 41 [2022-12-05 20:12:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210309651] [2022-12-05 20:12:41,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:12:41,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-05 20:12:41,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:12:41,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-05 20:12:41,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1574, Unknown=4, NotChecked=80, Total=1806 [2022-12-05 20:12:41,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:12:41,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 187 transitions, 1787 flow. Second operand has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 43 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:12:41,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:12:41,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:12:41,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:16,740 INFO L130 PetriNetUnfolder]: 6238/11987 cut-off events. [2022-12-05 20:13:16,740 INFO L131 PetriNetUnfolder]: For 28104/28104 co-relation queries the response was YES. [2022-12-05 20:13:16,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39286 conditions, 11987 events. 6238/11987 cut-off events. For 28104/28104 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 76343 event pairs, 885 based on Foata normal form. 76/12008 useless extension candidates. Maximal degree in co-relation 30233. Up to 2620 conditions per place. [2022-12-05 20:13:16,812 INFO L137 encePairwiseOnDemand]: 18/40 looper letters, 326 selfloop transitions, 320 changer transitions 15/663 dead transitions. [2022-12-05 20:13:16,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 663 transitions, 5855 flow [2022-12-05 20:13:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-05 20:13:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-12-05 20:13:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 543 transitions. [2022-12-05 20:13:16,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20261194029850746 [2022-12-05 20:13:16,816 INFO L175 Difference]: Start difference. First operand has 127 places, 187 transitions, 1787 flow. Second operand 67 states and 543 transitions. [2022-12-05 20:13:16,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 663 transitions, 5855 flow [2022-12-05 20:13:16,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 663 transitions, 5797 flow, removed 26 selfloop flow, removed 3 redundant places. [2022-12-05 20:13:16,934 INFO L231 Difference]: Finished difference. Result has 206 places, 368 transitions, 4222 flow [2022-12-05 20:13:16,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=4222, PETRI_PLACES=206, PETRI_TRANSITIONS=368} [2022-12-05 20:13:16,936 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places. [2022-12-05 20:13:16,936 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 368 transitions, 4222 flow [2022-12-05 20:13:16,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 43 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:16,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:16,936 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:13:16,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-05 20:13:17,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:13:17,141 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:17,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1499841492, now seen corresponding path program 1 times [2022-12-05 20:13:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:17,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367689653] [2022-12-05 20:13:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:19,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367689653] [2022-12-05 20:13:19,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367689653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:13:19,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496014891] [2022-12-05 20:13:19,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:19,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:13:19,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:13:19,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:13:19,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-05 20:13:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:20,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-05 20:13:20,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:13:20,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-12-05 20:13:20,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 20:13:20,709 INFO L350 Elim1Store]: Elim1 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 72 treesize of output 43 [2022-12-05 20:13:21,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-05 20:13:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:34,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:13:35,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-12-05 20:13:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:36,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496014891] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:13:36,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:13:36,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 56 [2022-12-05 20:13:36,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586603204] [2022-12-05 20:13:36,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:13:36,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-05 20:13:36,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:13:36,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-05 20:13:36,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=2925, Unknown=3, NotChecked=0, Total=3192 [2022-12-05 20:13:36,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:13:36,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 368 transitions, 4222 flow. Second operand has 57 states, 57 states have (on average 3.8947368421052633) internal successors, (222), 57 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:36,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:13:36,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:13:36,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:57,998 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 244 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:14:15,898 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 247 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:16:36,704 INFO L130 PetriNetUnfolder]: 10408/20041 cut-off events. [2022-12-05 20:16:36,704 INFO L131 PetriNetUnfolder]: For 184726/184726 co-relation queries the response was YES. [2022-12-05 20:16:36,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111420 conditions, 20041 events. 10408/20041 cut-off events. For 184726/184726 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 144673 event pairs, 1510 based on Foata normal form. 12/19952 useless extension candidates. Maximal degree in co-relation 92762. Up to 7338 conditions per place. [2022-12-05 20:16:37,037 INFO L137 encePairwiseOnDemand]: 24/40 looper letters, 614 selfloop transitions, 551 changer transitions 65/1232 dead transitions. [2022-12-05 20:16:37,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 1232 transitions, 14976 flow [2022-12-05 20:16:37,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-12-05 20:16:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2022-12-05 20:16:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 852 transitions. [2022-12-05 20:16:37,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2088235294117647 [2022-12-05 20:16:37,048 INFO L175 Difference]: Start difference. First operand has 206 places, 368 transitions, 4222 flow. Second operand 102 states and 852 transitions. [2022-12-05 20:16:37,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 1232 transitions, 14976 flow [2022-12-05 20:16:37,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 1232 transitions, 13971 flow, removed 314 selfloop flow, removed 9 redundant places. [2022-12-05 20:16:37,506 INFO L231 Difference]: Finished difference. Result has 308 places, 645 transitions, 7843 flow [2022-12-05 20:16:37,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3691, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=102, PETRI_FLOW=7843, PETRI_PLACES=308, PETRI_TRANSITIONS=645} [2022-12-05 20:16:37,506 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 266 predicate places. [2022-12-05 20:16:37,507 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 645 transitions, 7843 flow [2022-12-05 20:16:37,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.8947368421052633) internal successors, (222), 57 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:16:37,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:16:37,507 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:16:37,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-05 20:16:37,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-05 20:16:37,708 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:16:37,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:16:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1433783824, now seen corresponding path program 2 times [2022-12-05 20:16:37,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:16:37,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550511953] [2022-12-05 20:16:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:16:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:16:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:16:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:16:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:16:39,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550511953] [2022-12-05 20:16:39,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550511953] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:16:39,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141984507] [2022-12-05 20:16:39,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 20:16:39,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:16:39,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:16:39,548 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:16:39,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-05 20:16:39,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 20:16:39,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 20:16:39,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-05 20:16:39,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:16:39,755 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-05 20:16:39,756 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 34 [2022-12-05 20:16:40,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-12-05 20:16:40,503 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 38 [2022-12-05 20:16:40,779 INFO L321 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2022-12-05 20:16:40,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 59 treesize of output 52 [2022-12-05 20:16:41,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-05 20:16:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:16:49,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:16:50,121 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_get_top_#res#1| Int) (v_ArrVal_496 (Array Int Int)) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53| Int)) (or (<= 400 |aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53|) (not (= 4294967294 (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_496) |c_~#arr~0.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) (mod |aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53| 4294967296)) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53| 0))) is different from false [2022-12-05 20:16:50,156 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_get_top_#res#1| Int) (v_ArrVal_496 (Array Int Int)) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53| Int)) (or (<= 400 |aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53|) (not (= 4294967294 (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_496) |c_~#arr~0.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) (mod |aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53| 4294967296)) (+ (* |c_t1Thread1of1ForFork1_inc_top_#t~post31#1| 4) |c_~#arr~0.offset|)) 4294967296))) (< |aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53| 0))) is different from false [2022-12-05 20:16:50,184 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_get_top_#res#1| Int) (v_ArrVal_496 (Array Int Int)) (|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53| Int)) (or (not (= (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_496) |c_~#arr~0.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* 4 |t1Thread1of1ForFork1_get_top_#res#1|)) (mod |aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53| 4294967296)) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)) (<= 400 |aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53|) (< |aux_mod_v_t1Thread1of1ForFork1_~tmp~0#1_91_53| 0))) is different from false [2022-12-05 20:16:50,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:16:50,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-12-05 20:16:50,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:16:50,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 71 [2022-12-05 20:16:50,225 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 69 [2022-12-05 20:16:50,241 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 4 [2022-12-05 20:16:50,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:16:50,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 111 [2022-12-05 20:16:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-05 20:16:50,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141984507] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:16:50,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:16:50,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 18] total 58 [2022-12-05 20:16:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011821059] [2022-12-05 20:16:50,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:16:50,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-12-05 20:16:50,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:16:50,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-12-05 20:16:50,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2955, Unknown=19, NotChecked=336, Total=3540 [2022-12-05 20:16:50,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:16:50,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 645 transitions, 7843 flow. Second operand has 60 states, 60 states have (on average 3.75) internal successors, (225), 60 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:16:50,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:16:50,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:16:50,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:16:55,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 20:16:57,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 20:17:55,905 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 73 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:18:14,721 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 70 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:18:24,445 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 151 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:22:08,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 20:23:03,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 20:23:12,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 20:23:39,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 20:23:47,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 20:24:16,198 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 83 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:24:39,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 20:25:07,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 20:25:15,265 WARN L233 SmtUtils]: Spent 6.67s on a formula simplification. DAG size of input: 136 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:25:24,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 20:25:26,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 20:25:28,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 20:25:30,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Received shutdown request... [2022-12-05 20:25:41,866 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 20:25:41,867 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 20:25:42,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-05 20:25:43,068 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-05 20:25:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 386 states. [2022-12-05 20:25:43,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-12-05 20:25:43,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:25:43,098 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:500) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:238) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-05 20:25:43,101 INFO L158 Benchmark]: Toolchain (without parser) took 812296.15ms. Allocated memory was 174.1MB in the beginning and 855.6MB in the end (delta: 681.6MB). Free memory was 147.3MB in the beginning and 150.3MB in the end (delta: -3.1MB). Peak memory consumption was 733.3MB. Max. memory is 8.0GB. [2022-12-05 20:25:43,101 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory was 105.2MB in the beginning and 105.2MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:25:43,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.46ms. Allocated memory is still 174.1MB. Free memory was 147.3MB in the beginning and 149.3MB in the end (delta: -2.0MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-05 20:25:43,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.10ms. Allocated memory is still 174.1MB. Free memory was 149.3MB in the beginning and 146.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:25:43,102 INFO L158 Benchmark]: Boogie Preprocessor took 27.10ms. Allocated memory is still 174.1MB. Free memory was 146.7MB in the beginning and 145.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 20:25:43,102 INFO L158 Benchmark]: RCFGBuilder took 541.56ms. Allocated memory is still 174.1MB. Free memory was 145.1MB in the beginning and 127.8MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-05 20:25:43,102 INFO L158 Benchmark]: TraceAbstraction took 811065.04ms. Allocated memory was 174.1MB in the beginning and 855.6MB in the end (delta: 681.6MB). Free memory was 127.3MB in the beginning and 150.3MB in the end (delta: -23.0MB). Peak memory consumption was 713.4MB. Max. memory is 8.0GB. [2022-12-05 20:25:43,103 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.15ms. Allocated memory is still 127.9MB. Free memory was 105.2MB in the beginning and 105.2MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 597.46ms. Allocated memory is still 174.1MB. Free memory was 147.3MB in the beginning and 149.3MB in the end (delta: -2.0MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.10ms. Allocated memory is still 174.1MB. Free memory was 149.3MB in the beginning and 146.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.10ms. Allocated memory is still 174.1MB. Free memory was 146.7MB in the beginning and 145.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 541.56ms. Allocated memory is still 174.1MB. Free memory was 145.1MB in the beginning and 127.8MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 811065.04ms. Allocated memory was 174.1MB in the beginning and 855.6MB in the end (delta: 681.6MB). Free memory was 127.3MB in the beginning and 150.3MB in the end (delta: -23.0MB). Peak memory consumption was 713.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 136 PlacesBefore, 42 PlacesAfterwards, 139 TransitionsBefore, 40 TransitionsAfterwards, 6382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 76 ConcurrentYvCompositions, 5 ChoiceCompositions, 109 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5198, independent: 5111, independent conditional: 5111, independent unconditional: 0, dependent: 87, dependent conditional: 87, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5198, independent: 5111, independent conditional: 0, independent unconditional: 5111, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5198, independent: 5111, independent conditional: 0, independent unconditional: 5111, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5198, independent: 5111, independent conditional: 0, independent unconditional: 5111, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4190, independent: 4131, independent conditional: 0, independent unconditional: 4131, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4190, independent: 4115, independent conditional: 0, independent unconditional: 4115, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 124, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5198, independent: 980, independent conditional: 0, independent unconditional: 980, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 4190, unknown conditional: 0, unknown unconditional: 4190] , Statistics on independence cache: Total cache size (in pairs): 7645, Positive cache size: 7586, Positive conditional cache size: 0, Positive unconditional cache size: 7586, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown