/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/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:58:12,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:58:12,322 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 18:58:12,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:58:12,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:58:12,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:58:12,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:58:12,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:58:12,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:58:12,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:58:12,341 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:58:12,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:58:12,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:58:12,342 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:58:12,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:58:12,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:58:12,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:58:12,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:58:12,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:58:12,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:58:12,344 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:58:12,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:58:12,344 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:58:12,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:58:12,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:58:12,345 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:58:12,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:58:12,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:58:12,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:58:12,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:58:12,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:58:12,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:58:12,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:58:12,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:58:12,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:58:12,346 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 18:58:12,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:58:12,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:58:12,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:58:12,622 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:58:12,622 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:58:12,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-08-26 18:58:13,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:58:13,809 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:58:13,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-08-26 18:58:13,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c7be63f/3a7e8016a1664b6b92cdae970d144862/FLAGc475d12ec [2023-08-26 18:58:13,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c7be63f/3a7e8016a1664b6b92cdae970d144862 [2023-08-26 18:58:13,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:58:13,848 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:58:13,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:58:13,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:58:13,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:58:13,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:58:13" (1/1) ... [2023-08-26 18:58:13,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ff34c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:13, skipping insertion in model container [2023-08-26 18:58:13,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:58:13" (1/1) ... [2023-08-26 18:58:13,894 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:58:14,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:58:14,244 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:58:14,265 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 18:58:14,266 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 18:58:14,271 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-26 18:58:14,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:58:14,330 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:58:14,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14 WrapperNode [2023-08-26 18:58:14,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:58:14,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:58:14,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:58:14,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:58:14,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (1/1) ... [2023-08-26 18:58:14,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (1/1) ... [2023-08-26 18:58:14,399 INFO L138 Inliner]: procedures = 271, calls = 42, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 262 [2023-08-26 18:58:14,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:58:14,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:58:14,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:58:14,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:58:14,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (1/1) ... [2023-08-26 18:58:14,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (1/1) ... [2023-08-26 18:58:14,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (1/1) ... [2023-08-26 18:58:14,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (1/1) ... [2023-08-26 18:58:14,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (1/1) ... [2023-08-26 18:58:14,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (1/1) ... [2023-08-26 18:58:14,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (1/1) ... [2023-08-26 18:58:14,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (1/1) ... [2023-08-26 18:58:14,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:58:14,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:58:14,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:58:14,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:58:14,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (1/1) ... [2023-08-26 18:58:14,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:58:14,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:58:14,475 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 18:58:14,494 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 18:58:14,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:58:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:58:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:58:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:58:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 18:58:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:58:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 18:58:14,501 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 18:58:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:58:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:58:14,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:58:14,502 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 18:58:14,612 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:58:14,613 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:58:15,011 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:58:15,016 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:58:15,016 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-08-26 18:58:15,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:58:15 BoogieIcfgContainer [2023-08-26 18:58:15,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:58:15,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:58:15,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:58:15,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:58:15,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:58:13" (1/3) ... [2023-08-26 18:58:15,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c55d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:58:15, skipping insertion in model container [2023-08-26 18:58:15,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:58:14" (2/3) ... [2023-08-26 18:58:15,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c55d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:58:15, skipping insertion in model container [2023-08-26 18:58:15,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:58:15" (3/3) ... [2023-08-26 18:58:15,022 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2023-08-26 18:58:15,038 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:58:15,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-08-26 18:58:15,039 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:58:15,094 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 18:58:15,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 295 transitions, 598 flow [2023-08-26 18:58:15,205 INFO L124 PetriNetUnfolderBase]: 78/464 cut-off events. [2023-08-26 18:58:15,205 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:58:15,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 464 events. 78/464 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2382 event pairs, 0 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 257. Up to 8 conditions per place. [2023-08-26 18:58:15,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 295 transitions, 598 flow [2023-08-26 18:58:15,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 250 places, 295 transitions, 598 flow [2023-08-26 18:58:15,237 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:58:15,242 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 295 transitions, 598 flow [2023-08-26 18:58:15,244 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 295 transitions, 598 flow [2023-08-26 18:58:15,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 295 transitions, 598 flow [2023-08-26 18:58:15,307 INFO L124 PetriNetUnfolderBase]: 78/464 cut-off events. [2023-08-26 18:58:15,307 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:58:15,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 464 events. 78/464 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2382 event pairs, 0 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 257. Up to 8 conditions per place. [2023-08-26 18:58:15,318 INFO L119 LiptonReduction]: Number of co-enabled transitions 29050 [2023-08-26 18:58:18,886 INFO L134 LiptonReduction]: Checked pairs total: 56905 [2023-08-26 18:58:18,886 INFO L136 LiptonReduction]: Total number of compositions: 281 [2023-08-26 18:58:18,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:58:18,906 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;@117f06ad, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:58:18,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2023-08-26 18:58:18,908 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:58:18,908 INFO L124 PetriNetUnfolderBase]: 1/3 cut-off events. [2023-08-26 18:58:18,908 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:58:18,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:18,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:58:18,909 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:18,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:18,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1161777, now seen corresponding path program 1 times [2023-08-26 18:58:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972602596] [2023-08-26 18:58:18,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:18,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:58:19,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:19,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972602596] [2023-08-26 18:58:19,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972602596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:58:19,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:58:19,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:58:19,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436867527] [2023-08-26 18:58:19,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:58:19,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:58:19,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:19,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:58:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:58:19,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 576 [2023-08-26 18:58:19,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 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 18:58:19,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:19,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 576 [2023-08-26 18:58:19,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:19,430 INFO L124 PetriNetUnfolderBase]: 1080/2364 cut-off events. [2023-08-26 18:58:19,431 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:58:19,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4399 conditions, 2364 events. 1080/2364 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17170 event pairs, 920 based on Foata normal form. 182/1685 useless extension candidates. Maximal degree in co-relation 4273. Up to 2027 conditions per place. [2023-08-26 18:58:19,440 INFO L140 encePairwiseOnDemand]: 532/576 looper letters, 73 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2023-08-26 18:58:19,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 93 transitions, 344 flow [2023-08-26 18:58:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:58:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:58:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2023-08-26 18:58:19,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2023-08-26 18:58:19,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2023-08-26 18:58:19,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2023-08-26 18:58:19,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:19,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2023-08-26 18:58:19,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 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 18:58:19,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 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 18:58:19,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 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 18:58:19,469 INFO L175 Difference]: Start difference. First operand has 98 places, 133 transitions, 274 flow. Second operand 3 states and 840 transitions. [2023-08-26 18:58:19,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 93 transitions, 344 flow [2023-08-26 18:58:19,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 93 transitions, 344 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:58:19,474 INFO L231 Difference]: Finished difference. Result has 91 places, 93 transitions, 204 flow [2023-08-26 18:58:19,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=91, PETRI_TRANSITIONS=93} [2023-08-26 18:58:19,477 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -7 predicate places. [2023-08-26 18:58:19,477 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 204 flow [2023-08-26 18:58:19,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 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 18:58:19,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:19,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 18:58:19,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:58:19,478 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:19,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:19,479 INFO L85 PathProgramCache]: Analyzing trace with hash 36011481, now seen corresponding path program 1 times [2023-08-26 18:58:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:19,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787434320] [2023-08-26 18:58:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:19,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:19,554 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 18:58:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787434320] [2023-08-26 18:58:19,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787434320] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:58:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155447668] [2023-08-26 18:58:19,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:19,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:19,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:58:19,557 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 18:58:19,559 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 18:58:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:19,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 18:58:19,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:58:19,646 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 18:58:19,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:58:19,658 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 18:58:19,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155447668] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:58:19,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:58:19,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 18:58:19,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311605872] [2023-08-26 18:58:19,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:58:19,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:58:19,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:19,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:58:19,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:58:19,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 576 [2023-08-26 18:58:19,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 242.28571428571428) internal successors, (1696), 7 states have internal predecessors, (1696), 0 states have call successors, (0), 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 18:58:19,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:19,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 576 [2023-08-26 18:58:19,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:19,910 INFO L124 PetriNetUnfolderBase]: 1080/2367 cut-off events. [2023-08-26 18:58:19,910 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:58:19,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4415 conditions, 2367 events. 1080/2367 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17185 event pairs, 920 based on Foata normal form. 0/1506 useless extension candidates. Maximal degree in co-relation 4403. Up to 2027 conditions per place. [2023-08-26 18:58:19,919 INFO L140 encePairwiseOnDemand]: 573/576 looper letters, 73 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2023-08-26 18:58:19,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 96 transitions, 372 flow [2023-08-26 18:58:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:58:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:58:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1527 transitions. [2023-08-26 18:58:19,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418402777777778 [2023-08-26 18:58:19,923 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1527 transitions. [2023-08-26 18:58:19,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1527 transitions. [2023-08-26 18:58:19,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:19,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1527 transitions. [2023-08-26 18:58:19,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 254.5) internal successors, (1527), 6 states have internal predecessors, (1527), 0 states have call successors, (0), 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 18:58:19,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 576.0) internal successors, (4032), 7 states have internal predecessors, (4032), 0 states have call successors, (0), 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 18:58:19,933 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 576.0) internal successors, (4032), 7 states have internal predecessors, (4032), 0 states have call successors, (0), 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 18:58:19,934 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 204 flow. Second operand 6 states and 1527 transitions. [2023-08-26 18:58:19,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 96 transitions, 372 flow [2023-08-26 18:58:19,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 368 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:58:19,942 INFO L231 Difference]: Finished difference. Result has 98 places, 96 transitions, 236 flow [2023-08-26 18:58:19,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=98, PETRI_TRANSITIONS=96} [2023-08-26 18:58:19,943 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2023-08-26 18:58:19,943 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 96 transitions, 236 flow [2023-08-26 18:58:19,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 242.28571428571428) internal successors, (1696), 7 states have internal predecessors, (1696), 0 states have call successors, (0), 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 18:58:19,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:19,946 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 18:58:19,954 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 18:58:20,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:20,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:20,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:20,152 INFO L85 PathProgramCache]: Analyzing trace with hash -927374287, now seen corresponding path program 2 times [2023-08-26 18:58:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:20,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784703463] [2023-08-26 18:58:20,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:20,254 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 18:58:20,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:20,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784703463] [2023-08-26 18:58:20,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784703463] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:58:20,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171328969] [2023-08-26 18:58:20,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 18:58:20,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:20,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:58:20,257 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 18:58:20,265 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 18:58:20,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 18:58:20,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:58:20,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 18:58:20,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:58:20,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:58:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:58:20,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 18:58:20,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171328969] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:58:20,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 18:58:20,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2023-08-26 18:58:20,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105788593] [2023-08-26 18:58:20,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:58:20,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:58:20,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:20,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:58:20,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:58:20,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 576 [2023-08-26 18:58:20,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 96 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 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 18:58:20,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:20,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 576 [2023-08-26 18:58:20,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:20,583 INFO L124 PetriNetUnfolderBase]: 1153/2459 cut-off events. [2023-08-26 18:58:20,584 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 18:58:20,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4735 conditions, 2459 events. 1153/2459 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 17736 event pairs, 0 based on Foata normal form. 0/1657 useless extension candidates. Maximal degree in co-relation 4701. Up to 2198 conditions per place. [2023-08-26 18:58:20,593 INFO L140 encePairwiseOnDemand]: 572/576 looper letters, 104 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2023-08-26 18:58:20,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 121 transitions, 498 flow [2023-08-26 18:58:20,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:58:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:58:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2023-08-26 18:58:20,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4056712962962963 [2023-08-26 18:58:20,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 701 transitions. [2023-08-26 18:58:20,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 701 transitions. [2023-08-26 18:58:20,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:20,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 701 transitions. [2023-08-26 18:58:20,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 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 18:58:20,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 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 18:58:20,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 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 18:58:20,600 INFO L175 Difference]: Start difference. First operand has 98 places, 96 transitions, 236 flow. Second operand 3 states and 701 transitions. [2023-08-26 18:58:20,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 121 transitions, 498 flow [2023-08-26 18:58:20,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 121 transitions, 484 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 18:58:20,606 INFO L231 Difference]: Finished difference. Result has 100 places, 96 transitions, 232 flow [2023-08-26 18:58:20,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=100, PETRI_TRANSITIONS=96} [2023-08-26 18:58:20,607 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 2 predicate places. [2023-08-26 18:58:20,607 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 96 transitions, 232 flow [2023-08-26 18:58:20,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 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 18:58:20,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:20,607 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 18:58:20,612 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 18:58:20,812 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,SelfDestructingSolverStorable2 [2023-08-26 18:58:20,812 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:20,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:20,813 INFO L85 PathProgramCache]: Analyzing trace with hash -927374288, now seen corresponding path program 1 times [2023-08-26 18:58:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:20,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891102602] [2023-08-26 18:58:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:20,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:58:20,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:20,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891102602] [2023-08-26 18:58:20,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891102602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:58:20,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:58:20,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:58:20,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492962504] [2023-08-26 18:58:20,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:58:20,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:58:20,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:20,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:58:20,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:58:20,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 576 [2023-08-26 18:58:20,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 96 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 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 18:58:20,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:20,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 576 [2023-08-26 18:58:20,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:21,066 INFO L124 PetriNetUnfolderBase]: 1245/2513 cut-off events. [2023-08-26 18:58:21,066 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-08-26 18:58:21,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4953 conditions, 2513 events. 1245/2513 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17118 event pairs, 1056 based on Foata normal form. 0/1656 useless extension candidates. Maximal degree in co-relation 4924. Up to 2257 conditions per place. [2023-08-26 18:58:21,076 INFO L140 encePairwiseOnDemand]: 572/576 looper letters, 103 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2023-08-26 18:58:21,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 119 transitions, 490 flow [2023-08-26 18:58:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:58:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:58:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2023-08-26 18:58:21,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41435185185185186 [2023-08-26 18:58:21,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 716 transitions. [2023-08-26 18:58:21,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 716 transitions. [2023-08-26 18:58:21,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:21,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 716 transitions. [2023-08-26 18:58:21,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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 18:58:21,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 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 18:58:21,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 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 18:58:21,083 INFO L175 Difference]: Start difference. First operand has 100 places, 96 transitions, 232 flow. Second operand 3 states and 716 transitions. [2023-08-26 18:58:21,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 119 transitions, 490 flow [2023-08-26 18:58:21,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 119 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:58:21,089 INFO L231 Difference]: Finished difference. Result has 98 places, 94 transitions, 228 flow [2023-08-26 18:58:21,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=98, PETRI_TRANSITIONS=94} [2023-08-26 18:58:21,090 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2023-08-26 18:58:21,090 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 228 flow [2023-08-26 18:58:21,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 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 18:58:21,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:21,091 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-26 18:58:21,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:58:21,092 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:21,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:21,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2118037792, now seen corresponding path program 1 times [2023-08-26 18:58:21,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:21,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096146936] [2023-08-26 18:58:21,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:21,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:58:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:21,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096146936] [2023-08-26 18:58:21,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096146936] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:58:21,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271998333] [2023-08-26 18:58:21,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:21,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:21,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:58:21,178 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 18:58:21,180 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 18:58:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:21,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 18:58:21,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:58:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:58:21,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:58:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 18:58:21,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271998333] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:58:21,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:58:21,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 18:58:21,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778131729] [2023-08-26 18:58:21,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:58:21,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 18:58:21,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:21,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 18:58:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 18:58:21,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 576 [2023-08-26 18:58:21,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 228 flow. Second operand has 13 states, 13 states have (on average 242.3846153846154) internal successors, (3151), 13 states have internal predecessors, (3151), 0 states have call successors, (0), 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 18:58:21,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:21,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 576 [2023-08-26 18:58:21,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:21,463 INFO L124 PetriNetUnfolderBase]: 1030/2199 cut-off events. [2023-08-26 18:58:21,464 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2023-08-26 18:58:21,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4233 conditions, 2199 events. 1030/2199 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15584 event pairs, 880 based on Foata normal form. 6/1501 useless extension candidates. Maximal degree in co-relation 4180. Up to 1901 conditions per place. [2023-08-26 18:58:21,472 INFO L140 encePairwiseOnDemand]: 573/576 looper letters, 71 selfloop transitions, 11 changer transitions 0/100 dead transitions. [2023-08-26 18:58:21,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 100 transitions, 428 flow [2023-08-26 18:58:21,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:58:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:58:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2980 transitions. [2023-08-26 18:58:21,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43113425925925924 [2023-08-26 18:58:21,477 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2980 transitions. [2023-08-26 18:58:21,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2980 transitions. [2023-08-26 18:58:21,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:21,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2980 transitions. [2023-08-26 18:58:21,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 248.33333333333334) internal successors, (2980), 12 states have internal predecessors, (2980), 0 states have call successors, (0), 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 18:58:21,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 576.0) internal successors, (7488), 13 states have internal predecessors, (7488), 0 states have call successors, (0), 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 18:58:21,489 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 576.0) internal successors, (7488), 13 states have internal predecessors, (7488), 0 states have call successors, (0), 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 18:58:21,489 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 228 flow. Second operand 12 states and 2980 transitions. [2023-08-26 18:58:21,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 100 transitions, 428 flow [2023-08-26 18:58:21,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 100 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:58:21,491 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 308 flow [2023-08-26 18:58:21,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=308, PETRI_PLACES=113, PETRI_TRANSITIONS=100} [2023-08-26 18:58:21,492 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2023-08-26 18:58:21,492 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 308 flow [2023-08-26 18:58:21,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 242.3846153846154) internal successors, (3151), 13 states have internal predecessors, (3151), 0 states have call successors, (0), 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 18:58:21,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:21,493 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-26 18:58:21,500 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 18:58:21,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:21,698 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:21,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1231015392, now seen corresponding path program 2 times [2023-08-26 18:58:21,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:21,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013119420] [2023-08-26 18:58:21,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:21,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:21,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:21,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013119420] [2023-08-26 18:58:21,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013119420] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:58:21,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672926681] [2023-08-26 18:58:21,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 18:58:21,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:21,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:58:21,821 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 18:58:21,823 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 18:58:21,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 18:58:21,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:58:21,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-26 18:58:21,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:58:21,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:58:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:21,941 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 18:58:21,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672926681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:58:21,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 18:58:21,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-26 18:58:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796759156] [2023-08-26 18:58:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:58:21,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:58:21,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:21,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:58:21,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:58:21,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 576 [2023-08-26 18:58:21,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 200.75) internal successors, (803), 4 states have internal predecessors, (803), 0 states have call successors, (0), 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 18:58:21,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:21,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 576 [2023-08-26 18:58:21,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:22,162 INFO L124 PetriNetUnfolderBase]: 1084/2325 cut-off events. [2023-08-26 18:58:22,162 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-08-26 18:58:22,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4550 conditions, 2325 events. 1084/2325 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16592 event pairs, 0 based on Foata normal form. 0/1641 useless extension candidates. Maximal degree in co-relation 4473. Up to 1973 conditions per place. [2023-08-26 18:58:22,173 INFO L140 encePairwiseOnDemand]: 572/576 looper letters, 128 selfloop transitions, 3 changer transitions 0/146 dead transitions. [2023-08-26 18:58:22,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 146 transitions, 660 flow [2023-08-26 18:58:22,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:58:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:58:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 918 transitions. [2023-08-26 18:58:22,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2023-08-26 18:58:22,175 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 918 transitions. [2023-08-26 18:58:22,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 918 transitions. [2023-08-26 18:58:22,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:22,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 918 transitions. [2023-08-26 18:58:22,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 229.5) internal successors, (918), 4 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:58:22,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 576.0) internal successors, (2880), 5 states have internal predecessors, (2880), 0 states have call successors, (0), 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 18:58:22,179 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 576.0) internal successors, (2880), 5 states have internal predecessors, (2880), 0 states have call successors, (0), 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 18:58:22,179 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 308 flow. Second operand 4 states and 918 transitions. [2023-08-26 18:58:22,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 146 transitions, 660 flow [2023-08-26 18:58:22,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 146 transitions, 612 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 18:58:22,182 INFO L231 Difference]: Finished difference. Result has 110 places, 99 transitions, 262 flow [2023-08-26 18:58:22,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=110, PETRI_TRANSITIONS=99} [2023-08-26 18:58:22,183 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 12 predicate places. [2023-08-26 18:58:22,183 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 99 transitions, 262 flow [2023-08-26 18:58:22,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 200.75) internal successors, (803), 4 states have internal predecessors, (803), 0 states have call successors, (0), 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 18:58:22,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:22,183 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:58:22,188 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 18:58:22,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:22,388 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:22,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1891116979, now seen corresponding path program 1 times [2023-08-26 18:58:22,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:22,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817737410] [2023-08-26 18:58:22,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:22,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:22,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:22,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817737410] [2023-08-26 18:58:22,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817737410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:58:22,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:58:22,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:58:22,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736036974] [2023-08-26 18:58:22,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:58:22,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:58:22,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:22,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:58:22,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:58:22,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 576 [2023-08-26 18:58:22,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 99 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 173.28571428571428) internal successors, (1213), 7 states have internal predecessors, (1213), 0 states have call successors, (0), 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 18:58:22,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:22,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 576 [2023-08-26 18:58:22,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:23,144 INFO L124 PetriNetUnfolderBase]: 1939/3952 cut-off events. [2023-08-26 18:58:23,144 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2023-08-26 18:58:23,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7876 conditions, 3952 events. 1939/3952 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 29249 event pairs, 678 based on Foata normal form. 133/2903 useless extension candidates. Maximal degree in co-relation 7823. Up to 1907 conditions per place. [2023-08-26 18:58:23,161 INFO L140 encePairwiseOnDemand]: 560/576 looper letters, 252 selfloop transitions, 14 changer transitions 2/281 dead transitions. [2023-08-26 18:58:23,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 281 transitions, 1186 flow [2023-08-26 18:58:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:58:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:58:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2010 transitions. [2023-08-26 18:58:23,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2023-08-26 18:58:23,166 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2010 transitions. [2023-08-26 18:58:23,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2010 transitions. [2023-08-26 18:58:23,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:23,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2010 transitions. [2023-08-26 18:58:23,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 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 18:58:23,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 576.0) internal successors, (6336), 11 states have internal predecessors, (6336), 0 states have call successors, (0), 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 18:58:23,174 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 576.0) internal successors, (6336), 11 states have internal predecessors, (6336), 0 states have call successors, (0), 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 18:58:23,175 INFO L175 Difference]: Start difference. First operand has 110 places, 99 transitions, 262 flow. Second operand 10 states and 2010 transitions. [2023-08-26 18:58:23,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 281 transitions, 1186 flow [2023-08-26 18:58:23,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 281 transitions, 1163 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-26 18:58:23,178 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 328 flow [2023-08-26 18:58:23,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=328, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2023-08-26 18:58:23,178 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 16 predicate places. [2023-08-26 18:58:23,179 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 328 flow [2023-08-26 18:58:23,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 173.28571428571428) internal successors, (1213), 7 states have internal predecessors, (1213), 0 states have call successors, (0), 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 18:58:23,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:23,179 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:58:23,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:58:23,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:23,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1547525027, now seen corresponding path program 1 times [2023-08-26 18:58:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34514029] [2023-08-26 18:58:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:23,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:23,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:23,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34514029] [2023-08-26 18:58:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34514029] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:58:23,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211712414] [2023-08-26 18:58:23,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:23,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:23,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:58:23,215 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 18:58:23,217 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 18:58:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:23,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 18:58:23,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:58:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:23,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:58:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:23,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211712414] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:58:23,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:58:23,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-26 18:58:23,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312503911] [2023-08-26 18:58:23,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:58:23,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:58:23,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:23,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:58:23,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:58:23,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 576 [2023-08-26 18:58:23,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 242.71428571428572) internal successors, (1699), 7 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:58:23,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:23,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 576 [2023-08-26 18:58:23,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:23,355 INFO L124 PetriNetUnfolderBase]: 86/252 cut-off events. [2023-08-26 18:58:23,356 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-08-26 18:58:23,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 252 events. 86/252 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 967 event pairs, 31 based on Foata normal form. 39/249 useless extension candidates. Maximal degree in co-relation 559. Up to 156 conditions per place. [2023-08-26 18:58:23,357 INFO L140 encePairwiseOnDemand]: 573/576 looper letters, 61 selfloop transitions, 2 changer transitions 2/73 dead transitions. [2023-08-26 18:58:23,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 400 flow [2023-08-26 18:58:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:58:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:58:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1010 transitions. [2023-08-26 18:58:23,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383680555555556 [2023-08-26 18:58:23,359 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1010 transitions. [2023-08-26 18:58:23,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1010 transitions. [2023-08-26 18:58:23,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:23,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1010 transitions. [2023-08-26 18:58:23,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 252.5) internal successors, (1010), 4 states have internal predecessors, (1010), 0 states have call successors, (0), 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 18:58:23,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 576.0) internal successors, (2880), 5 states have internal predecessors, (2880), 0 states have call successors, (0), 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 18:58:23,363 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 576.0) internal successors, (2880), 5 states have internal predecessors, (2880), 0 states have call successors, (0), 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 18:58:23,363 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 328 flow. Second operand 4 states and 1010 transitions. [2023-08-26 18:58:23,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 400 flow [2023-08-26 18:58:23,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 377 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-26 18:58:23,365 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 173 flow [2023-08-26 18:58:23,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2023-08-26 18:58:23,365 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -32 predicate places. [2023-08-26 18:58:23,366 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 173 flow [2023-08-26 18:58:23,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 242.71428571428572) internal successors, (1699), 7 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:58:23,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:23,366 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:58:23,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 18:58:23,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:23,571 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:23,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:23,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1504910047, now seen corresponding path program 1 times [2023-08-26 18:58:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:23,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326202308] [2023-08-26 18:58:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:23,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:23,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326202308] [2023-08-26 18:58:23,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326202308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:58:23,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:58:23,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:58:23,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192883296] [2023-08-26 18:58:23,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:58:23,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:58:23,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:23,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:58:23,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:58:23,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 576 [2023-08-26 18:58:23,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 184.5) internal successors, (1107), 6 states have internal predecessors, (1107), 0 states have call successors, (0), 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 18:58:23,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:23,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 576 [2023-08-26 18:58:23,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:23,702 INFO L124 PetriNetUnfolderBase]: 78/210 cut-off events. [2023-08-26 18:58:23,703 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-08-26 18:58:23,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 210 events. 78/210 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 626 event pairs, 2 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 495. Up to 168 conditions per place. [2023-08-26 18:58:23,703 INFO L140 encePairwiseOnDemand]: 569/576 looper letters, 38 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-26 18:58:23,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 44 transitions, 250 flow [2023-08-26 18:58:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:58:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:58:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 765 transitions. [2023-08-26 18:58:23,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33203125 [2023-08-26 18:58:23,706 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 765 transitions. [2023-08-26 18:58:23,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 765 transitions. [2023-08-26 18:58:23,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:23,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 765 transitions. [2023-08-26 18:58:23,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 191.25) internal successors, (765), 4 states have internal predecessors, (765), 0 states have call successors, (0), 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 18:58:23,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 576.0) internal successors, (2880), 5 states have internal predecessors, (2880), 0 states have call successors, (0), 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 18:58:23,709 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 576.0) internal successors, (2880), 5 states have internal predecessors, (2880), 0 states have call successors, (0), 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 18:58:23,709 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 173 flow. Second operand 4 states and 765 transitions. [2023-08-26 18:58:23,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 44 transitions, 250 flow [2023-08-26 18:58:23,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 44 transitions, 244 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:58:23,711 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 162 flow [2023-08-26 18:58:23,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2023-08-26 18:58:23,713 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -38 predicate places. [2023-08-26 18:58:23,713 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 162 flow [2023-08-26 18:58:23,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.5) internal successors, (1107), 6 states have internal predecessors, (1107), 0 states have call successors, (0), 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 18:58:23,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:23,714 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:58:23,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:58:23,714 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:23,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:23,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1504910266, now seen corresponding path program 1 times [2023-08-26 18:58:23,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:23,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702043720] [2023-08-26 18:58:23,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:23,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:23,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:23,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702043720] [2023-08-26 18:58:23,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702043720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:58:23,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:58:23,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:58:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705881457] [2023-08-26 18:58:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:58:23,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:58:23,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:23,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:58:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:58:23,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 576 [2023-08-26 18:58:23,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 177.5) internal successors, (1065), 6 states have internal predecessors, (1065), 0 states have call successors, (0), 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 18:58:23,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:23,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 576 [2023-08-26 18:58:23,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:23,936 INFO L124 PetriNetUnfolderBase]: 105/322 cut-off events. [2023-08-26 18:58:23,936 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-26 18:58:23,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 322 events. 105/322 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1308 event pairs, 2 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 768. Up to 131 conditions per place. [2023-08-26 18:58:23,937 INFO L140 encePairwiseOnDemand]: 569/576 looper letters, 62 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2023-08-26 18:58:23,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 418 flow [2023-08-26 18:58:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:58:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:58:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1114 transitions. [2023-08-26 18:58:23,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32233796296296297 [2023-08-26 18:58:23,940 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1114 transitions. [2023-08-26 18:58:23,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1114 transitions. [2023-08-26 18:58:23,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:23,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1114 transitions. [2023-08-26 18:58:23,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 185.66666666666666) internal successors, (1114), 6 states have internal predecessors, (1114), 0 states have call successors, (0), 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 18:58:23,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 576.0) internal successors, (4032), 7 states have internal predecessors, (4032), 0 states have call successors, (0), 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 18:58:23,945 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 576.0) internal successors, (4032), 7 states have internal predecessors, (4032), 0 states have call successors, (0), 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 18:58:23,945 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 162 flow. Second operand 6 states and 1114 transitions. [2023-08-26 18:58:23,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 418 flow [2023-08-26 18:58:23,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:58:23,946 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 239 flow [2023-08-26 18:58:23,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-08-26 18:58:23,947 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -32 predicate places. [2023-08-26 18:58:23,947 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 239 flow [2023-08-26 18:58:23,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 177.5) internal successors, (1065), 6 states have internal predecessors, (1065), 0 states have call successors, (0), 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 18:58:23,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:23,947 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:58:23,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:58:23,948 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:23,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:23,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1647105480, now seen corresponding path program 1 times [2023-08-26 18:58:23,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:23,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326206394] [2023-08-26 18:58:23,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:23,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:24,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:24,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326206394] [2023-08-26 18:58:24,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326206394] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:58:24,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508602800] [2023-08-26 18:58:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:24,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:24,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:58:24,102 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 18:58:24,105 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 18:58:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:24,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-26 18:58:24,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:58:24,200 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 7 treesize of output 6 [2023-08-26 18:58:24,250 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:58:24,251 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 18:58:24,266 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 13 treesize of output 15 [2023-08-26 18:58:24,310 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 13 treesize of output 15 [2023-08-26 18:58:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:24,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:58:30,346 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_334) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-26 18:58:32,355 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_334) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-26 18:58:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-26 18:58:32,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508602800] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:58:32,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:58:32,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-26 18:58:32,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977097327] [2023-08-26 18:58:32,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:58:32,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 18:58:32,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:32,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 18:58:32,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=80, Unknown=5, NotChecked=38, Total=156 [2023-08-26 18:58:32,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 576 [2023-08-26 18:58:32,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 239 flow. Second operand has 13 states, 13 states have (on average 178.3846153846154) internal successors, (2319), 13 states have internal predecessors, (2319), 0 states have call successors, (0), 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 18:58:32,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:32,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 576 [2023-08-26 18:58:32,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:36,624 INFO L124 PetriNetUnfolderBase]: 105/313 cut-off events. [2023-08-26 18:58:36,625 INFO L125 PetriNetUnfolderBase]: For 266/272 co-relation queries the response was YES. [2023-08-26 18:58:36,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 313 events. 105/313 cut-off events. For 266/272 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1219 event pairs, 16 based on Foata normal form. 2/301 useless extension candidates. Maximal degree in co-relation 914. Up to 131 conditions per place. [2023-08-26 18:58:36,626 INFO L140 encePairwiseOnDemand]: 569/576 looper letters, 56 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2023-08-26 18:58:36,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 432 flow [2023-08-26 18:58:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:58:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:58:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1103 transitions. [2023-08-26 18:58:36,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3191550925925926 [2023-08-26 18:58:36,629 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1103 transitions. [2023-08-26 18:58:36,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1103 transitions. [2023-08-26 18:58:36,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:36,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1103 transitions. [2023-08-26 18:58:36,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.83333333333334) internal successors, (1103), 6 states have internal predecessors, (1103), 0 states have call successors, (0), 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 18:58:36,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 576.0) internal successors, (4032), 7 states have internal predecessors, (4032), 0 states have call successors, (0), 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 18:58:36,634 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 576.0) internal successors, (4032), 7 states have internal predecessors, (4032), 0 states have call successors, (0), 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 18:58:36,634 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 239 flow. Second operand 6 states and 1103 transitions. [2023-08-26 18:58:36,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 432 flow [2023-08-26 18:58:36,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 68 transitions, 428 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:58:36,636 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 256 flow [2023-08-26 18:58:36,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-08-26 18:58:36,636 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -27 predicate places. [2023-08-26 18:58:36,636 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 256 flow [2023-08-26 18:58:36,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 178.3846153846154) internal successors, (2319), 13 states have internal predecessors, (2319), 0 states have call successors, (0), 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 18:58:36,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:36,637 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:58:36,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-26 18:58:36,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:36,842 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:36,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1415966378, now seen corresponding path program 1 times [2023-08-26 18:58:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:36,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268318731] [2023-08-26 18:58:36,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:37,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:37,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268318731] [2023-08-26 18:58:37,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268318731] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:58:37,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637430198] [2023-08-26 18:58:37,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:37,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:37,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:58:37,103 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:58:37,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 18:58:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:37,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-26 18:58:37,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:58:37,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:58:37,264 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-26 18:58:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:37,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:58:43,565 WARN L234 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 18:58:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637430198] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:58:43,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:58:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2023-08-26 18:58:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604798848] [2023-08-26 18:58:43,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:58:43,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-26 18:58:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-26 18:58:43,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-08-26 18:58:43,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 576 [2023-08-26 18:58:43,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 256 flow. Second operand has 19 states, 19 states have (on average 174.21052631578948) internal successors, (3310), 19 states have internal predecessors, (3310), 0 states have call successors, (0), 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 18:58:43,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:43,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 576 [2023-08-26 18:58:43,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:44,120 INFO L124 PetriNetUnfolderBase]: 262/763 cut-off events. [2023-08-26 18:58:44,120 INFO L125 PetriNetUnfolderBase]: For 651/653 co-relation queries the response was YES. [2023-08-26 18:58:44,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2330 conditions, 763 events. 262/763 cut-off events. For 651/653 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3540 event pairs, 44 based on Foata normal form. 54/784 useless extension candidates. Maximal degree in co-relation 2271. Up to 136 conditions per place. [2023-08-26 18:58:44,123 INFO L140 encePairwiseOnDemand]: 565/576 looper letters, 126 selfloop transitions, 21 changer transitions 0/151 dead transitions. [2023-08-26 18:58:44,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 151 transitions, 989 flow [2023-08-26 18:58:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:58:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:58:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2173 transitions. [2023-08-26 18:58:44,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31438078703703703 [2023-08-26 18:58:44,127 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2173 transitions. [2023-08-26 18:58:44,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2173 transitions. [2023-08-26 18:58:44,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:44,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2173 transitions. [2023-08-26 18:58:44,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 181.08333333333334) internal successors, (2173), 12 states have internal predecessors, (2173), 0 states have call successors, (0), 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 18:58:44,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 576.0) internal successors, (7488), 13 states have internal predecessors, (7488), 0 states have call successors, (0), 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 18:58:44,137 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 576.0) internal successors, (7488), 13 states have internal predecessors, (7488), 0 states have call successors, (0), 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 18:58:44,137 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 256 flow. Second operand 12 states and 2173 transitions. [2023-08-26 18:58:44,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 151 transitions, 989 flow [2023-08-26 18:58:44,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 151 transitions, 950 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:58:44,140 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 407 flow [2023-08-26 18:58:44,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=407, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2023-08-26 18:58:44,140 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -17 predicate places. [2023-08-26 18:58:44,140 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 407 flow [2023-08-26 18:58:44,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 174.21052631578948) internal successors, (3310), 19 states have internal predecessors, (3310), 0 states have call successors, (0), 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 18:58:44,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:44,141 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:58:44,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-26 18:58:44,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:44,350 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:58:44,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:44,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1570680796, now seen corresponding path program 1 times [2023-08-26 18:58:44,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:44,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266532878] [2023-08-26 18:58:44,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:44,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:44,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266532878] [2023-08-26 18:58:44,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266532878] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:58:44,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032669667] [2023-08-26 18:58:44,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:44,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:44,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:58:44,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:58:44,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 18:58:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:44,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-26 18:58:44,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:58:44,846 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 7 treesize of output 6 [2023-08-26 18:58:44,890 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:58:44,890 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 18:58:44,904 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 13 treesize of output 15 [2023-08-26 18:58:44,962 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 24 treesize of output 17 [2023-08-26 18:58:45,019 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 25 [2023-08-26 18:58:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 18:58:45,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:59:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 18:59:03,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032669667] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:59:03,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:59:03,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-08-26 18:59:03,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668859535] [2023-08-26 18:59:03,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:59:03,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-26 18:59:03,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-26 18:59:03,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=371, Unknown=7, NotChecked=0, Total=462 [2023-08-26 18:59:03,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 576 [2023-08-26 18:59:03,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 407 flow. Second operand has 22 states, 22 states have (on average 168.54545454545453) internal successors, (3708), 22 states have internal predecessors, (3708), 0 states have call successors, (0), 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 18:59:03,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:03,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 576 [2023-08-26 18:59:03,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:03,705 INFO L124 PetriNetUnfolderBase]: 258/846 cut-off events. [2023-08-26 18:59:03,706 INFO L125 PetriNetUnfolderBase]: For 1086/1096 co-relation queries the response was YES. [2023-08-26 18:59:03,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2728 conditions, 846 events. 258/846 cut-off events. For 1086/1096 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4394 event pairs, 28 based on Foata normal form. 12/816 useless extension candidates. Maximal degree in co-relation 2665. Up to 219 conditions per place. [2023-08-26 18:59:03,709 INFO L140 encePairwiseOnDemand]: 565/576 looper letters, 99 selfloop transitions, 24 changer transitions 0/127 dead transitions. [2023-08-26 18:59:03,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 127 transitions, 1025 flow [2023-08-26 18:59:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:59:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:59:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2062 transitions. [2023-08-26 18:59:03,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29832175925925924 [2023-08-26 18:59:03,716 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2062 transitions. [2023-08-26 18:59:03,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2062 transitions. [2023-08-26 18:59:03,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:03,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2062 transitions. [2023-08-26 18:59:03,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 171.83333333333334) internal successors, (2062), 12 states have internal predecessors, (2062), 0 states have call successors, (0), 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 18:59:03,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 576.0) internal successors, (7488), 13 states have internal predecessors, (7488), 0 states have call successors, (0), 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 18:59:03,725 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 576.0) internal successors, (7488), 13 states have internal predecessors, (7488), 0 states have call successors, (0), 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 18:59:03,725 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 407 flow. Second operand 12 states and 2062 transitions. [2023-08-26 18:59:03,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 127 transitions, 1025 flow [2023-08-26 18:59:03,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 127 transitions, 947 flow, removed 28 selfloop flow, removed 6 redundant places. [2023-08-26 18:59:03,730 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 582 flow [2023-08-26 18:59:03,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=582, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2023-08-26 18:59:03,730 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -5 predicate places. [2023-08-26 18:59:03,731 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 582 flow [2023-08-26 18:59:03,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 168.54545454545453) internal successors, (3708), 22 states have internal predecessors, (3708), 0 states have call successors, (0), 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 18:59:03,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:03,731 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:59:03,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 18:59:03,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-26 18:59:03,936 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:59:03,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash 607192492, now seen corresponding path program 1 times [2023-08-26 18:59:03,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:03,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864350923] [2023-08-26 18:59:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:03,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:59:04,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:04,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864350923] [2023-08-26 18:59:04,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864350923] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:59:04,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760637739] [2023-08-26 18:59:04,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:04,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:59:04,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:59:04,305 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:59:04,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 18:59:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:04,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 18:59:04,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:59:04,415 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 7 treesize of output 6 [2023-08-26 18:59:04,455 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:59:04,456 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 18:59:04,460 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 13 treesize of output 15 [2023-08-26 18:59:04,527 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 18 treesize of output 13 [2023-08-26 18:59:04,568 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 18:59:04,601 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 21 treesize of output 16 [2023-08-26 18:59:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:59:07,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:59:15,293 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 18:59:17,309 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_606 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_606)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|) 0))) is different from false [2023-08-26 18:59:17,323 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_604))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_606))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|) 0))) is different from false [2023-08-26 18:59:17,340 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_602 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_602)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_604))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_606))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|) 0))) is different from false [2023-08-26 18:59:17,370 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_602 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| 28)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_602)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_604) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_606) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|) 0))) is different from false [2023-08-26 18:59:17,391 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 Int) (v_ArrVal_602 Int)) (or (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_601))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_602))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_604) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_606) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| 28)))) is different from false [2023-08-26 18:59:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-26 18:59:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760637739] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:59:17,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:59:17,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 21 [2023-08-26 18:59:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581483757] [2023-08-26 18:59:17,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:59:17,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-26 18:59:17,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:17,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-26 18:59:17,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=212, Unknown=12, NotChecked=210, Total=506 [2023-08-26 18:59:17,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 576 [2023-08-26 18:59:17,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 582 flow. Second operand has 23 states, 23 states have (on average 172.47826086956522) internal successors, (3967), 23 states have internal predecessors, (3967), 0 states have call successors, (0), 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 18:59:17,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:17,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 576 [2023-08-26 18:59:17,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:19,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:59:20,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:59:24,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:59:29,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:59:34,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:59:35,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:59:36,283 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] [2023-08-26 18:59:37,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:59:42,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:59:47,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:59:50,254 INFO L124 PetriNetUnfolderBase]: 375/1233 cut-off events. [2023-08-26 18:59:50,254 INFO L125 PetriNetUnfolderBase]: For 2162/2164 co-relation queries the response was YES. [2023-08-26 18:59:50,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4427 conditions, 1233 events. 375/1233 cut-off events. For 2162/2164 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7102 event pairs, 38 based on Foata normal form. 4/1187 useless extension candidates. Maximal degree in co-relation 4357. Up to 344 conditions per place. [2023-08-26 18:59:50,260 INFO L140 encePairwiseOnDemand]: 567/576 looper letters, 117 selfloop transitions, 45 changer transitions 0/166 dead transitions. [2023-08-26 18:59:50,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 166 transitions, 1431 flow [2023-08-26 18:59:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:59:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:59:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1949 transitions. [2023-08-26 18:59:50,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30760732323232326 [2023-08-26 18:59:50,264 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1949 transitions. [2023-08-26 18:59:50,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1949 transitions. [2023-08-26 18:59:50,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:50,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1949 transitions. [2023-08-26 18:59:50,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 177.1818181818182) internal successors, (1949), 11 states have internal predecessors, (1949), 0 states have call successors, (0), 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 18:59:50,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 576.0) internal successors, (6912), 12 states have internal predecessors, (6912), 0 states have call successors, (0), 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 18:59:50,274 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 576.0) internal successors, (6912), 12 states have internal predecessors, (6912), 0 states have call successors, (0), 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 18:59:50,274 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 582 flow. Second operand 11 states and 1949 transitions. [2023-08-26 18:59:50,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 166 transitions, 1431 flow [2023-08-26 18:59:50,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 166 transitions, 1378 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-08-26 18:59:50,286 INFO L231 Difference]: Finished difference. Result has 107 places, 115 transitions, 1020 flow [2023-08-26 18:59:50,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1020, PETRI_PLACES=107, PETRI_TRANSITIONS=115} [2023-08-26 18:59:50,287 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 9 predicate places. [2023-08-26 18:59:50,287 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 115 transitions, 1020 flow [2023-08-26 18:59:50,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 172.47826086956522) internal successors, (3967), 23 states have internal predecessors, (3967), 0 states have call successors, (0), 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 18:59:50,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:50,288 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:59:50,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 18:59:50,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-26 18:59:50,494 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 18:59:50,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:50,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1436394018, now seen corresponding path program 2 times [2023-08-26 18:59:50,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:50,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521607430] [2023-08-26 18:59:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:50,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:59:50,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:50,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521607430] [2023-08-26 18:59:50,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521607430] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:59:50,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143992990] [2023-08-26 18:59:50,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 18:59:50,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:59:50,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:59:50,816 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:59:50,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 18:59:50,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 18:59:50,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:59:50,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-26 18:59:50,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:59:50,931 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 7 treesize of output 6 [2023-08-26 18:59:50,975 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:59:50,975 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 18:59:50,990 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 13 treesize of output 15 [2023-08-26 18:59:51,064 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 24 treesize of output 17 [2023-08-26 18:59:51,120 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 25 [2023-08-26 18:59:51,160 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 13 treesize of output 15 [2023-08-26 18:59:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 18:59:51,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:59:59,199 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_707 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-26 18:59:59,203 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_707 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-26 18:59:59,211 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96| Int) (v_ArrVal_707 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96|) 0)) is different from false [2023-08-26 18:59:59,215 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96| Int) (v_ArrVal_707 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96|) 0)) is different from false [2023-08-26 19:00:01,231 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96| Int) (v_ArrVal_707 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96|) 0)) is different from false [2023-08-26 19:00:01,236 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96| Int) (v_ArrVal_707 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96|) 0)) is different from false [2023-08-26 19:00:03,245 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96| Int) (v_ArrVal_707 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96|) 0)) is different from false [2023-08-26 19:00:03,265 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96| Int) (v_ArrVal_707 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_702))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_96|) 0)) is different from false [2023-08-26 19:00:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-26 19:00:03,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143992990] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:00:03,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:00:03,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 24 [2023-08-26 19:00:03,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154239330] [2023-08-26 19:00:03,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:00:03,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-26 19:00:03,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:03,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-26 19:00:03,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=242, Unknown=11, NotChecked=312, Total=650 [2023-08-26 19:00:03,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 576 [2023-08-26 19:00:03,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 115 transitions, 1020 flow. Second operand has 26 states, 26 states have (on average 168.46153846153845) internal successors, (4380), 26 states have internal predecessors, (4380), 0 states have call successors, (0), 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 19:00:03,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:03,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 576 [2023-08-26 19:00:03,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:04,044 INFO L124 PetriNetUnfolderBase]: 408/1591 cut-off events. [2023-08-26 19:00:04,044 INFO L125 PetriNetUnfolderBase]: For 3991/4001 co-relation queries the response was YES. [2023-08-26 19:00:04,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6121 conditions, 1591 events. 408/1591 cut-off events. For 3991/4001 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 10554 event pairs, 67 based on Foata normal form. 7/1531 useless extension candidates. Maximal degree in co-relation 6044. Up to 752 conditions per place. [2023-08-26 19:00:04,053 INFO L140 encePairwiseOnDemand]: 564/576 looper letters, 155 selfloop transitions, 60 changer transitions 0/219 dead transitions. [2023-08-26 19:00:04,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 219 transitions, 2306 flow [2023-08-26 19:00:04,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 19:00:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 19:00:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2400 transitions. [2023-08-26 19:00:04,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2976190476190476 [2023-08-26 19:00:04,058 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2400 transitions. [2023-08-26 19:00:04,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2400 transitions. [2023-08-26 19:00:04,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:04,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2400 transitions. [2023-08-26 19:00:04,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 171.42857142857142) internal successors, (2400), 14 states have internal predecessors, (2400), 0 states have call successors, (0), 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 19:00:04,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 576.0) internal successors, (8640), 15 states have internal predecessors, (8640), 0 states have call successors, (0), 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 19:00:04,067 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 576.0) internal successors, (8640), 15 states have internal predecessors, (8640), 0 states have call successors, (0), 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 19:00:04,067 INFO L175 Difference]: Start difference. First operand has 107 places, 115 transitions, 1020 flow. Second operand 14 states and 2400 transitions. [2023-08-26 19:00:04,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 219 transitions, 2306 flow [2023-08-26 19:00:04,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 219 transitions, 2239 flow, removed 25 selfloop flow, removed 3 redundant places. [2023-08-26 19:00:04,083 INFO L231 Difference]: Finished difference. Result has 127 places, 165 transitions, 1739 flow [2023-08-26 19:00:04,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1739, PETRI_PLACES=127, PETRI_TRANSITIONS=165} [2023-08-26 19:00:04,084 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 29 predicate places. [2023-08-26 19:00:04,084 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 165 transitions, 1739 flow [2023-08-26 19:00:04,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 168.46153846153845) internal successors, (4380), 26 states have internal predecessors, (4380), 0 states have call successors, (0), 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 19:00:04,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:04,085 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-08-26 19:00:04,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 19:00:04,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-26 19:00:04,292 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:04,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1863346367, now seen corresponding path program 2 times [2023-08-26 19:00:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889397498] [2023-08-26 19:00:04,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:00:04,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:04,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889397498] [2023-08-26 19:00:04,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889397498] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:00:04,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982648274] [2023-08-26 19:00:04,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:00:04,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:04,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:00:04,632 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:00:04,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-26 19:00:04,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:00:04,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:00:04,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 19:00:04,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:00:04,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:00:04,841 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-26 19:00:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:00:05,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:00:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:00:07,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982648274] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:00:07,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:00:07,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2023-08-26 19:00:07,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529202241] [2023-08-26 19:00:07,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:00:07,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-26 19:00:07,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:07,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-26 19:00:07,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2023-08-26 19:00:07,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 576 [2023-08-26 19:00:07,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 165 transitions, 1739 flow. Second operand has 29 states, 29 states have (on average 175.0) internal successors, (5075), 29 states have internal predecessors, (5075), 0 states have call successors, (0), 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 19:00:07,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:07,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 576 [2023-08-26 19:00:07,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:08,566 INFO L124 PetriNetUnfolderBase]: 503/1952 cut-off events. [2023-08-26 19:00:08,566 INFO L125 PetriNetUnfolderBase]: For 8020/8022 co-relation queries the response was YES. [2023-08-26 19:00:08,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8801 conditions, 1952 events. 503/1952 cut-off events. For 8020/8022 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13307 event pairs, 58 based on Foata normal form. 64/1938 useless extension candidates. Maximal degree in co-relation 8714. Up to 350 conditions per place. [2023-08-26 19:00:08,575 INFO L140 encePairwiseOnDemand]: 569/576 looper letters, 227 selfloop transitions, 38 changer transitions 201/470 dead transitions. [2023-08-26 19:00:08,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 470 transitions, 5737 flow [2023-08-26 19:00:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 19:00:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 19:00:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2353 transitions. [2023-08-26 19:00:08,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3142361111111111 [2023-08-26 19:00:08,578 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2353 transitions. [2023-08-26 19:00:08,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2353 transitions. [2023-08-26 19:00:08,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:08,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2353 transitions. [2023-08-26 19:00:08,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 181.0) internal successors, (2353), 13 states have internal predecessors, (2353), 0 states have call successors, (0), 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 19:00:08,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 576.0) internal successors, (8064), 14 states have internal predecessors, (8064), 0 states have call successors, (0), 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 19:00:08,585 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 576.0) internal successors, (8064), 14 states have internal predecessors, (8064), 0 states have call successors, (0), 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 19:00:08,585 INFO L175 Difference]: Start difference. First operand has 127 places, 165 transitions, 1739 flow. Second operand 13 states and 2353 transitions. [2023-08-26 19:00:08,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 470 transitions, 5737 flow [2023-08-26 19:00:08,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 470 transitions, 5650 flow, removed 23 selfloop flow, removed 6 redundant places. [2023-08-26 19:00:08,614 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 1392 flow [2023-08-26 19:00:08,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1392, PETRI_PLACES=132, PETRI_TRANSITIONS=128} [2023-08-26 19:00:08,614 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 34 predicate places. [2023-08-26 19:00:08,614 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 1392 flow [2023-08-26 19:00:08,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 175.0) internal successors, (5075), 29 states have internal predecessors, (5075), 0 states have call successors, (0), 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 19:00:08,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:08,615 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:00:08,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-26 19:00:08,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-26 19:00:08,820 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:08,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1057477830, now seen corresponding path program 3 times [2023-08-26 19:00:08,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:08,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524677319] [2023-08-26 19:00:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:08,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:00:10,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:10,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524677319] [2023-08-26 19:00:10,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524677319] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:00:10,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833960645] [2023-08-26 19:00:10,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 19:00:10,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:00:10,860 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:00:10,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-26 19:00:11,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 19:00:11,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:00:11,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-26 19:00:11,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:00:11,073 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 7 treesize of output 6 [2023-08-26 19:00:11,120 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:00:11,120 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 19:00:11,126 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 13 treesize of output 15 [2023-08-26 19:00:11,196 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 18 treesize of output 13 [2023-08-26 19:00:11,255 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 21 treesize of output 16 [2023-08-26 19:00:14,494 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 19:00:15,602 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 21 treesize of output 16 [2023-08-26 19:00:17,976 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 24 treesize of output 19 [2023-08-26 19:00:44,906 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 24 treesize of output 19 [2023-08-26 19:00:54,492 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 27 treesize of output 22 [2023-08-26 19:01:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:01:30,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:01:50,975 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0))) is different from false [2023-08-26 19:01:52,992 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (v_ArrVal_1002 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1002)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 19:01:55,036 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_1002 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_1002) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|)))) is different from false [2023-08-26 19:02:27,328 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (|v_t_funThread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_1002 Int) (v_ArrVal_999 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_81| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_81| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_999)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_1002) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|)))) is different from false [2023-08-26 19:02:27,387 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (|v_t_funThread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_1002 Int) (v_ArrVal_999 Int) (v_ArrVal_995 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_81| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_81| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (store (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_995))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_999))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_1002) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|)))) is different from false [2023-08-26 19:02:27,474 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (|v_t_funThread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_1002 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110| Int) (v_ArrVal_999 Int) (v_ArrVal_995 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_81| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_81| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_995) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110| v_ArrVal_999) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_1002) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|)))) is different from false [2023-08-26 19:02:29,498 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (|v_t_funThread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_1002 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110| Int) (v_ArrVal_999 Int) (v_ArrVal_995 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_81| 28))) (let ((.cse1 (+ .cse0 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_81| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_995) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110| v_ArrVal_999) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_1002) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0) (< .cse1 (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110|)) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|))))) is different from false [2023-08-26 19:02:31,547 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_994 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (|v_t_funThread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_1002 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110| Int) (v_ArrVal_999 Int) (v_ArrVal_995 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_81| 28))) (let ((.cse1 (+ .cse0 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_81| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (store (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_995) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110| v_ArrVal_999) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_1002) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0) (< .cse1 (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110|)) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|))))) is different from false [2023-08-26 19:02:31,702 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_994 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_1002 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int) (v_ArrVal_999 Int) (v_ArrVal_995 (Array Int Int))) (or (= (select (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| v_ArrVal_994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_995) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110| v_ArrVal_999) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_1002) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ 84 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|)))) is different from false [2023-08-26 19:02:31,740 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_994 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_1002 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int) (v_ArrVal_990 (Array Int Int)) (v_ArrVal_999 Int) (v_ArrVal_995 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|)) (= (select (store (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_990))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| v_ArrVal_994))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_995) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_110| v_ArrVal_999) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_1002) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ 84 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|)))) is different from false [2023-08-26 19:02:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 46 not checked. [2023-08-26 19:02:31,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833960645] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:02:31,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:02:31,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 14] total 40 [2023-08-26 19:02:31,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079272207] [2023-08-26 19:02:31,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:02:31,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-08-26 19:02:31,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:02:31,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-08-26 19:02:31,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=760, Unknown=66, NotChecked=690, Total=1722 [2023-08-26 19:02:31,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 576 [2023-08-26 19:02:31,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 1392 flow. Second operand has 42 states, 42 states have (on average 172.92857142857142) internal successors, (7263), 42 states have internal predecessors, (7263), 0 states have call successors, (0), 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 19:02:31,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:02:31,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 576 [2023-08-26 19:02:31,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:02:33,987 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] [2023-08-26 19:02:36,026 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] [2023-08-26 19:02:38,032 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] [2023-08-26 19:02:40,043 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] [2023-08-26 19:02:42,081 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] [2023-08-26 19:02:44,108 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] [2023-08-26 19:02:46,113 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] [2023-08-26 19:02:48,122 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] [2023-08-26 19:02:49,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:02:51,277 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] [2023-08-26 19:02:53,289 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] [2023-08-26 19:02:55,300 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] [2023-08-26 19:02:57,306 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] [2023-08-26 19:03:07,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:09,770 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] [2023-08-26 19:03:11,782 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] [2023-08-26 19:03:13,787 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] [2023-08-26 19:03:15,799 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] [2023-08-26 19:03:26,236 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] [2023-08-26 19:03:28,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:30,258 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] [2023-08-26 19:03:32,263 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] [2023-08-26 19:03:34,271 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] [2023-08-26 19:03:35,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:37,480 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] [2023-08-26 19:03:39,491 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] [2023-08-26 19:03:41,496 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] [2023-08-26 19:03:43,500 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] [2023-08-26 19:03:44,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:46,591 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] [2023-08-26 19:03:48,599 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] [2023-08-26 19:03:50,606 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] [2023-08-26 19:03:52,613 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] [2023-08-26 19:03:53,791 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] [2023-08-26 19:03:55,795 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] [2023-08-26 19:03:56,855 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] [2023-08-26 19:03:57,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:59,968 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] [2023-08-26 19:04:01,979 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] [2023-08-26 19:04:03,992 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] [2023-08-26 19:04:06,000 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] [2023-08-26 19:04:08,007 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] [2023-08-26 19:04:09,071 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] [2023-08-26 19:04:28,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:04:30,163 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] [2023-08-26 19:04:31,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:04:32,313 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] [2023-08-26 19:04:34,316 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] [2023-08-26 19:04:36,321 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] [2023-08-26 19:04:38,335 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] [2023-08-26 19:04:40,341 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] [2023-08-26 19:04:42,346 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] [2023-08-26 19:04:43,513 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] [2023-08-26 19:05:01,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:05:03,301 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] [2023-08-26 19:05:04,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:05:05,612 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] [2023-08-26 19:05:07,617 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] [2023-08-26 19:05:09,625 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] [2023-08-26 19:05:11,636 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] [2023-08-26 19:05:13,641 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] [2023-08-26 19:05:15,647 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] [2023-08-26 19:05:16,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:05:17,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:05:19,927 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] [2023-08-26 19:05:21,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:05:22,255 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] [2023-08-26 19:05:24,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:05:26,269 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] [2023-08-26 19:05:28,279 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] [2023-08-26 19:05:30,284 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] [2023-08-26 19:05:32,288 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] [2023-08-26 19:05:33,456 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] [2023-08-26 19:05:47,624 WARN L234 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 62 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:05:48,725 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] [2023-08-26 19:05:50,733 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] [2023-08-26 19:05:51,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:05:52,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:05:54,855 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] [2023-08-26 19:05:56,860 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] [2023-08-26 19:05:58,879 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] [2023-08-26 19:06:00,885 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] [2023-08-26 19:06:02,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 [0] [2023-08-26 19:06:03,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:06:20,442 WARN L234 SmtUtils]: Spent 12.43s on a formula simplification. DAG size of input: 87 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:06:38,362 WARN L234 SmtUtils]: Spent 13.84s on a formula simplification. DAG size of input: 67 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:06:49,324 WARN L234 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 80 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:07:16,508 WARN L234 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 86 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:07:26,022 WARN L234 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:07:34,221 WARN L234 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 109 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:07:44,404 WARN L234 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 78 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:07:56,691 WARN L234 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 68 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:08:22,195 WARN L234 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 88 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:08:53,262 WARN L234 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 65 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:11:13,653 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_81| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_81| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_1002 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_81| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_1002) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|)))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (v_ArrVal_1002 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1002)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))))) is different from false [2023-08-26 19:11:15,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:11:17,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:11:52,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 [1] [2023-08-26 19:11:54,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:11:56,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:11:58,167 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 19:12:00,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:12:02,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:12:04,197 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 19:12:38,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-26 19:12:49,692 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:12:49,692 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 19:12:50,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-26 19:12:50,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10ASSERT_VIOLATIONASSERT (47 of 48 remaining) [2023-08-26 19:12:50,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-26 19:12:50,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 19:12:50,657 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 48 remaining) [2023-08-26 19:12:50,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10ASSERT_VIOLATIONASSERT (30 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONASSERT (21 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 48 remaining) [2023-08-26 19:12:50,659 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 48 remaining) [2023-08-26 19:12:50,660 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 48 remaining) [2023-08-26 19:12:50,660 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 48 remaining) [2023-08-26 19:12:50,660 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 48 remaining) [2023-08-26 19:12:50,660 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 48 remaining) [2023-08-26 19:12:50,660 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 48 remaining) [2023-08-26 19:12:50,660 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 48 remaining) [2023-08-26 19:12:50,660 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 48 remaining) [2023-08-26 19:12:50,660 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (10 of 48 remaining) [2023-08-26 19:12:50,660 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 48 remaining) [2023-08-26 19:12:50,660 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 48 remaining) [2023-08-26 19:12:50,675 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 48 remaining) [2023-08-26 19:12:50,675 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 48 remaining) [2023-08-26 19:12:50,675 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 48 remaining) [2023-08-26 19:12:50,675 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 48 remaining) [2023-08-26 19:12:50,675 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 48 remaining) [2023-08-26 19:12:50,675 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 48 remaining) [2023-08-26 19:12:50,675 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 48 remaining) [2023-08-26 19:12:50,675 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 48 remaining) [2023-08-26 19:12:50,676 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:12:50,679 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-26 19:12:50,681 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 19:12:50,681 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 19:12:50,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:12:50 BasicIcfg [2023-08-26 19:12:50,683 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 19:12:50,684 INFO L158 Benchmark]: Toolchain (without parser) took 876835.54ms. Allocated memory was 375.4MB in the beginning and 721.4MB in the end (delta: 346.0MB). Free memory was 349.6MB in the beginning and 684.8MB in the end (delta: -335.2MB). Peak memory consumption was 433.8MB. Max. memory is 16.0GB. [2023-08-26 19:12:50,684 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 375.4MB. Free memory is still 352.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:12:50,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.49ms. Allocated memory is still 375.4MB. Free memory was 349.6MB in the beginning and 319.9MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 19:12:50,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.33ms. Allocated memory is still 375.4MB. Free memory was 319.9MB in the beginning and 317.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 19:12:50,684 INFO L158 Benchmark]: Boogie Preprocessor took 42.45ms. Allocated memory is still 375.4MB. Free memory was 317.1MB in the beginning and 314.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:12:50,684 INFO L158 Benchmark]: RCFGBuilder took 574.37ms. Allocated memory is still 375.4MB. Free memory was 314.7MB in the beginning and 338.4MB in the end (delta: -23.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 19:12:50,684 INFO L158 Benchmark]: TraceAbstraction took 875664.67ms. Allocated memory was 375.4MB in the beginning and 721.4MB in the end (delta: 346.0MB). Free memory was 337.6MB in the beginning and 684.8MB in the end (delta: -347.2MB). Peak memory consumption was 419.1MB. Max. memory is 16.0GB. [2023-08-26 19:12:50,686 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.12ms. Allocated memory is still 375.4MB. Free memory is still 352.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 481.49ms. Allocated memory is still 375.4MB. Free memory was 349.6MB in the beginning and 319.9MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 67.33ms. Allocated memory is still 375.4MB. Free memory was 319.9MB in the beginning and 317.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.45ms. Allocated memory is still 375.4MB. Free memory was 317.1MB in the beginning and 314.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 574.37ms. Allocated memory is still 375.4MB. Free memory was 314.7MB in the beginning and 338.4MB in the end (delta: -23.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 875664.67ms. Allocated memory was 375.4MB in the beginning and 721.4MB in the end (delta: 346.0MB). Free memory was 337.6MB in the beginning and 684.8MB in the end (delta: -347.2MB). Peak memory consumption was 419.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 250 PlacesBefore, 98 PlacesAfterwards, 295 TransitionsBefore, 133 TransitionsAfterwards, 29050 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 206 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 34 ConcurrentYvCompositions, 10 ChoiceCompositions, 281 TotalNumberOfCompositions, 56905 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29220, independent: 28723, independent conditional: 0, independent unconditional: 28723, dependent: 497, dependent conditional: 0, dependent unconditional: 497, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15751, independent: 15615, independent conditional: 0, independent unconditional: 15615, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 29220, independent: 13108, independent conditional: 0, independent unconditional: 13108, dependent: 361, dependent conditional: 0, dependent unconditional: 361, unknown: 15751, unknown conditional: 0, unknown unconditional: 15751] , Statistics on independence cache: Total cache size (in pairs): 948, Positive cache size: 891, Positive conditional cache size: 0, Positive unconditional cache size: 891, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 known predicates. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 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 70 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 70 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 70 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 70 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 70 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 70 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 70 known predicates. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 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 70 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 70 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 70 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 70 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 70 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 70 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 317 locations, 49 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: 875.6s, OverallIterations: 17, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 660.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 126 mSolverCounterUnknown, 2902 SdHoareTripleChecker+Valid, 186.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2902 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 185.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3125 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4715 IncrementalHoareTripleChecker+Invalid, 8130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 4 mSDtfsCounter, 4715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 786 GetRequests, 461 SyntacticMatches, 35 SemanticMatches, 289 ConstructedPredicates, 27 IntricatePredicates, 4 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 660.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1739occurred in iteration=15, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 207.0s InterpolantComputationTime, 672 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 913 ConstructedInterpolants, 226 QuantifiedInterpolants, 25233 SizeOfPredicates, 72 NumberOfNonLiveVariables, 2692 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 39 InterpolantComputations, 7 PerfectInterpolantSequences, 1698/1984 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