/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 09:41:04,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 09:41:04,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 09:41:04,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 09:41:04,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 09:41:04,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 09:41:04,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 09:41:04,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 09:41:04,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 09:41:04,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 09:41:04,410 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 09:41:04,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 09:41:04,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 09:41:04,412 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 09:41:04,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 09:41:04,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 09:41:04,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 09:41:04,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 09:41:04,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 09:41:04,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 09:41:04,413 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 09:41:04,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 09:41:04,414 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 09:41:04,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 09:41:04,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 09:41:04,415 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 09:41:04,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 09:41:04,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:41:04,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 09:41:04,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 09:41:04,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 09:41:04,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 09:41:04,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 09:41:04,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 09:41:04,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 09:41:04,418 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 09:41:04,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 09:41:04,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 09:41:04,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 09:41:04,778 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 09:41:04,779 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 09:41:04,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-08-27 09:41:06,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 09:41:06,322 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 09:41:06,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-08-27 09:41:06,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9da1b6b77/6485b6819bff4b73987a0f5fb1439a26/FLAG067fbfaaf [2023-08-27 09:41:06,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9da1b6b77/6485b6819bff4b73987a0f5fb1439a26 [2023-08-27 09:41:06,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 09:41:06,367 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 09:41:06,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 09:41:06,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 09:41:06,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 09:41:06,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79306f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06, skipping insertion in model container [2023-08-27 09:41:06,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,426 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 09:41:06,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:41:06,745 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 09:41:06,779 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-27 09:41:06,780 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-27 09:41:06,798 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [686] [2023-08-27 09:41:06,798 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [687] [2023-08-27 09:41:06,798 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [688] [2023-08-27 09:41:06,799 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [689] [2023-08-27 09:41:06,799 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [690] [2023-08-27 09:41:06,801 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [701] [2023-08-27 09:41:06,803 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [702] [2023-08-27 09:41:06,803 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [703] [2023-08-27 09:41:06,803 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [704] [2023-08-27 09:41:06,810 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: inline unsigned [708] [2023-08-27 09:41:06,810 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [709] [2023-08-27 09:41:06,812 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [722] [2023-08-27 09:41:06,813 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: inline unsigned [726] [2023-08-27 09:41:06,813 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [727] [2023-08-27 09:41:06,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:41:06,849 INFO L206 MainTranslator]: Completed translation [2023-08-27 09:41:06,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06 WrapperNode [2023-08-27 09:41:06,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 09:41:06,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 09:41:06,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 09:41:06,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 09:41:06,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,907 INFO L138 Inliner]: procedures = 172, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 165 [2023-08-27 09:41:06,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 09:41:06,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 09:41:06,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 09:41:06,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 09:41:06,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 09:41:06,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 09:41:06,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 09:41:06,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 09:41:06,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (1/1) ... [2023-08-27 09:41:06,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:41:06,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:41:06,978 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) [2023-08-27 09:41:07,008 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 [2023-08-27 09:41:07,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 09:41:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-27 09:41:07,025 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-27 09:41:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 09:41:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 09:41:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 09:41:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 09:41:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 09:41:07,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 09:41:07,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 09:41:07,027 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 09:41:07,159 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 09:41:07,161 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 09:41:07,493 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 09:41:07,725 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 09:41:07,726 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-27 09:41:07,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:41:07 BoogieIcfgContainer [2023-08-27 09:41:07,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 09:41:07,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 09:41:07,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 09:41:07,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 09:41:07,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:41:06" (1/3) ... [2023-08-27 09:41:07,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a774033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:41:07, skipping insertion in model container [2023-08-27 09:41:07,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:41:06" (2/3) ... [2023-08-27 09:41:07,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a774033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:41:07, skipping insertion in model container [2023-08-27 09:41:07,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:41:07" (3/3) ... [2023-08-27 09:41:07,738 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2023-08-27 09:41:07,753 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 09:41:07,753 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-27 09:41:07,753 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 09:41:07,811 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 09:41:07,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-27 09:41:07,874 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-27 09:41:07,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:41:07,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-27 09:41:07,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 98 transitions, 201 flow [2023-08-27 09:41:07,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 98 transitions, 201 flow [2023-08-27 09:41:07,885 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 09:41:07,893 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-27 09:41:07,895 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-27 09:41:07,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-27 09:41:07,916 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-27 09:41:07,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:41:07,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-27 09:41:07,918 INFO L119 LiptonReduction]: Number of co-enabled transitions 1690 [2023-08-27 09:41:11,032 INFO L134 LiptonReduction]: Checked pairs total: 2226 [2023-08-27 09:41:11,033 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-08-27 09:41:11,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 09:41:11,049 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;@5d36c4b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 09:41:11,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-27 09:41:11,053 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 09:41:11,053 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-27 09:41:11,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:41:11,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:41:11,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 09:41:11,054 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONASSERT === [thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT] === [2023-08-27 09:41:11,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:41:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 943014798, now seen corresponding path program 1 times [2023-08-27 09:41:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:41:11,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455233869] [2023-08-27 09:41:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:41:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:41:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:41:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:41:11,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:41:11,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455233869] [2023-08-27 09:41:11,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455233869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:41:11,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:41:11,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:41:11,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899070133] [2023-08-27 09:41:11,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:41:11,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-27 09:41:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:41:11,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-27 09:41:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-27 09:41:11,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 183 [2023-08-27 09:41:11,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 27 transitions, 59 flow. Second operand has 2 states, 2 states have (on average 90.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:11,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:41:11,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 183 [2023-08-27 09:41:11,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:41:11,318 INFO L124 PetriNetUnfolderBase]: 43/93 cut-off events. [2023-08-27 09:41:11,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:41:11,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 93 events. 43/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 273 event pairs, 28 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 174. Up to 91 conditions per place. [2023-08-27 09:41:11,321 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 16 selfloop transitions, 0 changer transitions 7/24 dead transitions. [2023-08-27 09:41:11,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 99 flow [2023-08-27 09:41:11,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-27 09:41:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-27 09:41:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2023-08-27 09:41:11,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546448087431694 [2023-08-27 09:41:11,333 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 200 transitions. [2023-08-27 09:41:11,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 200 transitions. [2023-08-27 09:41:11,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:41:11,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 200 transitions. [2023-08-27 09:41:11,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:11,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:11,349 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:11,351 INFO L175 Difference]: Start difference. First operand has 23 places, 27 transitions, 59 flow. Second operand 2 states and 200 transitions. [2023-08-27 09:41:11,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 99 flow [2023-08-27 09:41:11,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 09:41:11,355 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 39 flow [2023-08-27 09:41:11,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=39, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-08-27 09:41:11,359 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2023-08-27 09:41:11,359 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 39 flow [2023-08-27 09:41:11,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:11,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:41:11,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:41:11,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 09:41:11,360 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONASSERT === [thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT] === [2023-08-27 09:41:11,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:41:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2528220, now seen corresponding path program 1 times [2023-08-27 09:41:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:41:11,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862830627] [2023-08-27 09:41:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:41:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:41:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:41:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:41:12,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:41:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862830627] [2023-08-27 09:41:12,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862830627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:41:12,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:41:12,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 09:41:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393942463] [2023-08-27 09:41:12,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:41:12,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 09:41:12,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:41:12,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 09:41:12,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-27 09:41:12,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 183 [2023-08-27 09:41:12,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 39 flow. Second operand has 8 states, 8 states have (on average 51.0) internal successors, (408), 8 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:12,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:41:12,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 183 [2023-08-27 09:41:12,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:41:12,372 INFO L124 PetriNetUnfolderBase]: 30/89 cut-off events. [2023-08-27 09:41:12,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:41:12,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 89 events. 30/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 325 event pairs, 4 based on Foata normal form. 3/81 useless extension candidates. Maximal degree in co-relation 180. Up to 35 conditions per place. [2023-08-27 09:41:12,373 INFO L140 encePairwiseOnDemand]: 175/183 looper letters, 25 selfloop transitions, 11 changer transitions 3/40 dead transitions. [2023-08-27 09:41:12,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 40 transitions, 163 flow [2023-08-27 09:41:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:41:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:41:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 390 transitions. [2023-08-27 09:41:12,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3044496487119438 [2023-08-27 09:41:12,383 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 390 transitions. [2023-08-27 09:41:12,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 390 transitions. [2023-08-27 09:41:12,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:41:12,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 390 transitions. [2023-08-27 09:41:12,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 55.714285714285715) internal successors, (390), 7 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:12,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:12,391 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:12,393 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 39 flow. Second operand 7 states and 390 transitions. [2023-08-27 09:41:12,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 40 transitions, 163 flow [2023-08-27 09:41:12,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 40 transitions, 163 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 09:41:12,399 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 111 flow [2023-08-27 09:41:12,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-08-27 09:41:12,404 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2023-08-27 09:41:12,404 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 111 flow [2023-08-27 09:41:12,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 51.0) internal successors, (408), 8 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:12,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:41:12,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:41:12,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 09:41:12,405 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT] === [2023-08-27 09:41:12,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:41:12,406 INFO L85 PathProgramCache]: Analyzing trace with hash 4215826, now seen corresponding path program 1 times [2023-08-27 09:41:12,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:41:12,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974830833] [2023-08-27 09:41:12,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:41:12,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:41:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:41:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:41:13,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:41:13,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974830833] [2023-08-27 09:41:13,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974830833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:41:13,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:41:13,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 09:41:13,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476251630] [2023-08-27 09:41:13,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:41:13,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 09:41:13,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:41:13,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 09:41:13,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-27 09:41:13,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 183 [2023-08-27 09:41:13,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 111 flow. Second operand has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:13,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:41:13,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 183 [2023-08-27 09:41:13,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:41:13,297 INFO L124 PetriNetUnfolderBase]: 28/101 cut-off events. [2023-08-27 09:41:13,297 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-27 09:41:13,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 101 events. 28/101 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 438 event pairs, 3 based on Foata normal form. 3/99 useless extension candidates. Maximal degree in co-relation 277. Up to 47 conditions per place. [2023-08-27 09:41:13,299 INFO L140 encePairwiseOnDemand]: 174/183 looper letters, 32 selfloop transitions, 17 changer transitions 6/56 dead transitions. [2023-08-27 09:41:13,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 313 flow [2023-08-27 09:41:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 09:41:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 09:41:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 619 transitions. [2023-08-27 09:41:13,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3075012419274714 [2023-08-27 09:41:13,303 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 619 transitions. [2023-08-27 09:41:13,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 619 transitions. [2023-08-27 09:41:13,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:41:13,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 619 transitions. [2023-08-27 09:41:13,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 56.27272727272727) internal successors, (619), 11 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:13,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:13,308 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:13,308 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 111 flow. Second operand 11 states and 619 transitions. [2023-08-27 09:41:13,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 313 flow [2023-08-27 09:41:13,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 313 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 09:41:13,313 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 229 flow [2023-08-27 09:41:13,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=229, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-27 09:41:13,315 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 22 predicate places. [2023-08-27 09:41:13,315 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 229 flow [2023-08-27 09:41:13,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:13,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:41:13,315 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:41:13,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 09:41:13,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT] === [2023-08-27 09:41:13,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:41:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash -929726215, now seen corresponding path program 1 times [2023-08-27 09:41:13,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:41:13,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64088004] [2023-08-27 09:41:13,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:41:13,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:41:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:41:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:41:14,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:41:14,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64088004] [2023-08-27 09:41:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64088004] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:41:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128643024] [2023-08-27 09:41:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:41:14,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:41:14,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:41:14,357 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) [2023-08-27 09:41:14,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-27 09:41:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:41:14,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-27 09:41:14,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:41:14,603 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-27 09:41:14,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-27 09:41:14,675 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-27 09:41:14,774 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-27 09:41:14,775 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 09:41:14,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:15,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:15,191 INFO L322 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-08-27 09:41:15,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 150 treesize of output 495 [2023-08-27 09:41:15,263 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-27 09:41:15,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 36 [2023-08-27 09:41:15,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-27 09:41:15,672 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:15,674 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 227 [2023-08-27 09:41:15,800 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:15,802 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 227 [2023-08-27 09:41:15,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:15,923 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:15,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:15,929 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:15,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 215 [2023-08-27 09:41:16,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:16,052 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:16,064 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:16,146 INFO L322 Elim1Store]: treesize reduction 81, result has 17.3 percent of original size [2023-08-27 09:41:16,147 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 150 treesize of output 258 [2023-08-27 09:41:16,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:16,374 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:16,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:16,393 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:16,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 220 [2023-08-27 09:41:16,511 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:16,513 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 255 [2023-08-27 09:41:16,660 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:16,662 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 225 [2023-08-27 09:41:16,712 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:16,713 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 170 [2023-08-27 09:41:16,907 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:16,912 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 280 [2023-08-27 09:41:17,018 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:17,021 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 294 [2023-08-27 09:41:17,081 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:17,084 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 452 [2023-08-27 09:41:17,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:17,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:17,961 INFO L322 Elim1Store]: treesize reduction 219, result has 22.1 percent of original size [2023-08-27 09:41:17,962 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 1697 treesize of output 2553 [2023-08-27 09:41:18,157 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 609 treesize of output 610 [2023-08-27 09:41:18,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 604 treesize of output 602 [2023-08-27 09:41:18,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-08-27 09:41:18,781 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-08-27 09:41:19,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-27 09:41:19,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-08-27 09:41:20,264 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:20,266 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1494 [2023-08-27 09:41:20,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:20,565 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:20,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:20,626 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:20,639 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:20,640 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:20,644 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:20,657 INFO L217 Elim1Store]: Index analysis took 334 ms [2023-08-27 09:41:20,795 INFO L322 Elim1Store]: treesize reduction 271, result has 0.4 percent of original size [2023-08-27 09:41:20,796 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 824 treesize of output 2591 [2023-08-27 09:41:23,297 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:23,299 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3299 [2023-08-27 09:41:23,905 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:23,907 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1967 [2023-08-27 09:41:24,169 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:24,171 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3299 [2023-08-27 09:41:24,467 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:24,469 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1815 [2023-08-27 09:41:24,745 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:24,747 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1479 [2023-08-27 09:41:24,865 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:24,866 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1308 [2023-08-27 09:41:25,033 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:25,034 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1815 [2023-08-27 09:41:25,315 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:25,318 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1988 [2023-08-27 09:41:25,472 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:25,473 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1618 [2023-08-27 09:41:26,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:26,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:26,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:26,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:26,423 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-08-27 09:41:26,423 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 71 [2023-08-27 09:41:26,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:26,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:26,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:26,562 INFO L322 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2023-08-27 09:41:26,564 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 222302440 treesize of output 138404099 [2023-08-27 09:41:26,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:26,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:26,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:41:26,903 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:41:26,909 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 584 treesize of output 96 [2023-08-27 09:41:26,931 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:41:26,932 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 404 [2023-08-27 09:41:28,252 INFO L322 Elim1Store]: treesize reduction 104, result has 45.0 percent of original size [2023-08-27 09:41:28,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 1114538 treesize of output 983501 [2023-08-27 09:41:28,281 INFO L351 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 148 treesize of output 146 [2023-08-27 09:41:28,292 INFO L351 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 146 treesize of output 144 [2023-08-27 09:41:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:41:29,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:41:29,414 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_111 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_111))) (or (< (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)) is different from false [2023-08-27 09:41:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:41:32,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128643024] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:41:32,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:41:32,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2023-08-27 09:41:32,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752017875] [2023-08-27 09:41:32,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:41:32,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 09:41:32,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:41:32,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 09:41:32,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=343, Unknown=16, NotChecked=38, Total=462 [2023-08-27 09:41:32,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 183 [2023-08-27 09:41:32,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 229 flow. Second operand has 22 states, 22 states have (on average 49.36363636363637) internal successors, (1086), 22 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:41:32,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:41:32,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 183 [2023-08-27 09:41:32,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:41:46,258 WARN L234 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 291 DAG size of output: 203 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:43:22,947 WARN L234 SmtUtils]: Spent 1.52m on a formula simplification. DAG size of input: 134 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:45:34,859 WARN L234 SmtUtils]: Spent 2.09m on a formula simplification. DAG size of input: 162 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:45:37,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:45:39,213 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] [2023-08-27 09:45:41,992 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] [2023-08-27 09:45:42,146 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse1 (mod .cse5 4294967296)) (.cse2 (+ 1 .cse5))) (and (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int) (v_ArrVal_105 (Array Int Int)) (|v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_67| Int) (v_ArrVal_107 (Array Int Int)) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse0 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_101) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_107) |c_~#value~0.base|) |c_~#value~0.offset| .cse2)) |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_67| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_110) |c_~#value~0.base| v_ArrVal_105) |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_67|) 0 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_111))) (or (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_67|) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|)))) (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int) (v_ArrVal_105 (Array Int Int)) (v_ArrVal_107 (Array Int Int)) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_101) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_107) |c_~#value~0.base|) |c_~#value~0.offset| .cse2)) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_110) |c_~#value~0.base| v_ArrVal_105) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_111))) (or (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|)))) (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int) (v_ArrVal_105 (Array Int Int)) (v_ArrVal_107 (Array Int Int)) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse4 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_101) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_107) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_110) |c_~#value~0.base| v_ArrVal_105) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_111))) (or (< (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse4 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|))))))) is different from false [2023-08-27 09:45:58,235 WARN L234 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:46:00,245 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] [2023-08-27 09:46:02,564 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] [2023-08-27 09:46:04,758 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] [2023-08-27 09:46:06,774 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] [2023-08-27 09:46:08,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:46:10,942 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 [1] [2023-08-27 09:46:12,958 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] [2023-08-27 09:46:13,661 INFO L124 PetriNetUnfolderBase]: 9/52 cut-off events. [2023-08-27 09:46:13,661 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-27 09:46:13,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 52 events. 9/52 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 126 event pairs, 1 based on Foata normal form. 11/59 useless extension candidates. Maximal degree in co-relation 185. Up to 15 conditions per place. [2023-08-27 09:46:13,662 INFO L140 encePairwiseOnDemand]: 173/183 looper letters, 12 selfloop transitions, 12 changer transitions 15/40 dead transitions. [2023-08-27 09:46:13,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 291 flow [2023-08-27 09:46:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-27 09:46:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-27 09:46:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 712 transitions. [2023-08-27 09:46:13,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2779078844652615 [2023-08-27 09:46:13,666 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 712 transitions. [2023-08-27 09:46:13,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 712 transitions. [2023-08-27 09:46:13,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:46:13,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 712 transitions. [2023-08-27 09:46:13,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 50.857142857142854) internal successors, (712), 14 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:46:13,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:46:13,673 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:46:13,673 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 229 flow. Second operand 14 states and 712 transitions. [2023-08-27 09:46:13,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 291 flow [2023-08-27 09:46:13,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 257 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-27 09:46:13,676 INFO L231 Difference]: Finished difference. Result has 52 places, 21 transitions, 154 flow [2023-08-27 09:46:13,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=154, PETRI_PLACES=52, PETRI_TRANSITIONS=21} [2023-08-27 09:46:13,677 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 29 predicate places. [2023-08-27 09:46:13,677 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 21 transitions, 154 flow [2023-08-27 09:46:13,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 49.36363636363637) internal successors, (1086), 22 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:46:13,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:46:13,677 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 09:46:13,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-27 09:46:13,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:46:13,878 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT] === [2023-08-27 09:46:13,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:46:13,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1160064917, now seen corresponding path program 1 times [2023-08-27 09:46:13,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:46:13,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913742380] [2023-08-27 09:46:13,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:46:13,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:46:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:46:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:46:18,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:46:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913742380] [2023-08-27 09:46:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913742380] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:46:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358842685] [2023-08-27 09:46:18,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:46:18,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:46:18,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:46:18,341 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) [2023-08-27 09:46:18,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-27 09:46:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:46:18,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-27 09:46:18,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:46:21,030 INFO L322 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-08-27 09:46:21,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2023-08-27 09:46:21,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-27 09:46:21,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-27 09:46:21,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-27 09:46:21,620 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:46:21,621 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 271 [2023-08-27 09:46:21,897 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:46:21,898 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 121 [2023-08-27 09:46:23,320 INFO L322 Elim1Store]: treesize reduction 111, result has 18.4 percent of original size [2023-08-27 09:46:23,320 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 256 treesize of output 388 [2023-08-27 09:46:23,738 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:46:23,820 INFO L217 Elim1Store]: Index analysis took 261 ms [2023-08-27 09:46:23,883 INFO L322 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2023-08-27 09:46:23,883 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 119 [2023-08-27 09:46:24,107 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:46:24,108 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2023-08-27 09:46:24,189 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:46:24,190 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2023-08-27 09:46:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 09:46:25,090 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 09:46:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358842685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:46:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 09:46:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2023-08-27 09:46:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706619993] [2023-08-27 09:46:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:46:25,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:46:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:46:25,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:46:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-08-27 09:46:25,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 183 [2023-08-27 09:46:25,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 21 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:46:25,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:46:25,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 183 [2023-08-27 09:46:25,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:46:25,492 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2023-08-27 09:46:25,492 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-27 09:46:25,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 24 events. 3/24 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 107. Up to 9 conditions per place. [2023-08-27 09:46:25,492 INFO L140 encePairwiseOnDemand]: 177/183 looper letters, 0 selfloop transitions, 0 changer transitions 19/19 dead transitions. [2023-08-27 09:46:25,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 19 transitions, 167 flow [2023-08-27 09:46:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:46:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:46:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 404 transitions. [2023-08-27 09:46:25,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3679417122040073 [2023-08-27 09:46:25,495 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 404 transitions. [2023-08-27 09:46:25,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 404 transitions. [2023-08-27 09:46:25,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:46:25,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 404 transitions. [2023-08-27 09:46:25,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:46:25,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:46:25,498 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:46:25,498 INFO L175 Difference]: Start difference. First operand has 52 places, 21 transitions, 154 flow. Second operand 6 states and 404 transitions. [2023-08-27 09:46:25,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 19 transitions, 167 flow [2023-08-27 09:46:25,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 19 transitions, 124 flow, removed 2 selfloop flow, removed 16 redundant places. [2023-08-27 09:46:25,500 INFO L231 Difference]: Finished difference. Result has 36 places, 0 transitions, 0 flow [2023-08-27 09:46:25,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=36, PETRI_TRANSITIONS=0} [2023-08-27 09:46:25,500 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 13 predicate places. [2023-08-27 09:46:25,501 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 0 transitions, 0 flow [2023-08-27 09:46:25,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:46:25,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2023-08-27 09:46:25,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONASSERT (2 of 4 remaining) [2023-08-27 09:46:25,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONASSERT (1 of 4 remaining) [2023-08-27 09:46:25,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONASSERT (0 of 4 remaining) [2023-08-27 09:46:25,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-27 09:46:25,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:46:25,710 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-27 09:46:25,712 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-27 09:46:25,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-27 09:46:25,729 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-27 09:46:25,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:46:25,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-27 09:46:25,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 98 transitions, 201 flow [2023-08-27 09:46:25,732 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 98 transitions, 201 flow [2023-08-27 09:46:25,732 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 09:46:25,732 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-27 09:46:25,733 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-27 09:46:25,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-27 09:46:25,741 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-27 09:46:25,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:46:25,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-27 09:46:25,745 INFO L119 LiptonReduction]: Number of co-enabled transitions 1690 [2023-08-27 09:47:08,220 INFO L134 LiptonReduction]: Checked pairs total: 2365 [2023-08-27 09:47:08,221 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-08-27 09:47:08,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-27 09:47:08,223 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;@5d36c4b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 09:47:08,223 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-27 09:47:08,226 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 09:47:08,226 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-27 09:47:08,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:47:08,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:47:08,226 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-27 09:47:08,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 09:47:08,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:47:08,227 INFO L85 PathProgramCache]: Analyzing trace with hash -836239155, now seen corresponding path program 1 times [2023-08-27 09:47:08,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:47:08,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003609937] [2023-08-27 09:47:08,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:47:08,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:47:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 09:47:08,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 09:47:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 09:47:08,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 09:47:08,264 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 09:47:08,264 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-27 09:47:08,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 09:47:08,265 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-27 09:47:08,265 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-27 09:47:08,266 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-27 09:47:08,266 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-27 09:47:08,318 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 09:47:08,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-08-27 09:47:08,342 INFO L124 PetriNetUnfolderBase]: 17/186 cut-off events. [2023-08-27 09:47:08,342 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 09:47:08,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 17/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2023-08-27 09:47:08,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 164 transitions, 340 flow [2023-08-27 09:47:08,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 164 transitions, 340 flow [2023-08-27 09:47:08,345 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 09:47:08,345 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 164 transitions, 340 flow [2023-08-27 09:47:08,346 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 164 transitions, 340 flow [2023-08-27 09:47:08,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-08-27 09:47:08,369 INFO L124 PetriNetUnfolderBase]: 17/186 cut-off events. [2023-08-27 09:47:08,369 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 09:47:08,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 17/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2023-08-27 09:47:08,376 INFO L119 LiptonReduction]: Number of co-enabled transitions 11960 [2023-08-27 09:48:15,555 INFO L134 LiptonReduction]: Checked pairs total: 19188 [2023-08-27 09:48:15,555 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-08-27 09:48:15,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 09:48:15,556 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;@5d36c4b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 09:48:15,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-27 09:48:15,558 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 09:48:15,558 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-27 09:48:15,559 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:48:15,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:48:15,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 09:48:15,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-27 09:48:15,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:48:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1575100904, now seen corresponding path program 1 times [2023-08-27 09:48:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:48:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633676507] [2023-08-27 09:48:15,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:48:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:48:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:48:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:48:15,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:48:15,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633676507] [2023-08-27 09:48:15,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633676507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:48:15,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:48:15,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:48:15,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488608739] [2023-08-27 09:48:15,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:48:15,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-27 09:48:15,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:48:15,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-27 09:48:15,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-27 09:48:15,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 306 [2023-08-27 09:48:15,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:15,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:48:15,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 306 [2023-08-27 09:48:15,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:48:16,358 INFO L124 PetriNetUnfolderBase]: 1065/1643 cut-off events. [2023-08-27 09:48:16,359 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-08-27 09:48:16,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1643 events. 1065/1643 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8577 event pairs, 735 based on Foata normal form. 0/1153 useless extension candidates. Maximal degree in co-relation 770. Up to 1612 conditions per place. [2023-08-27 09:48:16,367 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 44 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-27 09:48:16,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 194 flow [2023-08-27 09:48:16,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-27 09:48:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-27 09:48:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2023-08-27 09:48:16,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2023-08-27 09:48:16,369 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2023-08-27 09:48:16,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2023-08-27 09:48:16,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:48:16,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2023-08-27 09:48:16,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:16,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:16,372 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:16,372 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 116 flow. Second operand 2 states and 337 transitions. [2023-08-27 09:48:16,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 194 flow [2023-08-27 09:48:16,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-27 09:48:16,375 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 104 flow [2023-08-27 09:48:16,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2023-08-27 09:48:16,377 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-08-27 09:48:16,377 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 104 flow [2023-08-27 09:48:16,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:16,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:48:16,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:48:16,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 09:48:16,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-27 09:48:16,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:48:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1847994260, now seen corresponding path program 1 times [2023-08-27 09:48:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:48:16,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807237805] [2023-08-27 09:48:16,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:48:16,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:48:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:48:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:48:18,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:48:18,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807237805] [2023-08-27 09:48:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807237805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:48:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:48:18,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 09:48:18,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714298767] [2023-08-27 09:48:18,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:48:18,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 09:48:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:48:18,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 09:48:18,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-27 09:48:18,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 306 [2023-08-27 09:48:18,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:18,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:48:18,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 306 [2023-08-27 09:48:18,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:48:32,462 INFO L124 PetriNetUnfolderBase]: 2490/3845 cut-off events. [2023-08-27 09:48:32,462 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-08-27 09:48:32,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7784 conditions, 3845 events. 2490/3845 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 23636 event pairs, 275 based on Foata normal form. 0/2797 useless extension candidates. Maximal degree in co-relation 7779. Up to 1880 conditions per place. [2023-08-27 09:48:32,482 INFO L140 encePairwiseOnDemand]: 286/306 looper letters, 227 selfloop transitions, 62 changer transitions 20/312 dead transitions. [2023-08-27 09:48:32,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 312 transitions, 1307 flow [2023-08-27 09:48:32,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-27 09:48:32,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-27 09:48:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1699 transitions. [2023-08-27 09:48:32,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39659197012138186 [2023-08-27 09:48:32,489 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1699 transitions. [2023-08-27 09:48:32,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1699 transitions. [2023-08-27 09:48:32,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:48:32,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1699 transitions. [2023-08-27 09:48:32,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 121.35714285714286) internal successors, (1699), 14 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:32,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:32,500 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:32,501 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 104 flow. Second operand 14 states and 1699 transitions. [2023-08-27 09:48:32,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 312 transitions, 1307 flow [2023-08-27 09:48:32,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 312 transitions, 1307 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 09:48:32,505 INFO L231 Difference]: Finished difference. Result has 67 places, 114 transitions, 545 flow [2023-08-27 09:48:32,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=545, PETRI_PLACES=67, PETRI_TRANSITIONS=114} [2023-08-27 09:48:32,506 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-08-27 09:48:32,506 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 114 transitions, 545 flow [2023-08-27 09:48:32,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:32,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:48:32,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:48:32,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 09:48:32,507 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONASSERT === [thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-27 09:48:32,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:48:32,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1845772245, now seen corresponding path program 1 times [2023-08-27 09:48:32,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:48:32,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39336740] [2023-08-27 09:48:32,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:48:32,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:48:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:48:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:48:34,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:48:34,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39336740] [2023-08-27 09:48:34,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39336740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:48:34,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:48:34,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 09:48:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365749490] [2023-08-27 09:48:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:48:34,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 09:48:34,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:48:34,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 09:48:34,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-27 09:48:34,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 306 [2023-08-27 09:48:34,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 114 transitions, 545 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:34,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:48:34,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 306 [2023-08-27 09:48:34,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:48:44,268 INFO L124 PetriNetUnfolderBase]: 3633/5617 cut-off events. [2023-08-27 09:48:44,268 INFO L125 PetriNetUnfolderBase]: For 6767/6797 co-relation queries the response was YES. [2023-08-27 09:48:44,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17268 conditions, 5617 events. 3633/5617 cut-off events. For 6767/6797 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 36391 event pairs, 512 based on Foata normal form. 20/4686 useless extension candidates. Maximal degree in co-relation 17251. Up to 3272 conditions per place. [2023-08-27 09:48:44,319 INFO L140 encePairwiseOnDemand]: 288/306 looper letters, 215 selfloop transitions, 87 changer transitions 25/330 dead transitions. [2023-08-27 09:48:44,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 330 transitions, 2102 flow [2023-08-27 09:48:44,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-27 09:48:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-27 09:48:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1617 transitions. [2023-08-27 09:48:44,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37745098039215685 [2023-08-27 09:48:44,325 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1617 transitions. [2023-08-27 09:48:44,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1617 transitions. [2023-08-27 09:48:44,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:48:44,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1617 transitions. [2023-08-27 09:48:44,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.5) internal successors, (1617), 14 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:44,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:44,336 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:44,336 INFO L175 Difference]: Start difference. First operand has 67 places, 114 transitions, 545 flow. Second operand 14 states and 1617 transitions. [2023-08-27 09:48:44,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 330 transitions, 2102 flow [2023-08-27 09:48:44,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 330 transitions, 2102 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 09:48:44,390 INFO L231 Difference]: Finished difference. Result has 91 places, 183 transitions, 1237 flow [2023-08-27 09:48:44,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1237, PETRI_PLACES=91, PETRI_TRANSITIONS=183} [2023-08-27 09:48:44,393 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2023-08-27 09:48:44,393 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 183 transitions, 1237 flow [2023-08-27 09:48:44,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:44,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:48:44,393 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:48:44,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 09:48:44,394 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONASSERT === [thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-27 09:48:44,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:48:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash 503249321, now seen corresponding path program 1 times [2023-08-27 09:48:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:48:44,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925711458] [2023-08-27 09:48:44,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:48:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:48:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:48:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:48:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:48:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925711458] [2023-08-27 09:48:46,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925711458] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:48:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659730077] [2023-08-27 09:48:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:48:46,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:48:46,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:48:46,505 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) [2023-08-27 09:48:46,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-27 09:48:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:48:46,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 50 conjunts are in the unsatisfiable core [2023-08-27 09:48:46,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:48:47,078 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-27 09:48:47,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-27 09:48:47,568 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-27 09:48:48,232 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-27 09:48:48,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 09:48:49,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-27 09:48:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:48:49,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:48:55,558 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_346 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_344))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (not (= (mod (select (select (store (store (store .cse0 |c_~#dec_flag~0.base| v_ArrVal_346) |c_~#value~0.base| v_ArrVal_348) |c_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base| v_ArrVal_347) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0))))) is different from false [2023-08-27 09:48:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 09:48:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659730077] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:48:56,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:48:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 16 [2023-08-27 09:48:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704685720] [2023-08-27 09:48:56,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:48:56,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-27 09:48:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:48:56,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-27 09:48:56,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=187, Unknown=6, NotChecked=28, Total=272 [2023-08-27 09:48:56,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 306 [2023-08-27 09:48:56,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 183 transitions, 1237 flow. Second operand has 17 states, 17 states have (on average 96.58823529411765) internal successors, (1642), 17 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:48:56,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:48:56,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 306 [2023-08-27 09:48:56,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:49:05,112 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (and (or (= (mod .cse0 4294967296) 0) (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (v_ArrVal_346 (Array Int Int))) (not (= (mod (select (select (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_ArrVal_346) |c_~#value~0.base| v_ArrVal_348) |c_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base| v_ArrVal_347) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)))) (or (= 0 .cse0) (not (= |c_~#value~0.base| |c_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base|))) (forall ((|v_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base_57| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base_57|) 0)) (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_346 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_344))) (or (not (= 0 (mod (select (select (store (store (store .cse1 |c_~#dec_flag~0.base| v_ArrVal_346) |c_~#value~0.base| v_ArrVal_348) |v_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base_57| v_ArrVal_347) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296))) (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0)))))) (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base_57| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_346 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_344))) (or (not (= 0 (mod (select (select (store (store (store .cse2 |c_~#dec_flag~0.base| v_ArrVal_346) |c_~#value~0.base| v_ArrVal_348) |v_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base_57| v_ArrVal_347) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296))) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base_57|) 0)) (= (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0)))))) is different from false [2023-08-27 09:49:44,237 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (let ((.cse1 (not .cse2)) (.cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (and (or (= (mod .cse0 4294967296) 0) (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (v_ArrVal_346 (Array Int Int))) (not (= (mod (select (select (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_ArrVal_346) |c_~#value~0.base| v_ArrVal_348) |c_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base| v_ArrVal_347) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)))) (or .cse1 (not (= |c_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (or .cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1)) (or .cse2 (= 0 .cse0))))) is different from false [2023-08-27 09:49:47,413 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (v_ArrVal_346 (Array Int Int))) (not (= (mod (select (select (store (store (store |c_#memory_int| |c_~#dec_flag~0.base| v_ArrVal_346) |c_~#value~0.base| v_ArrVal_348) |c_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base| v_ArrVal_347) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)))) (.cse0 (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (and (or (= .cse0 0) .cse1) (or .cse1 (not (= (mod |c_thr1Thread1of2ForFork0_dec_~dec__v~0#1| 4294967296) .cse0))) (forall ((v_ArrVal_345 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_dec_~#dec__casret~0#1.base| v_ArrVal_345) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0))))) is different from false [2023-08-27 09:49:57,964 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] [2023-08-27 09:50:07,184 INFO L124 PetriNetUnfolderBase]: 4182/6847 cut-off events. [2023-08-27 09:50:07,184 INFO L125 PetriNetUnfolderBase]: For 24386/24454 co-relation queries the response was YES. [2023-08-27 09:50:07,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25970 conditions, 6847 events. 4182/6847 cut-off events. For 24386/24454 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 48018 event pairs, 279 based on Foata normal form. 177/6323 useless extension candidates. Maximal degree in co-relation 25941. Up to 3298 conditions per place. [2023-08-27 09:50:07,243 INFO L140 encePairwiseOnDemand]: 274/306 looper letters, 292 selfloop transitions, 195 changer transitions 120/610 dead transitions. [2023-08-27 09:50:07,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 610 transitions, 4682 flow [2023-08-27 09:50:07,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-27 09:50:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-27 09:50:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 5607 transitions. [2023-08-27 09:50:07,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393246187363834 [2023-08-27 09:50:07,258 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 5607 transitions. [2023-08-27 09:50:07,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 5607 transitions. [2023-08-27 09:50:07,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:50:07,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 5607 transitions. [2023-08-27 09:50:07,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 103.83333333333333) internal successors, (5607), 54 states have internal predecessors, (5607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:50:07,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 306.0) internal successors, (16830), 55 states have internal predecessors, (16830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:50:07,299 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 306.0) internal successors, (16830), 55 states have internal predecessors, (16830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:50:07,300 INFO L175 Difference]: Start difference. First operand has 91 places, 183 transitions, 1237 flow. Second operand 54 states and 5607 transitions. [2023-08-27 09:50:07,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 610 transitions, 4682 flow [2023-08-27 09:50:07,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 610 transitions, 4249 flow, removed 215 selfloop flow, removed 6 redundant places. [2023-08-27 09:50:07,409 INFO L231 Difference]: Finished difference. Result has 156 places, 297 transitions, 2514 flow [2023-08-27 09:50:07,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=2514, PETRI_PLACES=156, PETRI_TRANSITIONS=297} [2023-08-27 09:50:07,410 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places. [2023-08-27 09:50:07,410 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 297 transitions, 2514 flow [2023-08-27 09:50:07,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 96.58823529411765) internal successors, (1642), 17 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:50:07,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:50:07,411 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:50:07,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-27 09:50:07,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:50:07,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT, thr1Err1ASSERT_VIOLATIONASSERT, thr1Err0ASSERT_VIOLATIONASSERT (and 2 more)] === [2023-08-27 09:50:07,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:50:07,616 INFO L85 PathProgramCache]: Analyzing trace with hash 703651998, now seen corresponding path program 1 times [2023-08-27 09:50:07,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:50:07,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581634600] [2023-08-27 09:50:07,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:50:07,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:50:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:50:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:50:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:50:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581634600] [2023-08-27 09:50:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581634600] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:50:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344557974] [2023-08-27 09:50:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:50:11,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:50:11,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:50:11,586 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) [2023-08-27 09:50:11,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-27 09:50:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:50:11,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-27 09:50:11,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:50:12,168 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-27 09:50:12,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-27 09:50:12,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-27 09:50:13,450 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-27 09:50:13,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 09:50:14,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:50:15,303 INFO L322 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-08-27 09:50:15,303 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 120 [2023-08-27 09:50:15,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-27 09:50:15,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-27 09:50:15,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-27 09:50:15,638 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:50:15,639 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2023-08-27 09:50:16,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 21 [2023-08-27 09:50:19,872 INFO L322 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-08-27 09:50:19,872 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 131 [2023-08-27 09:50:20,725 INFO L351 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 47 treesize of output 45 [2023-08-27 09:50:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:50:21,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:50:23,064 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse0 (= .cse2 (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (and (or (not .cse0) (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_399) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_401) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_406) |c_~#value~0.base| v_ArrVal_400) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_408))) (or (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or .cse0 (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_408))) (or (= (mod (select v_ArrVal_405 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (< .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))))))) is different from false [2023-08-27 09:50:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:50:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344557974] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:50:26,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:50:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2023-08-27 09:50:26,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751199165] [2023-08-27 09:50:26,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:50:26,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 09:50:26,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:50:26,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 09:50:26,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=342, Unknown=12, NotChecked=38, Total=462 [2023-08-27 09:50:26,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 306 [2023-08-27 09:50:26,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 297 transitions, 2514 flow. Second operand has 22 states, 22 states have (on average 96.22727272727273) internal successors, (2117), 22 states have internal predecessors, (2117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:50:26,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:50:26,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 306 [2023-08-27 09:50:26,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:50:38,323 WARN L234 SmtUtils]: Spent 7.86s on a formula simplification. DAG size of input: 147 DAG size of output: 130 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:50:55,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:51:05,424 WARN L234 SmtUtils]: Spent 7.38s on a formula simplification. DAG size of input: 116 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:51:07,432 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] [2023-08-27 09:52:06,751 WARN L234 SmtUtils]: Spent 53.55s on a formula simplification. DAG size of input: 121 DAG size of output: 86 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:52:09,271 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] [2023-08-27 09:52:11,275 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] [2023-08-27 09:52:13,552 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 [1] [2023-08-27 09:52:15,570 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] [2023-08-27 09:52:17,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:52:19,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:52:21,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:53:09,325 WARN L234 SmtUtils]: Spent 45.32s on a formula simplification. DAG size of input: 96 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:53:11,330 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] [2023-08-27 09:53:21,996 WARN L234 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:53:25,971 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] [2023-08-27 09:53:27,985 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 [1] [2023-08-27 09:53:30,055 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] [2023-08-27 09:53:32,068 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 [1] [2023-08-27 09:53:33,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:53:36,036 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] [2023-08-27 09:53:38,106 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] [2023-08-27 09:54:25,024 WARN L234 SmtUtils]: Spent 42.97s on a formula simplification. DAG size of input: 59 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:54:27,491 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] [2023-08-27 09:54:29,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:54:32,095 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] [2023-08-27 09:54:34,182 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 [1] [2023-08-27 09:54:36,211 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] [2023-08-27 09:54:38,220 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 [1] [2023-08-27 09:54:50,447 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 [1] [2023-08-27 09:54:52,458 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 [1] [2023-08-27 09:54:52,491 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse4 (mod .cse6 4294967296))) (let ((.cse0 (= .cse2 .cse4))) (and (or (not .cse0) (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_399) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_401) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_406) |c_~#value~0.base| v_ArrVal_400) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_408))) (or (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or .cse0 (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_408))) (or (= (mod (select v_ArrVal_405 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (< .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_399) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_401) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse6))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_406) |c_~#value~0.base| v_ArrVal_400) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_408))) (or (< .cse4 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse5 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))))))) is different from false [2023-08-27 09:54:54,744 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] [2023-08-27 09:54:56,766 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] [2023-08-27 09:54:59,035 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] [2023-08-27 09:55:01,045 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 [1] [2023-08-27 09:55:03,053 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 [1] [2023-08-27 09:55:05,440 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] [2023-08-27 09:55:07,504 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] Received shutdown request... [2023-08-27 09:55:13,743 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 09:55:13,743 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 [2023-08-27 09:55:14,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-27 09:55:14,945 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 [2023-08-27 09:55:15,024 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 [2023-08-27 09:55:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-27 09:55:15,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 09:55:15,026 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:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) 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.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.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) 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:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-08-27 09:55:15,029 INFO L158 Benchmark]: Toolchain (without parser) took 848661.83ms. Allocated memory was 354.4MB in the beginning and 809.5MB in the end (delta: 455.1MB). Free memory was 329.6MB in the beginning and 405.4MB in the end (delta: -75.7MB). Peak memory consumption was 381.2MB. Max. memory is 16.0GB. [2023-08-27 09:55:15,029 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 354.4MB. Free memory is still 331.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 09:55:15,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.84ms. Allocated memory is still 354.4MB. Free memory was 329.6MB in the beginning and 309.3MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-27 09:55:15,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.37ms. Allocated memory is still 354.4MB. Free memory was 309.3MB in the beginning and 306.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 09:55:15,029 INFO L158 Benchmark]: Boogie Preprocessor took 24.36ms. Allocated memory is still 354.4MB. Free memory was 306.6MB in the beginning and 305.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 09:55:15,030 INFO L158 Benchmark]: RCFGBuilder took 795.01ms. Allocated memory is still 354.4MB. Free memory was 305.1MB in the beginning and 318.6MB in the end (delta: -13.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-27 09:55:15,030 INFO L158 Benchmark]: TraceAbstraction took 847298.55ms. Allocated memory was 354.4MB in the beginning and 809.5MB in the end (delta: 455.1MB). Free memory was 317.7MB in the beginning and 405.4MB in the end (delta: -87.7MB). Peak memory consumption was 368.6MB. Max. memory is 16.0GB. [2023-08-27 09:55:15,031 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 354.4MB. Free memory is still 331.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 480.84ms. Allocated memory is still 354.4MB. Free memory was 329.6MB in the beginning and 309.3MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.37ms. Allocated memory is still 354.4MB. Free memory was 309.3MB in the beginning and 306.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.36ms. Allocated memory is still 354.4MB. Free memory was 306.6MB in the beginning and 305.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 795.01ms. Allocated memory is still 354.4MB. Free memory was 305.1MB in the beginning and 318.6MB in the end (delta: -13.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 847298.55ms. Allocated memory was 354.4MB in the beginning and 809.5MB in the end (delta: 455.1MB). Free memory was 317.7MB in the beginning and 405.4MB in the end (delta: -87.7MB). Peak memory consumption was 368.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] - GenericResultAtLocation [Line: 686]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [686] - GenericResultAtLocation [Line: 687]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [687] - GenericResultAtLocation [Line: 688]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [688] - GenericResultAtLocation [Line: 689]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [689] - GenericResultAtLocation [Line: 690]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [690] - GenericResultAtLocation [Line: 701]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [701] - GenericResultAtLocation [Line: 702]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [702] - GenericResultAtLocation [Line: 703]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [703] - GenericResultAtLocation [Line: 704]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [704] - GenericResultAtLocation [Line: 708]: Unsoundness Warning unspecified type, defaulting to int C: inline unsigned [708] - GenericResultAtLocation [Line: 709]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [709] - GenericResultAtLocation [Line: 722]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [722] - GenericResultAtLocation [Line: 726]: Unsoundness Warning unspecified type, defaulting to int C: inline unsigned [726] - GenericResultAtLocation [Line: 727]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [727] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 93 PlacesBefore, 23 PlacesAfterwards, 98 TransitionsBefore, 27 TransitionsAfterwards, 1690 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 2226 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1663, independent: 1551, independent conditional: 0, independent unconditional: 1551, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 935, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1663, independent: 661, independent conditional: 0, independent unconditional: 661, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 935, unknown conditional: 0, unknown unconditional: 935] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.5s, 93 PlacesBefore, 23 PlacesAfterwards, 98 TransitionsBefore, 27 TransitionsAfterwards, 1690 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 2365 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1650, independent: 1516, independent conditional: 0, independent unconditional: 1516, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 918, independent: 875, independent conditional: 0, independent unconditional: 875, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1650, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 918, unknown conditional: 0, unknown unconditional: 918] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 67.2s, 154 PlacesBefore, 43 PlacesAfterwards, 164 TransitionsBefore, 52 TransitionsAfterwards, 11960 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 19188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10765, independent: 10496, independent conditional: 0, independent unconditional: 10496, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6523, independent: 6427, independent conditional: 0, independent unconditional: 6427, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10765, independent: 4069, independent conditional: 0, independent unconditional: 4069, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 6523, unknown conditional: 0, unknown unconditional: 6523] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 263, Positive conditional cache size: 0, Positive unconditional cache size: 263, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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