/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.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 17:28:12,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 17:28:13,030 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-26 17:28:13,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 17:28:13,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 17:28:13,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 17:28:13,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 17:28:13,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 17:28:13,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 17:28:13,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 17:28:13,060 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 17:28:13,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 17:28:13,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 17:28:13,061 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 17:28:13,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 17:28:13,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 17:28:13,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 17:28:13,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 17:28:13,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 17:28:13,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 17:28:13,062 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 17:28:13,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 17:28:13,063 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 17:28:13,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 17:28:13,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 17:28:13,064 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 17:28:13,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 17:28:13,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 17:28:13,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 17:28:13,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 17:28:13,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 17:28:13,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 17:28:13,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 17:28:13,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 17:28:13,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 17:28:13,066 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: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 17:28:13,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 17:28:13,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 17:28:13,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 17:28:13,309 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 17:28:13,309 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 17:28:13,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-08-26 17:28:14,224 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 17:28:14,427 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 17:28:14,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-08-26 17:28:14,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57cb57cd1/a99e3d08a1ee4265bb743e0fb7f5e78e/FLAG22856bf7a [2023-08-26 17:28:14,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57cb57cd1/a99e3d08a1ee4265bb743e0fb7f5e78e [2023-08-26 17:28:14,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 17:28:14,453 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 17:28:14,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 17:28:14,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 17:28:14,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 17:28:14,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3332139b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14, skipping insertion in model container [2023-08-26 17:28:14,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,489 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 17:28:14,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 17:28:14,803 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 17:28:14,815 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 17:28:14,816 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 17:28:14,821 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-26 17:28:14,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 17:28:14,875 INFO L206 MainTranslator]: Completed translation [2023-08-26 17:28:14,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14 WrapperNode [2023-08-26 17:28:14,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 17:28:14,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 17:28:14,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 17:28:14,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 17:28:14,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,933 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 209 [2023-08-26 17:28:14,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 17:28:14,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 17:28:14,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 17:28:14,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 17:28:14,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 17:28:14,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 17:28:14,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 17:28:14,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 17:28:14,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (1/1) ... [2023-08-26 17:28:14,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 17:28:14,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:28:15,000 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-26 17:28:15,005 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-26 17:28:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-26 17:28:15,040 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-26 17:28:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-26 17:28:15,040 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-26 17:28:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 17:28:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 17:28:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 17:28:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 17:28:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 17:28:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 17:28:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 17:28:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 17:28:15,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 17:28:15,042 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 17:28:15,143 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 17:28:15,144 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 17:28:15,524 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 17:28:15,530 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 17:28:15,531 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 17:28:15,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:28:15 BoogieIcfgContainer [2023-08-26 17:28:15,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 17:28:15,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 17:28:15,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 17:28:15,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 17:28:15,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 05:28:14" (1/3) ... [2023-08-26 17:28:15,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b13529e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:28:15, skipping insertion in model container [2023-08-26 17:28:15,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:28:14" (2/3) ... [2023-08-26 17:28:15,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b13529e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:28:15, skipping insertion in model container [2023-08-26 17:28:15,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:28:15" (3/3) ... [2023-08-26 17:28:15,537 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-08-26 17:28:15,548 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 17:28:15,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-08-26 17:28:15,548 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 17:28:15,621 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 17:28:15,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 274 places, 282 transitions, 580 flow [2023-08-26 17:28:15,728 INFO L124 PetriNetUnfolderBase]: 15/280 cut-off events. [2023-08-26 17:28:15,728 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 17:28:15,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 280 events. 15/280 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 677 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 189. Up to 3 conditions per place. [2023-08-26 17:28:15,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 282 transitions, 580 flow [2023-08-26 17:28:15,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 271 transitions, 551 flow [2023-08-26 17:28:15,753 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 17:28:15,762 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 271 transitions, 551 flow [2023-08-26 17:28:15,764 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 271 transitions, 551 flow [2023-08-26 17:28:15,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 271 transitions, 551 flow [2023-08-26 17:28:15,812 INFO L124 PetriNetUnfolderBase]: 15/271 cut-off events. [2023-08-26 17:28:15,812 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 17:28:15,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 271 events. 15/271 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 605 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 189. Up to 3 conditions per place. [2023-08-26 17:28:15,819 INFO L119 LiptonReduction]: Number of co-enabled transitions 18460 [2023-08-26 17:28:26,972 INFO L134 LiptonReduction]: Checked pairs total: 58098 [2023-08-26 17:28:26,973 INFO L136 LiptonReduction]: Total number of compositions: 364 [2023-08-26 17:28:26,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 17:28:26,994 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;@2d8ed23f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 17:28:26,994 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2023-08-26 17:28:26,996 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 17:28:26,996 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 17:28:26,996 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:28:26,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:26,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 17:28:26,997 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:26,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1197, now seen corresponding path program 1 times [2023-08-26 17:28:27,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:27,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692363582] [2023-08-26 17:28:27,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:27,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:27,071 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-26 17:28:27,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:27,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692363582] [2023-08-26 17:28:27,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692363582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:27,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 17:28:27,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508105855] [2023-08-26 17:28:27,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:27,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 17:28:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 17:28:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 17:28:27,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 646 [2023-08-26 17:28:27,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 217 flow. Second operand has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 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-26 17:28:27,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:27,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 646 [2023-08-26 17:28:27,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:27,541 INFO L124 PetriNetUnfolderBase]: 4013/6423 cut-off events. [2023-08-26 17:28:27,542 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-08-26 17:28:27,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12628 conditions, 6423 events. 4013/6423 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 37134 event pairs, 3493 based on Foata normal form. 0/3205 useless extension candidates. Maximal degree in co-relation 12169. Up to 6135 conditions per place. [2023-08-26 17:28:27,574 INFO L140 encePairwiseOnDemand]: 610/646 looper letters, 61 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2023-08-26 17:28:27,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 267 flow [2023-08-26 17:28:27,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 17:28:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 17:28:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 635 transitions. [2023-08-26 17:28:27,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4914860681114551 [2023-08-26 17:28:27,588 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 635 transitions. [2023-08-26 17:28:27,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 635 transitions. [2023-08-26 17:28:27,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:27,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 635 transitions. [2023-08-26 17:28:27,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 317.5) internal successors, (635), 2 states have internal predecessors, (635), 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-26 17:28:27,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 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-26 17:28:27,602 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 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-26 17:28:27,603 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 217 flow. Second operand 2 states and 635 transitions. [2023-08-26 17:28:27,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 267 flow [2023-08-26 17:28:27,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 17:28:27,608 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 140 flow [2023-08-26 17:28:27,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2023-08-26 17:28:27,613 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2023-08-26 17:28:27,613 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 140 flow [2023-08-26 17:28:27,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 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-26 17:28:27,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:27,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 17:28:27,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 17:28:27,614 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:27,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:27,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1181127, now seen corresponding path program 1 times [2023-08-26 17:28:27,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:27,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278411585] [2023-08-26 17:28:27,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:27,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:27,859 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-26 17:28:27,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:27,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278411585] [2023-08-26 17:28:27,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278411585] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:27,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:28:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36111197] [2023-08-26 17:28:27,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:27,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:28:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:27,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:28:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:28:27,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 646 [2023-08-26 17:28:27,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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-26 17:28:27,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:27,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 646 [2023-08-26 17:28:27,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:28,260 INFO L124 PetriNetUnfolderBase]: 4304/6761 cut-off events. [2023-08-26 17:28:28,260 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 17:28:28,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13378 conditions, 6761 events. 4304/6761 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 37987 event pairs, 3770 based on Foata normal form. 0/3322 useless extension candidates. Maximal degree in co-relation 13375. Up to 6571 conditions per place. [2023-08-26 17:28:28,288 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 60 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-08-26 17:28:28,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 258 flow [2023-08-26 17:28:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:28:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:28:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2023-08-26 17:28:28,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34055727554179566 [2023-08-26 17:28:28,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 660 transitions. [2023-08-26 17:28:28,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 660 transitions. [2023-08-26 17:28:28,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:28,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 660 transitions. [2023-08-26 17:28:28,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-26 17:28:28,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:28,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:28,297 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 140 flow. Second operand 3 states and 660 transitions. [2023-08-26 17:28:28,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 258 flow [2023-08-26 17:28:28,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 17:28:28,299 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 138 flow [2023-08-26 17:28:28,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2023-08-26 17:28:28,300 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2023-08-26 17:28:28,302 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 138 flow [2023-08-26 17:28:28,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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-26 17:28:28,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:28,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 17:28:28,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 17:28:28,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:28,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:28,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1181128, now seen corresponding path program 1 times [2023-08-26 17:28:28,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:28,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829956176] [2023-08-26 17:28:28,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:28,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:28,365 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-26 17:28:28,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:28,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829956176] [2023-08-26 17:28:28,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829956176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:28,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:28,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:28:28,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12841076] [2023-08-26 17:28:28,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:28,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:28:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:28,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:28:28,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:28:28,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 17:28:28,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 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-26 17:28:28,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:28,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 17:28:28,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:28,767 INFO L124 PetriNetUnfolderBase]: 4253/6661 cut-off events. [2023-08-26 17:28:28,767 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 17:28:28,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13183 conditions, 6661 events. 4253/6661 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 37227 event pairs, 3725 based on Foata normal form. 0/3293 useless extension candidates. Maximal degree in co-relation 13179. Up to 6474 conditions per place. [2023-08-26 17:28:28,786 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 58 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-08-26 17:28:28,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 252 flow [2023-08-26 17:28:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:28:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:28:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2023-08-26 17:28:28,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3364293085655315 [2023-08-26 17:28:28,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 652 transitions. [2023-08-26 17:28:28,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 652 transitions. [2023-08-26 17:28:28,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:28,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 652 transitions. [2023-08-26 17:28:28,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-26 17:28:28,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:28,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:28,793 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 138 flow. Second operand 3 states and 652 transitions. [2023-08-26 17:28:28,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 252 flow [2023-08-26 17:28:28,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:28,794 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 135 flow [2023-08-26 17:28:28,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2023-08-26 17:28:28,795 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 17:28:28,795 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 135 flow [2023-08-26 17:28:28,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 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-26 17:28:28,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:28,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 17:28:28,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 17:28:28,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:28,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1135090846, now seen corresponding path program 1 times [2023-08-26 17:28:28,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:28,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768766169] [2023-08-26 17:28:28,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:28,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:28,860 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-26 17:28:28,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:28,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768766169] [2023-08-26 17:28:28,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768766169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:28,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:28,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:28:28,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521146742] [2023-08-26 17:28:28,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:28,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:28:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:28,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:28:28,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:28:28,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 646 [2023-08-26 17:28:28,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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-26 17:28:28,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:28,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 646 [2023-08-26 17:28:28,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:29,139 INFO L124 PetriNetUnfolderBase]: 3079/4910 cut-off events. [2023-08-26 17:28:29,139 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 17:28:29,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9727 conditions, 4910 events. 3079/4910 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 26660 event pairs, 2680 based on Foata normal form. 0/2645 useless extension candidates. Maximal degree in co-relation 9723. Up to 4768 conditions per place. [2023-08-26 17:28:29,153 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 57 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2023-08-26 17:28:29,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 249 flow [2023-08-26 17:28:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:28:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:28:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2023-08-26 17:28:29,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3384932920536636 [2023-08-26 17:28:29,155 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 656 transitions. [2023-08-26 17:28:29,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 656 transitions. [2023-08-26 17:28:29,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:29,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 656 transitions. [2023-08-26 17:28:29,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 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-26 17:28:29,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:29,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:29,160 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 135 flow. Second operand 3 states and 656 transitions. [2023-08-26 17:28:29,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 249 flow [2023-08-26 17:28:29,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:29,162 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 134 flow [2023-08-26 17:28:29,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-08-26 17:28:29,164 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 17:28:29,164 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 134 flow [2023-08-26 17:28:29,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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-26 17:28:29,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:29,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 17:28:29,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 17:28:29,164 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:29,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1135090845, now seen corresponding path program 1 times [2023-08-26 17:28:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:29,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162588140] [2023-08-26 17:28:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:29,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:29,246 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-26 17:28:29,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:29,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162588140] [2023-08-26 17:28:29,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162588140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:29,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:29,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:28:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628722657] [2023-08-26 17:28:29,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:29,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 17:28:29,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:29,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 17:28:29,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 17:28:29,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 17:28:29,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 195.25) internal successors, (781), 4 states have internal predecessors, (781), 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-26 17:28:29,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:29,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 17:28:29,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:29,442 INFO L124 PetriNetUnfolderBase]: 1905/3159 cut-off events. [2023-08-26 17:28:29,443 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 17:28:29,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6271 conditions, 3159 events. 1905/3159 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 16660 event pairs, 1635 based on Foata normal form. 0/1997 useless extension candidates. Maximal degree in co-relation 6267. Up to 3062 conditions per place. [2023-08-26 17:28:29,455 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 56 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-08-26 17:28:29,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 246 flow [2023-08-26 17:28:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:28:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:28:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2023-08-26 17:28:29,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3302373581011352 [2023-08-26 17:28:29,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2023-08-26 17:28:29,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2023-08-26 17:28:29,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:29,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2023-08-26 17:28:29,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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-26 17:28:29,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:29,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:29,461 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 134 flow. Second operand 3 states and 640 transitions. [2023-08-26 17:28:29,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 246 flow [2023-08-26 17:28:29,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:29,463 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 133 flow [2023-08-26 17:28:29,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2023-08-26 17:28:29,465 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 17:28:29,465 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 133 flow [2023-08-26 17:28:29,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.25) internal successors, (781), 4 states have internal predecessors, (781), 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-26 17:28:29,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:29,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 17:28:29,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 17:28:29,466 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:29,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062955, now seen corresponding path program 1 times [2023-08-26 17:28:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:29,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474211910] [2023-08-26 17:28:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:29,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:29,604 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-26 17:28:29,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:29,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474211910] [2023-08-26 17:28:29,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474211910] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:29,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:28:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937555559] [2023-08-26 17:28:29,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:29,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:28:29,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:29,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:28:29,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:28:29,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 17:28:29,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 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-26 17:28:29,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:29,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 17:28:29,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:29,804 INFO L124 PetriNetUnfolderBase]: 1691/2803 cut-off events. [2023-08-26 17:28:29,805 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-26 17:28:29,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5564 conditions, 2803 events. 1691/2803 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 14367 event pairs, 1437 based on Foata normal form. 0/1843 useless extension candidates. Maximal degree in co-relation 5560. Up to 2712 conditions per place. [2023-08-26 17:28:29,813 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 53 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2023-08-26 17:28:29,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 235 flow [2023-08-26 17:28:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:28:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:28:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2023-08-26 17:28:29,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32972136222910214 [2023-08-26 17:28:29,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 639 transitions. [2023-08-26 17:28:29,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 639 transitions. [2023-08-26 17:28:29,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:29,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 639 transitions. [2023-08-26 17:28:29,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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-26 17:28:29,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:29,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:29,820 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 133 flow. Second operand 3 states and 639 transitions. [2023-08-26 17:28:29,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 235 flow [2023-08-26 17:28:29,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:29,822 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 128 flow [2023-08-26 17:28:29,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-08-26 17:28:29,824 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -41 predicate places. [2023-08-26 17:28:29,824 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 128 flow [2023-08-26 17:28:29,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 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-26 17:28:29,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:29,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 17:28:29,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 17:28:29,825 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:29,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:29,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062954, now seen corresponding path program 1 times [2023-08-26 17:28:29,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:29,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510501931] [2023-08-26 17:28:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:29,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:29,933 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-26 17:28:29,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:29,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510501931] [2023-08-26 17:28:29,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510501931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:29,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:29,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:28:29,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9375741] [2023-08-26 17:28:29,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:29,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:28:29,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:29,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:28:29,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:28:29,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 17:28:29,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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-26 17:28:29,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:29,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 17:28:29,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:30,083 INFO L124 PetriNetUnfolderBase]: 1428/2366 cut-off events. [2023-08-26 17:28:30,084 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 17:28:30,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4695 conditions, 2366 events. 1428/2366 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 11577 event pairs, 1194 based on Foata normal form. 0/1648 useless extension candidates. Maximal degree in co-relation 4691. Up to 2281 conditions per place. [2023-08-26 17:28:30,091 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 49 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-08-26 17:28:30,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 220 flow [2023-08-26 17:28:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:28:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:28:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2023-08-26 17:28:30,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3328173374613003 [2023-08-26 17:28:30,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2023-08-26 17:28:30,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2023-08-26 17:28:30,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:30,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2023-08-26 17:28:30,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-26 17:28:30,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:30,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:30,096 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 128 flow. Second operand 3 states and 645 transitions. [2023-08-26 17:28:30,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 220 flow [2023-08-26 17:28:30,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:30,097 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 121 flow [2023-08-26 17:28:30,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2023-08-26 17:28:30,098 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -44 predicate places. [2023-08-26 17:28:30,098 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 121 flow [2023-08-26 17:28:30,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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-26 17:28:30,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:30,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 17:28:30,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 17:28:30,099 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:30,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062968, now seen corresponding path program 1 times [2023-08-26 17:28:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:30,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139353778] [2023-08-26 17:28:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:30,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:30,277 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-26 17:28:30,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:30,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139353778] [2023-08-26 17:28:30,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139353778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:30,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:30,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:28:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375415109] [2023-08-26 17:28:30,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:30,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:28:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:30,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:28:30,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:28:30,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 646 [2023-08-26 17:28:30,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 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-26 17:28:30,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:30,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 646 [2023-08-26 17:28:30,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:30,433 INFO L124 PetriNetUnfolderBase]: 1367/2307 cut-off events. [2023-08-26 17:28:30,433 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-26 17:28:30,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 2307 events. 1367/2307 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11560 event pairs, 919 based on Foata normal form. 0/1605 useless extension candidates. Maximal degree in co-relation 4541. Up to 2182 conditions per place. [2023-08-26 17:28:30,441 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 54 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-08-26 17:28:30,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 255 flow [2023-08-26 17:28:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:28:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:28:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2023-08-26 17:28:30,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37874097007223945 [2023-08-26 17:28:30,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 734 transitions. [2023-08-26 17:28:30,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 734 transitions. [2023-08-26 17:28:30,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:30,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 734 transitions. [2023-08-26 17:28:30,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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-26 17:28:30,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:30,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:30,446 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 121 flow. Second operand 3 states and 734 transitions. [2023-08-26 17:28:30,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 255 flow [2023-08-26 17:28:30,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:30,448 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 146 flow [2023-08-26 17:28:30,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2023-08-26 17:28:30,448 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -42 predicate places. [2023-08-26 17:28:30,448 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 146 flow [2023-08-26 17:28:30,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 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-26 17:28:30,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:30,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 17:28:30,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 17:28:30,449 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:30,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:30,449 INFO L85 PathProgramCache]: Analyzing trace with hash 827212352, now seen corresponding path program 1 times [2023-08-26 17:28:30,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:30,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272102792] [2023-08-26 17:28:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:30,760 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-26 17:28:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272102792] [2023-08-26 17:28:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272102792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:30,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:30,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:28:30,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801082591] [2023-08-26 17:28:30,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:30,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 17:28:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:30,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 17:28:30,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 17:28:30,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 646 [2023-08-26 17:28:30,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 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-26 17:28:30,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:30,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 646 [2023-08-26 17:28:30,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:30,999 INFO L124 PetriNetUnfolderBase]: 1758/2954 cut-off events. [2023-08-26 17:28:30,999 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2023-08-26 17:28:31,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6046 conditions, 2954 events. 1758/2954 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 15723 event pairs, 429 based on Foata normal form. 29/2149 useless extension candidates. Maximal degree in co-relation 6041. Up to 2264 conditions per place. [2023-08-26 17:28:31,008 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 74 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2023-08-26 17:28:31,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 367 flow [2023-08-26 17:28:31,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:28:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:28:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2023-08-26 17:28:31,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325593395252838 [2023-08-26 17:28:31,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 631 transitions. [2023-08-26 17:28:31,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 631 transitions. [2023-08-26 17:28:31,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:31,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 631 transitions. [2023-08-26 17:28:31,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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-26 17:28:31,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:31,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:31,014 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 146 flow. Second operand 3 states and 631 transitions. [2023-08-26 17:28:31,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 367 flow [2023-08-26 17:28:31,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 85 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:31,015 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 178 flow [2023-08-26 17:28:31,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2023-08-26 17:28:31,016 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2023-08-26 17:28:31,016 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 178 flow [2023-08-26 17:28:31,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 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-26 17:28:31,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:31,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 17:28:31,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 17:28:31,016 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:31,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 827214629, now seen corresponding path program 1 times [2023-08-26 17:28:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722567121] [2023-08-26 17:28:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:31,116 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-26 17:28:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722567121] [2023-08-26 17:28:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722567121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:31,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:28:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276155456] [2023-08-26 17:28:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:31,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 17:28:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 17:28:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 17:28:31,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 646 [2023-08-26 17:28:31,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 188.5) internal successors, (754), 4 states have internal predecessors, (754), 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-26 17:28:31,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:31,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 646 [2023-08-26 17:28:31,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:31,363 INFO L124 PetriNetUnfolderBase]: 1851/3141 cut-off events. [2023-08-26 17:28:31,364 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2023-08-26 17:28:31,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6615 conditions, 3141 events. 1851/3141 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 16983 event pairs, 741 based on Foata normal form. 0/2411 useless extension candidates. Maximal degree in co-relation 6609. Up to 1892 conditions per place. [2023-08-26 17:28:31,374 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 82 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2023-08-26 17:28:31,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 406 flow [2023-08-26 17:28:31,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 17:28:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 17:28:31,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 830 transitions. [2023-08-26 17:28:31,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32120743034055727 [2023-08-26 17:28:31,376 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 830 transitions. [2023-08-26 17:28:31,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 830 transitions. [2023-08-26 17:28:31,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:31,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 830 transitions. [2023-08-26 17:28:31,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 207.5) internal successors, (830), 4 states have internal predecessors, (830), 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-26 17:28:31,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 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-26 17:28:31,380 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 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-26 17:28:31,381 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 178 flow. Second operand 4 states and 830 transitions. [2023-08-26 17:28:31,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 406 flow [2023-08-26 17:28:31,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:31,383 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 173 flow [2023-08-26 17:28:31,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2023-08-26 17:28:31,383 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 17:28:31,383 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 173 flow [2023-08-26 17:28:31,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.5) internal successors, (754), 4 states have internal predecessors, (754), 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-26 17:28:31,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:31,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:28:31,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 17:28:31,384 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:31,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash -986612324, now seen corresponding path program 1 times [2023-08-26 17:28:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:31,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796658243] [2023-08-26 17:28:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:31,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:31,419 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-26 17:28:31,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:31,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796658243] [2023-08-26 17:28:31,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796658243] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:31,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:28:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133678583] [2023-08-26 17:28:31,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:31,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:28:31,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:31,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:28:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:28:31,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 646 [2023-08-26 17:28:31,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 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-26 17:28:31,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:31,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 646 [2023-08-26 17:28:31,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:31,526 INFO L124 PetriNetUnfolderBase]: 614/1214 cut-off events. [2023-08-26 17:28:31,526 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-08-26 17:28:31,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2536 conditions, 1214 events. 614/1214 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 6261 event pairs, 387 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 2529. Up to 627 conditions per place. [2023-08-26 17:28:31,529 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 51 selfloop transitions, 2 changer transitions 8/68 dead transitions. [2023-08-26 17:28:31,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 311 flow [2023-08-26 17:28:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:28:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:28:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2023-08-26 17:28:31,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43653250773993807 [2023-08-26 17:28:31,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 846 transitions. [2023-08-26 17:28:31,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 846 transitions. [2023-08-26 17:28:31,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:31,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 846 transitions. [2023-08-26 17:28:31,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-26 17:28:31,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:31,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:31,535 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 173 flow. Second operand 3 states and 846 transitions. [2023-08-26 17:28:31,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 311 flow [2023-08-26 17:28:31,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:31,537 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 165 flow [2023-08-26 17:28:31,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-08-26 17:28:31,538 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2023-08-26 17:28:31,538 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 165 flow [2023-08-26 17:28:31,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 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-26 17:28:31,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:31,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:28:31,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 17:28:31,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:31,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:31,538 INFO L85 PathProgramCache]: Analyzing trace with hash -589188273, now seen corresponding path program 1 times [2023-08-26 17:28:31,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:31,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712760231] [2023-08-26 17:28:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:31,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:31,624 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-26 17:28:31,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:31,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712760231] [2023-08-26 17:28:31,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712760231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:31,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:31,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:28:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904982463] [2023-08-26 17:28:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:31,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:28:31,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:28:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:28:31,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 17:28:31,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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-26 17:28:31,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:31,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 17:28:31,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:31,710 INFO L124 PetriNetUnfolderBase]: 539/1036 cut-off events. [2023-08-26 17:28:31,710 INFO L125 PetriNetUnfolderBase]: For 136/138 co-relation queries the response was YES. [2023-08-26 17:28:31,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1036 events. 539/1036 cut-off events. For 136/138 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4939 event pairs, 464 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 2258. Up to 992 conditions per place. [2023-08-26 17:28:31,714 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 49 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-26 17:28:31,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 53 transitions, 261 flow [2023-08-26 17:28:31,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:28:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:28:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2023-08-26 17:28:31,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32920536635706915 [2023-08-26 17:28:31,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 638 transitions. [2023-08-26 17:28:31,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 638 transitions. [2023-08-26 17:28:31,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:31,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 638 transitions. [2023-08-26 17:28:31,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-26 17:28:31,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:31,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 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-26 17:28:31,719 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 165 flow. Second operand 3 states and 638 transitions. [2023-08-26 17:28:31,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 53 transitions, 261 flow [2023-08-26 17:28:31,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 17:28:31,720 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 159 flow [2023-08-26 17:28:31,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-08-26 17:28:31,721 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2023-08-26 17:28:31,721 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 159 flow [2023-08-26 17:28:31,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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-26 17:28:31,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:31,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:28:31,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 17:28:31,722 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:31,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash -589188272, now seen corresponding path program 1 times [2023-08-26 17:28:31,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:31,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062734559] [2023-08-26 17:28:31,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:31,829 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-26 17:28:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:31,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062734559] [2023-08-26 17:28:31,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062734559] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:31,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:31,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:28:31,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290122823] [2023-08-26 17:28:31,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:31,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 17:28:31,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:31,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 17:28:31,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 17:28:31,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 17:28:31,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 196.75) internal successors, (787), 4 states have internal predecessors, (787), 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-26 17:28:31,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:31,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 17:28:31,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:31,929 INFO L124 PetriNetUnfolderBase]: 429/800 cut-off events. [2023-08-26 17:28:31,929 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2023-08-26 17:28:31,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 800 events. 429/800 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3362 event pairs, 260 based on Foata normal form. 10/744 useless extension candidates. Maximal degree in co-relation 1779. Up to 566 conditions per place. [2023-08-26 17:28:31,931 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 61 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2023-08-26 17:28:31,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 67 transitions, 319 flow [2023-08-26 17:28:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 17:28:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 17:28:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 839 transitions. [2023-08-26 17:28:31,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32469040247678016 [2023-08-26 17:28:31,933 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 839 transitions. [2023-08-26 17:28:31,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 839 transitions. [2023-08-26 17:28:31,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:31,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 839 transitions. [2023-08-26 17:28:31,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 209.75) internal successors, (839), 4 states have internal predecessors, (839), 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-26 17:28:31,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 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-26 17:28:31,937 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 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-26 17:28:31,937 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 159 flow. Second operand 4 states and 839 transitions. [2023-08-26 17:28:31,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 67 transitions, 319 flow [2023-08-26 17:28:31,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 316 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:31,939 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 168 flow [2023-08-26 17:28:31,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2023-08-26 17:28:31,940 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2023-08-26 17:28:31,940 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 168 flow [2023-08-26 17:28:31,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 196.75) internal successors, (787), 4 states have internal predecessors, (787), 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-26 17:28:31,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:31,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:28:31,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 17:28:31,940 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:31,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:31,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1084964103, now seen corresponding path program 1 times [2023-08-26 17:28:31,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:31,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821593832] [2023-08-26 17:28:31,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:28:32,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:32,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821593832] [2023-08-26 17:28:32,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821593832] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:32,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:32,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 17:28:32,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372933756] [2023-08-26 17:28:32,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:32,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 17:28:32,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:32,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 17:28:32,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 17:28:32,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 646 [2023-08-26 17:28:32,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 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-26 17:28:32,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:32,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 646 [2023-08-26 17:28:32,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:32,320 INFO L124 PetriNetUnfolderBase]: 421/793 cut-off events. [2023-08-26 17:28:32,320 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-08-26 17:28:32,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 793 events. 421/793 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3324 event pairs, 336 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1811. Up to 750 conditions per place. [2023-08-26 17:28:32,322 INFO L140 encePairwiseOnDemand]: 639/646 looper letters, 51 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2023-08-26 17:28:32,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 322 flow [2023-08-26 17:28:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 17:28:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 17:28:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1294 transitions. [2023-08-26 17:28:32,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33384932920536636 [2023-08-26 17:28:32,325 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1294 transitions. [2023-08-26 17:28:32,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1294 transitions. [2023-08-26 17:28:32,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:32,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1294 transitions. [2023-08-26 17:28:32,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 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-26 17:28:32,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 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-26 17:28:32,330 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 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-26 17:28:32,330 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 168 flow. Second operand 6 states and 1294 transitions. [2023-08-26 17:28:32,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 322 flow [2023-08-26 17:28:32,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 64 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 17:28:32,332 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 222 flow [2023-08-26 17:28:32,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2023-08-26 17:28:32,332 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -31 predicate places. [2023-08-26 17:28:32,332 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 222 flow [2023-08-26 17:28:32,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 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-26 17:28:32,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:32,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:28:32,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 17:28:32,333 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:32,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash -433731727, now seen corresponding path program 1 times [2023-08-26 17:28:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312201583] [2023-08-26 17:28:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:28:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:32,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312201583] [2023-08-26 17:28:32,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312201583] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:32,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:32,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 17:28:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387228640] [2023-08-26 17:28:32,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:32,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 17:28:32,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 17:28:32,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 17:28:32,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 17:28:32,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 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-26 17:28:32,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:32,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 17:28:32,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:32,917 INFO L124 PetriNetUnfolderBase]: 550/1031 cut-off events. [2023-08-26 17:28:32,917 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2023-08-26 17:28:32,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 1031 events. 550/1031 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4660 event pairs, 106 based on Foata normal form. 9/978 useless extension candidates. Maximal degree in co-relation 2479. Up to 687 conditions per place. [2023-08-26 17:28:32,921 INFO L140 encePairwiseOnDemand]: 636/646 looper letters, 68 selfloop transitions, 18 changer transitions 0/89 dead transitions. [2023-08-26 17:28:32,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 480 flow [2023-08-26 17:28:32,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 17:28:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 17:28:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1118 transitions. [2023-08-26 17:28:32,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2884416924664603 [2023-08-26 17:28:32,924 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1118 transitions. [2023-08-26 17:28:32,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1118 transitions. [2023-08-26 17:28:32,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:32,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1118 transitions. [2023-08-26 17:28:32,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 186.33333333333334) internal successors, (1118), 6 states have internal predecessors, (1118), 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-26 17:28:32,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 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-26 17:28:32,929 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 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-26 17:28:32,929 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 222 flow. Second operand 6 states and 1118 transitions. [2023-08-26 17:28:32,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 480 flow [2023-08-26 17:28:32,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 89 transitions, 472 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:32,932 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 320 flow [2023-08-26 17:28:32,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2023-08-26 17:28:32,932 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -24 predicate places. [2023-08-26 17:28:32,932 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 320 flow [2023-08-26 17:28:32,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 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-26 17:28:32,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:32,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:28:32,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 17:28:32,933 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:32,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash 821086537, now seen corresponding path program 2 times [2023-08-26 17:28:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:32,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794695019] [2023-08-26 17:28:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:28:33,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:33,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794695019] [2023-08-26 17:28:33,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794695019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:28:33,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:28:33,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 17:28:33,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884157958] [2023-08-26 17:28:33,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:28:33,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 17:28:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:33,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 17:28:33,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 17:28:33,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 17:28:33,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 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-26 17:28:33,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:33,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 17:28:33,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:33,535 INFO L124 PetriNetUnfolderBase]: 519/990 cut-off events. [2023-08-26 17:28:33,535 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2023-08-26 17:28:33,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 990 events. 519/990 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4443 event pairs, 157 based on Foata normal form. 9/957 useless extension candidates. Maximal degree in co-relation 2638. Up to 646 conditions per place. [2023-08-26 17:28:33,539 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 76 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2023-08-26 17:28:33,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 91 transitions, 566 flow [2023-08-26 17:28:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 17:28:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 17:28:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1115 transitions. [2023-08-26 17:28:33,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28766769865841074 [2023-08-26 17:28:33,541 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1115 transitions. [2023-08-26 17:28:33,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1115 transitions. [2023-08-26 17:28:33,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:28:33,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1115 transitions. [2023-08-26 17:28:33,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 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-26 17:28:33,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 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-26 17:28:33,547 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 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-26 17:28:33,547 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 320 flow. Second operand 6 states and 1115 transitions. [2023-08-26 17:28:33,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 91 transitions, 566 flow [2023-08-26 17:28:33,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 91 transitions, 550 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 17:28:33,550 INFO L231 Difference]: Finished difference. Result has 86 places, 68 transitions, 360 flow [2023-08-26 17:28:33,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=86, PETRI_TRANSITIONS=68} [2023-08-26 17:28:33,551 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -18 predicate places. [2023-08-26 17:28:33,551 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 360 flow [2023-08-26 17:28:33,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 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-26 17:28:33,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:28:33,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:28:33,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 17:28:33,552 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:28:33,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:28:33,552 INFO L85 PathProgramCache]: Analyzing trace with hash 693396545, now seen corresponding path program 1 times [2023-08-26 17:28:33,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:28:33,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162308959] [2023-08-26 17:28:33,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:33,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:28:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:34,032 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-26 17:28:34,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:28:34,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162308959] [2023-08-26 17:28:34,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162308959] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:28:34,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082866544] [2023-08-26 17:28:34,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:28:34,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:28:34,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:28:34,038 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-26 17:28:34,041 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-26 17:28:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:28:34,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-26 17:28:34,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:28:34,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:28:34,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:28:34,250 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 17:28:34,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 17:28:34,272 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 17:28:34,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 17:28:34,339 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 17:28:34,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-26 17:28:34,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-26 17:28:34,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:28:34,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-26 17:28:34,594 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-26 17:28:34,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:28:34,729 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_534 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_534) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_537) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_534 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_534) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_537) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-26 17:28:34,740 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:28:34,740 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 94 [2023-08-26 17:28:45,723 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-26 17:28:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082866544] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:28:45,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:28:45,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2023-08-26 17:28:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031100750] [2023-08-26 17:28:45,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:28:45,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-26 17:28:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:28:45,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-26 17:28:45,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=422, Unknown=12, NotChecked=44, Total=600 [2023-08-26 17:28:45,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 17:28:45,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 360 flow. Second operand has 25 states, 25 states have (on average 174.56) internal successors, (4364), 25 states have internal predecessors, (4364), 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-26 17:28:45,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:28:45,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 17:28:45,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:28:53,916 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-26 17:29:02,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:29:04,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:29:11,116 WARN L234 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 61 DAG size of output: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 17:29:14,269 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-26 17:29:16,322 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-26 17:29:17,563 INFO L124 PetriNetUnfolderBase]: 680/1309 cut-off events. [2023-08-26 17:29:17,563 INFO L125 PetriNetUnfolderBase]: For 903/903 co-relation queries the response was YES. [2023-08-26 17:29:17,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3575 conditions, 1309 events. 680/1309 cut-off events. For 903/903 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6593 event pairs, 440 based on Foata normal form. 12/1253 useless extension candidates. Maximal degree in co-relation 3557. Up to 973 conditions per place. [2023-08-26 17:29:17,569 INFO L140 encePairwiseOnDemand]: 634/646 looper letters, 105 selfloop transitions, 35 changer transitions 0/143 dead transitions. [2023-08-26 17:29:17,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 143 transitions, 948 flow [2023-08-26 17:29:17,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 17:29:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 17:29:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3417 transitions. [2023-08-26 17:29:17,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.278393351800554 [2023-08-26 17:29:17,576 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3417 transitions. [2023-08-26 17:29:17,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3417 transitions. [2023-08-26 17:29:17,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:29:17,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3417 transitions. [2023-08-26 17:29:17,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 179.8421052631579) internal successors, (3417), 19 states have internal predecessors, (3417), 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-26 17:29:17,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 646.0) internal successors, (12920), 20 states have internal predecessors, (12920), 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-26 17:29:17,593 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 646.0) internal successors, (12920), 20 states have internal predecessors, (12920), 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-26 17:29:17,593 INFO L175 Difference]: Start difference. First operand has 86 places, 68 transitions, 360 flow. Second operand 19 states and 3417 transitions. [2023-08-26 17:29:17,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 143 transitions, 948 flow [2023-08-26 17:29:17,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 143 transitions, 932 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 17:29:17,598 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 634 flow [2023-08-26 17:29:17,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=634, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2023-08-26 17:29:17,598 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 7 predicate places. [2023-08-26 17:29:17,598 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 634 flow [2023-08-26 17:29:17,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 174.56) internal successors, (4364), 25 states have internal predecessors, (4364), 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-26 17:29:17,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:29:17,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:29:17,619 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-26 17:29:17,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 17:29:17,809 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:29:17,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:29:17,810 INFO L85 PathProgramCache]: Analyzing trace with hash -593236279, now seen corresponding path program 1 times [2023-08-26 17:29:17,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:29:17,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804569939] [2023-08-26 17:29:17,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:29:17,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:29:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:29:18,610 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-26 17:29:18,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:29:18,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804569939] [2023-08-26 17:29:18,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804569939] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:29:18,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886041598] [2023-08-26 17:29:18,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:29:18,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:29:18,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:29:18,611 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-26 17:29:18,612 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-26 17:29:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:29:18,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-26 17:29:18,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:29:18,773 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2023-08-26 17:29:18,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:29:18,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:29:18,803 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 17:29:18,804 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-26 17:29:18,833 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 17:29:18,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 17:29:18,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-26 17:29:19,081 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 17:29:19,081 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-08-26 17:29:19,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-26 17:29:19,362 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-08-26 17:29:19,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:29:19,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-26 17:29:19,485 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-26 17:29:19,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:29:19,602 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_630 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_630 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-26 17:29:19,620 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_630 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_630 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-26 17:29:19,648 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_627 Int) (v_ArrVal_630 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_627) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_627 Int) (v_ArrVal_630 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_627) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-26 17:29:19,666 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:29:19,666 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 94 [2023-08-26 17:29:25,298 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-26 17:29:25,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886041598] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:29:25,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:29:25,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2023-08-26 17:29:25,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191888762] [2023-08-26 17:29:25,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:29:25,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-26 17:29:25,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:29:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-26 17:29:25,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=448, Unknown=14, NotChecked=138, Total=702 [2023-08-26 17:29:25,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 17:29:25,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 93 transitions, 634 flow. Second operand has 27 states, 27 states have (on average 169.55555555555554) internal successors, (4578), 27 states have internal predecessors, (4578), 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-26 17:29:25,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:29:25,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 17:29:25,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:29:30,398 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-26 17:29:39,856 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-26 17:29:41,890 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-26 17:29:43,968 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-26 17:29:51,717 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-26 17:29:52,982 INFO L124 PetriNetUnfolderBase]: 1176/2267 cut-off events. [2023-08-26 17:29:52,982 INFO L125 PetriNetUnfolderBase]: For 2368/2368 co-relation queries the response was YES. [2023-08-26 17:29:52,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6370 conditions, 2267 events. 1176/2267 cut-off events. For 2368/2368 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 12985 event pairs, 363 based on Foata normal form. 29/2187 useless extension candidates. Maximal degree in co-relation 6343. Up to 703 conditions per place. [2023-08-26 17:29:52,993 INFO L140 encePairwiseOnDemand]: 630/646 looper letters, 163 selfloop transitions, 57 changer transitions 0/223 dead transitions. [2023-08-26 17:29:52,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 223 transitions, 1544 flow [2023-08-26 17:29:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 17:29:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 17:29:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2368 transitions. [2023-08-26 17:29:52,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2819718980709693 [2023-08-26 17:29:52,998 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2368 transitions. [2023-08-26 17:29:52,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2368 transitions. [2023-08-26 17:29:52,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:29:52,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2368 transitions. [2023-08-26 17:29:53,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 182.15384615384616) internal successors, (2368), 13 states have internal predecessors, (2368), 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-26 17:29:53,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 646.0) internal successors, (9044), 14 states have internal predecessors, (9044), 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-26 17:29:53,008 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 646.0) internal successors, (9044), 14 states have internal predecessors, (9044), 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-26 17:29:53,008 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 634 flow. Second operand 13 states and 2368 transitions. [2023-08-26 17:29:53,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 223 transitions, 1544 flow [2023-08-26 17:29:53,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 223 transitions, 1426 flow, removed 47 selfloop flow, removed 6 redundant places. [2023-08-26 17:29:53,018 INFO L231 Difference]: Finished difference. Result has 122 places, 121 transitions, 917 flow [2023-08-26 17:29:53,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=917, PETRI_PLACES=122, PETRI_TRANSITIONS=121} [2023-08-26 17:29:53,018 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 18 predicate places. [2023-08-26 17:29:53,018 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 121 transitions, 917 flow [2023-08-26 17:29:53,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 169.55555555555554) internal successors, (4578), 27 states have internal predecessors, (4578), 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-26 17:29:53,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:29:53,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:29:53,027 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-26 17:29:53,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 17:29:53,224 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:29:53,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:29:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash 20455127, now seen corresponding path program 2 times [2023-08-26 17:29:53,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:29:53,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11632783] [2023-08-26 17:29:53,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:29:53,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:29:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:29:53,958 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-26 17:29:53,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:29:53,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11632783] [2023-08-26 17:29:53,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11632783] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:29:53,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319389575] [2023-08-26 17:29:53,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 17:29:53,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:29:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:29:53,960 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-26 17:29:53,960 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-26 17:29:54,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 17:29:54,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 17:29:54,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-26 17:29:54,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:29:54,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:29:54,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:29:54,158 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 17:29:54,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 17:29:54,192 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 17:29:54,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 17:29:54,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 17:29:54,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-26 17:29:54,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-26 17:29:54,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:29:54,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-26 17:29:54,766 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-26 17:29:54,820 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-26 17:29:54,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:29:54,830 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 38 treesize of output 34 [2023-08-26 17:29:54,876 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_727 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_727) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_727 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_727) |c_~#queue~0.base|) .cse0) 22)))) is different from false [2023-08-26 17:29:54,890 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_727) |c_~#queue~0.base|) .cse0) 22)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_727) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-26 17:29:54,996 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_727) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (< (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_727) |c_~#queue~0.base|) .cse1) 22)))) is different from false [2023-08-26 17:29:59,792 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-26 17:29:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319389575] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:29:59,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:29:59,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-26 17:29:59,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858350278] [2023-08-26 17:29:59,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:29:59,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-26 17:29:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:29:59,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-26 17:29:59,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=415, Unknown=15, NotChecked=132, Total=650 [2023-08-26 17:29:59,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 17:29:59,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 121 transitions, 917 flow. Second operand has 26 states, 26 states have (on average 169.6153846153846) internal successors, (4410), 26 states have internal predecessors, (4410), 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-26 17:29:59,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:29:59,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 17:29:59,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:30:06,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:09,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:11,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:13,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:25,043 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 [0, 1] [2023-08-26 17:30:27,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:29,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:31,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:33,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:35,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:37,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 [0, 1] [2023-08-26 17:30:40,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:42,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:44,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:46,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:30:52,458 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 [0, 1] [2023-08-26 17:30:55,999 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-26 17:30:58,002 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-26 17:31:00,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:31:02,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:31:04,012 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-26 17:31:06,015 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-26 17:31:08,655 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-26 17:31:10,784 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-26 17:31:12,940 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-26 17:31:15,530 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-26 17:31:17,602 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-26 17:31:19,757 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-26 17:31:22,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:31:25,018 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-26 17:31:27,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:31:32,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:31:34,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:31:35,410 INFO L124 PetriNetUnfolderBase]: 1893/3586 cut-off events. [2023-08-26 17:31:35,411 INFO L125 PetriNetUnfolderBase]: For 6348/6348 co-relation queries the response was YES. [2023-08-26 17:31:35,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12003 conditions, 3586 events. 1893/3586 cut-off events. For 6348/6348 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 22565 event pairs, 458 based on Foata normal form. 18/3449 useless extension candidates. Maximal degree in co-relation 11971. Up to 1557 conditions per place. [2023-08-26 17:31:35,425 INFO L140 encePairwiseOnDemand]: 625/646 looper letters, 204 selfloop transitions, 92 changer transitions 0/299 dead transitions. [2023-08-26 17:31:35,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 299 transitions, 2394 flow [2023-08-26 17:31:35,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 17:31:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 17:31:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3758 transitions. [2023-08-26 17:31:35,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27701606958572905 [2023-08-26 17:31:35,432 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3758 transitions. [2023-08-26 17:31:35,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3758 transitions. [2023-08-26 17:31:35,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:31:35,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3758 transitions. [2023-08-26 17:31:35,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 178.95238095238096) internal successors, (3758), 21 states have internal predecessors, (3758), 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-26 17:31:35,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 646.0) internal successors, (14212), 22 states have internal predecessors, (14212), 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-26 17:31:35,445 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 646.0) internal successors, (14212), 22 states have internal predecessors, (14212), 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-26 17:31:35,445 INFO L175 Difference]: Start difference. First operand has 122 places, 121 transitions, 917 flow. Second operand 21 states and 3758 transitions. [2023-08-26 17:31:35,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 299 transitions, 2394 flow [2023-08-26 17:31:35,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 299 transitions, 2305 flow, removed 32 selfloop flow, removed 5 redundant places. [2023-08-26 17:31:35,464 INFO L231 Difference]: Finished difference. Result has 147 places, 183 transitions, 1654 flow [2023-08-26 17:31:35,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1654, PETRI_PLACES=147, PETRI_TRANSITIONS=183} [2023-08-26 17:31:35,464 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 43 predicate places. [2023-08-26 17:31:35,464 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 183 transitions, 1654 flow [2023-08-26 17:31:35,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 169.6153846153846) internal successors, (4410), 26 states have internal predecessors, (4410), 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-26 17:31:35,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:31:35,465 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:31:35,475 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-26 17:31:35,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:31:35,670 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:31:35,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:31:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash 40705305, now seen corresponding path program 1 times [2023-08-26 17:31:35,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:31:35,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918162037] [2023-08-26 17:31:35,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:31:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:31:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:31:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:31:36,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:31:36,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918162037] [2023-08-26 17:31:36,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918162037] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:31:36,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522775210] [2023-08-26 17:31:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:31:36,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:31:36,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:31:36,593 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-26 17:31:36,595 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-26 17:31:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:31:36,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-26 17:31:36,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:31:36,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:36,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:36,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:36,738 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 17:31:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:31:37,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:31:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:31:37,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522775210] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:31:37,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:31:37,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3, 3] total 15 [2023-08-26 17:31:37,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198192650] [2023-08-26 17:31:37,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:31:37,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 17:31:37,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:31:37,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 17:31:37,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-08-26 17:31:37,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 646 [2023-08-26 17:31:37,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 183 transitions, 1654 flow. Second operand has 16 states, 16 states have (on average 170.5625) internal successors, (2729), 16 states have internal predecessors, (2729), 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-26 17:31:37,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:31:37,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 646 [2023-08-26 17:31:37,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:31:41,915 INFO L124 PetriNetUnfolderBase]: 2946/5539 cut-off events. [2023-08-26 17:31:41,916 INFO L125 PetriNetUnfolderBase]: For 41952/41954 co-relation queries the response was YES. [2023-08-26 17:31:41,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30772 conditions, 5539 events. 2946/5539 cut-off events. For 41952/41954 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 34299 event pairs, 922 based on Foata normal form. 192/5553 useless extension candidates. Maximal degree in co-relation 30730. Up to 2250 conditions per place. [2023-08-26 17:31:41,952 INFO L140 encePairwiseOnDemand]: 632/646 looper letters, 304 selfloop transitions, 80 changer transitions 0/387 dead transitions. [2023-08-26 17:31:41,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 387 transitions, 4292 flow [2023-08-26 17:31:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-26 17:31:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-26 17:31:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3931 transitions. [2023-08-26 17:31:41,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27659724176752043 [2023-08-26 17:31:41,957 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3931 transitions. [2023-08-26 17:31:41,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3931 transitions. [2023-08-26 17:31:41,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:31:41,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3931 transitions. [2023-08-26 17:31:41,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 178.6818181818182) internal successors, (3931), 22 states have internal predecessors, (3931), 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-26 17:31:41,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 646.0) internal successors, (14858), 23 states have internal predecessors, (14858), 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-26 17:31:41,970 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 646.0) internal successors, (14858), 23 states have internal predecessors, (14858), 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-26 17:31:41,970 INFO L175 Difference]: Start difference. First operand has 147 places, 183 transitions, 1654 flow. Second operand 22 states and 3931 transitions. [2023-08-26 17:31:41,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 387 transitions, 4292 flow [2023-08-26 17:31:42,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 387 transitions, 4011 flow, removed 116 selfloop flow, removed 7 redundant places. [2023-08-26 17:31:42,023 INFO L231 Difference]: Finished difference. Result has 169 places, 196 transitions, 1875 flow [2023-08-26 17:31:42,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1875, PETRI_PLACES=169, PETRI_TRANSITIONS=196} [2023-08-26 17:31:42,024 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 65 predicate places. [2023-08-26 17:31:42,024 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 196 transitions, 1875 flow [2023-08-26 17:31:42,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 170.5625) internal successors, (2729), 16 states have internal predecessors, (2729), 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-26 17:31:42,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:31:42,024 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:31:42,029 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-26 17:31:42,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:31:42,229 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:31:42,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:31:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash -696392966, now seen corresponding path program 1 times [2023-08-26 17:31:42,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:31:42,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572608947] [2023-08-26 17:31:42,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:31:42,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:31:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:31:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:31:43,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:31:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572608947] [2023-08-26 17:31:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572608947] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:31:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565872436] [2023-08-26 17:31:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:31:43,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:31:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:31:43,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 17:31:43,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 17:31:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:31:43,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 17:31:43,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:31:44,327 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 17:31:44,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:44,432 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 17:31:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:31:44,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:31:44,617 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_906 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_906) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_906 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_906) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-26 17:31:44,632 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:31:44,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-26 17:31:44,655 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:31:44,656 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2023-08-26 17:31:44,693 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 14 treesize of output 10 [2023-08-26 17:31:44,706 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:31:44,706 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-26 17:31:44,710 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 17:31:44,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:44,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-08-26 17:31:45,121 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 17:31:45,121 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2023-08-26 17:31:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-26 17:31:45,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565872436] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:31:45,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:31:45,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 23 [2023-08-26 17:31:45,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86160160] [2023-08-26 17:31:45,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:31:45,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-26 17:31:45,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:31:45,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-26 17:31:45,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=417, Unknown=1, NotChecked=42, Total=552 [2023-08-26 17:31:45,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 17:31:45,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 196 transitions, 1875 flow. Second operand has 24 states, 24 states have (on average 170.625) internal successors, (4095), 24 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:31:45,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:31:45,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 17:31:45,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:31:49,011 INFO L124 PetriNetUnfolderBase]: 2341/4473 cut-off events. [2023-08-26 17:31:49,011 INFO L125 PetriNetUnfolderBase]: For 36242/36242 co-relation queries the response was YES. [2023-08-26 17:31:49,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25386 conditions, 4473 events. 2341/4473 cut-off events. For 36242/36242 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 26175 event pairs, 687 based on Foata normal form. 75/4333 useless extension candidates. Maximal degree in co-relation 25336. Up to 2073 conditions per place. [2023-08-26 17:31:49,084 INFO L140 encePairwiseOnDemand]: 635/646 looper letters, 210 selfloop transitions, 63 changer transitions 0/276 dead transitions. [2023-08-26 17:31:49,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 276 transitions, 3318 flow [2023-08-26 17:31:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 17:31:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 17:31:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2508 transitions. [2023-08-26 17:31:49,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2773109243697479 [2023-08-26 17:31:49,088 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2508 transitions. [2023-08-26 17:31:49,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2508 transitions. [2023-08-26 17:31:49,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:31:49,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2508 transitions. [2023-08-26 17:31:49,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 179.14285714285714) internal successors, (2508), 14 states have internal predecessors, (2508), 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-26 17:31:49,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 646.0) internal successors, (9690), 15 states have internal predecessors, (9690), 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-26 17:31:49,095 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 646.0) internal successors, (9690), 15 states have internal predecessors, (9690), 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-26 17:31:49,095 INFO L175 Difference]: Start difference. First operand has 169 places, 196 transitions, 1875 flow. Second operand 14 states and 2508 transitions. [2023-08-26 17:31:49,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 276 transitions, 3318 flow [2023-08-26 17:31:49,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 276 transitions, 3231 flow, removed 31 selfloop flow, removed 8 redundant places. [2023-08-26 17:31:49,128 INFO L231 Difference]: Finished difference. Result has 176 places, 200 transitions, 2003 flow [2023-08-26 17:31:49,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2003, PETRI_PLACES=176, PETRI_TRANSITIONS=200} [2023-08-26 17:31:49,128 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 72 predicate places. [2023-08-26 17:31:49,128 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 200 transitions, 2003 flow [2023-08-26 17:31:49,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 170.625) internal successors, (4095), 24 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:31:49,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:31:49,129 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 17:31:49,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-26 17:31:49,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:31:49,334 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 17:31:49,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:31:49,334 INFO L85 PathProgramCache]: Analyzing trace with hash 98860424, now seen corresponding path program 3 times [2023-08-26 17:31:49,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:31:49,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44488392] [2023-08-26 17:31:49,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:31:49,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:31:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:31:52,715 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-26 17:31:52,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:31:52,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44488392] [2023-08-26 17:31:52,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44488392] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 17:31:52,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567001094] [2023-08-26 17:31:52,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 17:31:52,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:31:52,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:31:52,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 17:31:52,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 17:31:52,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 17:31:52,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 17:31:52,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 80 conjunts are in the unsatisfiable core [2023-08-26 17:31:52,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 17:31:52,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:52,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:52,978 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 17:31:52,978 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 29 [2023-08-26 17:31:52,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-26 17:31:53,032 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 17:31:53,032 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-26 17:31:53,060 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 17:31:53,061 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 17:31:53,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:53,416 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-26 17:31:53,617 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-26 17:31:53,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 17:31:53,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:53,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-26 17:31:54,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:54,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-26 17:31:54,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-26 17:31:54,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:54,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-26 17:31:54,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 17:31:55,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 17:31:55,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-26 17:31:55,179 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-26 17:31:55,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 17:32:11,114 WARN L234 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 17:32:39,307 WARN L234 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 17:32:39,580 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-26 17:32:39,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567001094] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 17:32:39,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 17:32:39,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 16] total 41 [2023-08-26 17:32:39,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911943775] [2023-08-26 17:32:39,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 17:32:39,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-08-26 17:32:39,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:32:39,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-08-26 17:32:39,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1449, Unknown=35, NotChecked=0, Total=1806 [2023-08-26 17:32:39,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 17:32:39,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 200 transitions, 2003 flow. Second operand has 43 states, 43 states have (on average 169.53488372093022) internal successors, (7290), 43 states have internal predecessors, (7290), 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-26 17:32:39,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:32:39,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 17:32:39,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:33:02,718 WARN L234 SmtUtils]: Spent 13.89s on a formula simplification. DAG size of input: 227 DAG size of output: 163 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 17:33:06,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:08,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:09,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:11,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:15,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:18,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:20,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:21,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:23,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:25,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:29,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:36,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:39,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:49,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:51,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:33:53,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:34:56,129 WARN L234 SmtUtils]: Spent 58.33s on a formula simplification. DAG size of input: 233 DAG size of output: 101 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 17:34:58,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:00,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:03,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:05,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:08,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:10,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:12,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:14,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:15,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:20,665 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 [0, 1] [2023-08-26 17:35:23,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:25,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:27,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 [0, 1] [2023-08-26 17:35:30,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:32,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:34,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:36,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:38,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:40,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:42,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:44,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:46,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:48,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:50,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:52,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:55,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:57,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:35:59,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:01,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:03,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:05,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:09,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:11,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:13,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:15,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:18,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:20,168 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 [0, 1] [2023-08-26 17:36:22,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:24,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:26,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:28,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:30,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:44,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:46,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:48,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:50,376 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 [0, 1] [2023-08-26 17:36:52,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:55,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:57,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:36:59,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:37:01,277 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 [0, 1] [2023-08-26 17:37:03,436 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 [0, 1] [2023-08-26 17:37:05,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:37:08,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:37:10,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 [0, 1] [2023-08-26 17:37:12,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:37:14,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:37:16,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:40:21,559 WARN L234 SmtUtils]: Spent 2.94m on a formula simplification. DAG size of input: 286 DAG size of output: 227 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 17:40:23,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:40:26,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:40:28,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:40:31,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:40:35,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:40:38,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:40:40,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:40:42,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:40:44,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:40:46,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:41:48,864 WARN L234 SmtUtils]: Spent 45.93s on a formula simplification. DAG size of input: 265 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 17:41:54,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:42:07,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 17:42:10,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:42:12,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:42:14,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:42:18,559 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 [0, 1] [2023-08-26 17:42:20,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:42:23,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:42:25,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:42:27,071 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 [0, 1] [2023-08-26 17:42:28,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:42:31,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:42:32,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 17:42:33,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Received shutdown request... [2023-08-26 17:42:40,968 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-26 17:42:40,968 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 17:42:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 17:42:41,250 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 103 remaining) [2023-08-26 17:42:41,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 17:42:41,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 17:42:41,451 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. [2023-08-26 17:42:41,452 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 103 remaining) [2023-08-26 17:42:41,452 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 103 remaining) [2023-08-26 17:42:41,452 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 103 remaining) [2023-08-26 17:42:41,452 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 103 remaining) [2023-08-26 17:42:41,452 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 103 remaining) [2023-08-26 17:42:41,452 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 103 remaining) [2023-08-26 17:42:41,452 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 103 remaining) [2023-08-26 17:42:41,452 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 103 remaining) [2023-08-26 17:42:41,452 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONASSERT (91 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (82 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 103 remaining) [2023-08-26 17:42:41,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 103 remaining) [2023-08-26 17:42:41,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 103 remaining) [2023-08-26 17:42:41,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err22ASSERT_VIOLATIONASSERT (40 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 103 remaining) [2023-08-26 17:42:41,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 103 remaining) [2023-08-26 17:42:41,457 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 103 remaining) [2023-08-26 17:42:41,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err22ASSERT_VIOLATIONASSERT (0 of 103 remaining) [2023-08-26 17:42:41,459 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:42:41,462 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 17:42:41,462 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 17:42:41,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 05:42:41 BasicIcfg [2023-08-26 17:42:41,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 17:42:41,464 INFO L158 Benchmark]: Toolchain (without parser) took 867011.40ms. Allocated memory was 388.0MB in the beginning and 700.4MB in the end (delta: 312.5MB). Free memory was 362.8MB in the beginning and 305.8MB in the end (delta: 57.0MB). Peak memory consumption was 369.3MB. Max. memory is 16.0GB. [2023-08-26 17:42:41,464 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 388.0MB. Free memory is still 364.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 17:42:41,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.14ms. Allocated memory is still 388.0MB. Free memory was 362.8MB in the beginning and 332.6MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 17:42:41,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.36ms. Allocated memory is still 388.0MB. Free memory was 332.6MB in the beginning and 330.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 17:42:41,464 INFO L158 Benchmark]: Boogie Preprocessor took 38.49ms. Allocated memory is still 388.0MB. Free memory was 330.1MB in the beginning and 328.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 17:42:41,465 INFO L158 Benchmark]: RCFGBuilder took 559.08ms. Allocated memory is still 388.0MB. Free memory was 328.0MB in the beginning and 298.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 17:42:41,465 INFO L158 Benchmark]: TraceAbstraction took 865930.35ms. Allocated memory was 388.0MB in the beginning and 700.4MB in the end (delta: 312.5MB). Free memory was 297.8MB in the beginning and 305.8MB in the end (delta: -8.0MB). Peak memory consumption was 304.2MB. Max. memory is 16.0GB. [2023-08-26 17:42:41,465 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.09ms. Allocated memory is still 388.0MB. Free memory is still 364.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 422.14ms. Allocated memory is still 388.0MB. Free memory was 362.8MB in the beginning and 332.6MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.36ms. Allocated memory is still 388.0MB. Free memory was 332.6MB in the beginning and 330.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.49ms. Allocated memory is still 388.0MB. Free memory was 330.1MB in the beginning and 328.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 559.08ms. Allocated memory is still 388.0MB. Free memory was 328.0MB in the beginning and 298.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 865930.35ms. Allocated memory was 388.0MB in the beginning and 700.4MB in the end (delta: 312.5MB). Free memory was 297.8MB in the beginning and 305.8MB in the end (delta: -8.0MB). Peak memory consumption was 304.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2s, 263 PlacesBefore, 104 PlacesAfterwards, 271 TransitionsBefore, 104 TransitionsAfterwards, 18460 CoEnabledTransitionPairs, 8 FixpointIterations, 104 TrivialSequentialCompositions, 223 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 22 ConcurrentYvCompositions, 8 ChoiceCompositions, 364 TotalNumberOfCompositions, 58098 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25857, independent: 25085, independent conditional: 0, independent unconditional: 25085, dependent: 772, dependent conditional: 0, dependent unconditional: 772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11511, independent: 11395, independent conditional: 0, independent unconditional: 11395, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25857, independent: 13690, independent conditional: 0, independent unconditional: 13690, dependent: 656, dependent conditional: 0, dependent unconditional: 656, unknown: 11511, unknown conditional: 0, unknown unconditional: 11511] , Statistics on independence cache: Total cache size (in pairs): 659, Positive cache size: 592, Positive conditional cache size: 0, Positive unconditional cache size: 592, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 59 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 103 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 865.8s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 768.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.3s, HoareTripleCheckerStatistics: 346 mSolverCounterUnknown, 2700 SdHoareTripleChecker+Valid, 344.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2700 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 338.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2050 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7526 IncrementalHoareTripleChecker+Invalid, 10276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 354 mSolverCounterUnsat, 7 mSDtfsCounter, 7526 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 125 SyntacticMatches, 9 SemanticMatches, 261 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 2139 ImplicationChecksByTransitivity, 481.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2003occurred in iteration=21, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 82.9s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 388 ConstructedInterpolants, 76 QuantifiedInterpolants, 19102 SizeOfPredicates, 69 NumberOfNonLiveVariables, 1833 ConjunctsInSsa, 333 ConjunctsInUnsatCore, 34 InterpolantComputations, 16 PerfectInterpolantSequences, 18/84 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown