/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_74-tricky_address1_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:59:13,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:59:13,371 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:59:13,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:59:13,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:59:13,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:59:13,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:59:13,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:59:13,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:59:13,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:59:13,412 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:59:13,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:59:13,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:59:13,413 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:59:13,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:59:13,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:59:13,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:59:13,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:59:13,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:59:13,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:59:13,415 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:59:13,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:59:13,415 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:59:13,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:59:13,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:59:13,416 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:59:13,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:59:13,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:59:13,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:59:13,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:59:13,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:59:13,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:59:13,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:59:13,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:59:13,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:59:13,419 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:59:13,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:59:13,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:59:13,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:59:13,742 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:59:13,742 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:59:13,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-26 18:59:14,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:59:15,138 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:59:15,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-26 18:59:15,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0246f4b2/466462fc6ec143ac8ea21a2d8f7b8d06/FLAGc90621504 [2023-08-26 18:59:15,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0246f4b2/466462fc6ec143ac8ea21a2d8f7b8d06 [2023-08-26 18:59:15,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:59:15,172 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:59:15,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:59:15,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:59:15,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:59:15,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:59:15" (1/1) ... [2023-08-26 18:59:15,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677caeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15, skipping insertion in model container [2023-08-26 18:59:15,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:59:15" (1/1) ... [2023-08-26 18:59:15,227 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:59:15,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:59:15,583 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:59:15,605 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 18:59:15,606 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 18:59:15,619 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-26 18:59:15,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:59:15,683 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:59:15,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15 WrapperNode [2023-08-26 18:59:15,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:59:15,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:59:15,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:59:15,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:59:15,690 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:59:15" (1/1) ... [2023-08-26 18:59:15,708 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:59:15" (1/1) ... [2023-08-26 18:59:15,733 INFO L138 Inliner]: procedures = 270, calls = 42, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 199 [2023-08-26 18:59:15,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:59:15,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:59:15,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:59:15,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:59:15,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15" (1/1) ... [2023-08-26 18:59:15,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15" (1/1) ... [2023-08-26 18:59:15,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15" (1/1) ... [2023-08-26 18:59:15,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15" (1/1) ... [2023-08-26 18:59:15,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15" (1/1) ... [2023-08-26 18:59:15,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15" (1/1) ... [2023-08-26 18:59:15,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15" (1/1) ... [2023-08-26 18:59:15,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15" (1/1) ... [2023-08-26 18:59:15,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:59:15,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:59:15,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:59:15,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:59:15,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15" (1/1) ... [2023-08-26 18:59:15,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:59:15,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:59:15,827 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:59:15,850 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:59:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:59:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:59:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:59:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:59:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 18:59:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:59:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 18:59:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 18:59:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:59:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:59:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:59:15,870 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:59:15,987 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:59:15,989 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:59:16,414 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:59:16,424 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:59:16,425 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-26 18:59:16,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:59:16 BoogieIcfgContainer [2023-08-26 18:59:16,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:59:16,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:59:16,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:59:16,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:59:16,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:59:15" (1/3) ... [2023-08-26 18:59:16,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758e57fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:59:16, skipping insertion in model container [2023-08-26 18:59:16,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:59:15" (2/3) ... [2023-08-26 18:59:16,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758e57fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:59:16, skipping insertion in model container [2023-08-26 18:59:16,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:59:16" (3/3) ... [2023-08-26 18:59:16,437 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2023-08-26 18:59:16,454 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:59:16,454 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-08-26 18:59:16,454 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:59:16,543 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 18:59:16,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 225 transitions, 458 flow [2023-08-26 18:59:16,666 INFO L124 PetriNetUnfolderBase]: 48/315 cut-off events. [2023-08-26 18:59:16,667 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-26 18:59:16,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 315 events. 48/315 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1244 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. [2023-08-26 18:59:16,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 225 transitions, 458 flow [2023-08-26 18:59:16,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 225 transitions, 458 flow [2023-08-26 18:59:16,694 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:59:16,711 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 225 transitions, 458 flow [2023-08-26 18:59:16,713 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 225 transitions, 458 flow [2023-08-26 18:59:16,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 225 transitions, 458 flow [2023-08-26 18:59:16,759 INFO L124 PetriNetUnfolderBase]: 48/315 cut-off events. [2023-08-26 18:59:16,760 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-26 18:59:16,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 315 events. 48/315 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1244 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. [2023-08-26 18:59:16,770 INFO L119 LiptonReduction]: Number of co-enabled transitions 15744 [2023-08-26 18:59:20,605 INFO L134 LiptonReduction]: Checked pairs total: 30675 [2023-08-26 18:59:20,605 INFO L136 LiptonReduction]: Total number of compositions: 218 [2023-08-26 18:59:20,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:59:20,624 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;@78150b53, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:59:20,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-08-26 18:59:20,634 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:59:20,635 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-08-26 18:59:20,635 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:59:20,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:20,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:59:20,636 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:59:20,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash 900569, now seen corresponding path program 1 times [2023-08-26 18:59:20,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:20,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208969774] [2023-08-26 18:59:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:20,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:20,856 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:59:20,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:20,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208969774] [2023-08-26 18:59:20,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208969774] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:59:20,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:59:20,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:59:20,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289235358] [2023-08-26 18:59:20,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:59:20,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:59:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:20,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:59:20,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:59:20,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 443 [2023-08-26 18:59:20,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 93 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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:20,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:20,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 443 [2023-08-26 18:59:20,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:21,138 INFO L124 PetriNetUnfolderBase]: 639/1403 cut-off events. [2023-08-26 18:59:21,138 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:59:21,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 1403 events. 639/1403 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8943 event pairs, 588 based on Foata normal form. 104/996 useless extension candidates. Maximal degree in co-relation 2589. Up to 1259 conditions per place. [2023-08-26 18:59:21,146 INFO L140 encePairwiseOnDemand]: 412/443 looper letters, 54 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-26 18:59:21,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 252 flow [2023-08-26 18:59:21,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:59:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:59:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2023-08-26 18:59:21,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47930775018811134 [2023-08-26 18:59:21,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 637 transitions. [2023-08-26 18:59:21,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 637 transitions. [2023-08-26 18:59:21,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:21,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 637 transitions. [2023-08-26 18:59:21,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 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:21,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 443.0) internal successors, (1772), 4 states have internal predecessors, (1772), 0 states have call successors, (0), 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:21,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 443.0) internal successors, (1772), 4 states have internal predecessors, (1772), 0 states have call successors, (0), 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:21,176 INFO L175 Difference]: Start difference. First operand has 70 places, 93 transitions, 194 flow. Second operand 3 states and 637 transitions. [2023-08-26 18:59:21,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 252 flow [2023-08-26 18:59:21,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:59:21,182 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 150 flow [2023-08-26 18:59:21,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-08-26 18:59:21,187 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2023-08-26 18:59:21,187 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 150 flow [2023-08-26 18:59:21,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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:21,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:21,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 18:59:21,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:59:21,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:59:21,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash 27890254, now seen corresponding path program 1 times [2023-08-26 18:59:21,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:21,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628877414] [2023-08-26 18:59:21,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:21,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:21,277 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:59:21,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:21,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628877414] [2023-08-26 18:59:21,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628877414] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:59:21,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224075317] [2023-08-26 18:59:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:21,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:59:21,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:59:21,281 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:59:21,286 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:59:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:21,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 18:59:21,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:59:21,382 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:59:21,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:59:21,409 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:59:21,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224075317] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:59:21,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:59:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 18:59:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506195516] [2023-08-26 18:59:21,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:59:21,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:59:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:59:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:59:21,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 443 [2023-08-26 18:59:21,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 185.16666666666666) internal successors, (1111), 6 states have internal predecessors, (1111), 0 states have call successors, (0), 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:21,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:21,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 443 [2023-08-26 18:59:21,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:21,690 INFO L124 PetriNetUnfolderBase]: 639/1406 cut-off events. [2023-08-26 18:59:21,690 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:59:21,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1406 events. 639/1406 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8943 event pairs, 588 based on Foata normal form. 0/895 useless extension candidates. Maximal degree in co-relation 2673. Up to 1259 conditions per place. [2023-08-26 18:59:21,697 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 54 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-08-26 18:59:21,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 280 flow [2023-08-26 18:59:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:59:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:59:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2023-08-26 18:59:21,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43867569601203915 [2023-08-26 18:59:21,701 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1166 transitions. [2023-08-26 18:59:21,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1166 transitions. [2023-08-26 18:59:21,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:21,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1166 transitions. [2023-08-26 18:59:21,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 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:21,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 443.0) internal successors, (3101), 7 states have internal predecessors, (3101), 0 states have call successors, (0), 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:21,711 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 443.0) internal successors, (3101), 7 states have internal predecessors, (3101), 0 states have call successors, (0), 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:21,711 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 150 flow. Second operand 6 states and 1166 transitions. [2023-08-26 18:59:21,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 280 flow [2023-08-26 18:59:21,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 276 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:59:21,713 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 182 flow [2023-08-26 18:59:21,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2023-08-26 18:59:21,715 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 4 predicate places. [2023-08-26 18:59:21,715 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 182 flow [2023-08-26 18:59:21,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.16666666666666) internal successors, (1111), 6 states have internal predecessors, (1111), 0 states have call successors, (0), 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:21,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:21,716 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 18:59:21,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-26 18:59:21,921 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:59:21,922 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:59:21,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1922675481, now seen corresponding path program 2 times [2023-08-26 18:59:21,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:21,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719126748] [2023-08-26 18:59:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:22,008 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:59:22,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:22,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719126748] [2023-08-26 18:59:22,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719126748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:59:22,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:59:22,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:59:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873382918] [2023-08-26 18:59:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:59:22,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:59:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:59:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:59:22,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 443 [2023-08-26 18:59:22,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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:22,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:22,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 443 [2023-08-26 18:59:22,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:22,199 INFO L124 PetriNetUnfolderBase]: 616/1350 cut-off events. [2023-08-26 18:59:22,199 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 18:59:22,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 1350 events. 616/1350 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8470 event pairs, 546 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 2564. Up to 1168 conditions per place. [2023-08-26 18:59:22,207 INFO L140 encePairwiseOnDemand]: 439/443 looper letters, 74 selfloop transitions, 2 changer transitions 3/88 dead transitions. [2023-08-26 18:59:22,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 88 transitions, 378 flow [2023-08-26 18:59:22,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:59:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:59:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2023-08-26 18:59:22,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4123401053423627 [2023-08-26 18:59:22,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 548 transitions. [2023-08-26 18:59:22,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 548 transitions. [2023-08-26 18:59:22,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:22,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 548 transitions. [2023-08-26 18:59:22,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 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:22,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 443.0) internal successors, (1772), 4 states have internal predecessors, (1772), 0 states have call successors, (0), 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:22,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 443.0) internal successors, (1772), 4 states have internal predecessors, (1772), 0 states have call successors, (0), 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:22,214 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 182 flow. Second operand 3 states and 548 transitions. [2023-08-26 18:59:22,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 88 transitions, 378 flow [2023-08-26 18:59:22,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 88 transitions, 364 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 18:59:22,217 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 168 flow [2023-08-26 18:59:22,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2023-08-26 18:59:22,218 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 3 predicate places. [2023-08-26 18:59:22,218 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 168 flow [2023-08-26 18:59:22,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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:22,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:22,219 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 18:59:22,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:59:22,219 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:59:22,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:22,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1922675482, now seen corresponding path program 1 times [2023-08-26 18:59:22,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:22,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302269070] [2023-08-26 18:59:22,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:22,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:22,323 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:59:22,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302269070] [2023-08-26 18:59:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302269070] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:59:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889864861] [2023-08-26 18:59:22,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:22,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:59:22,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:59:22,329 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:59:22,354 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:59:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:22,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 18:59:22,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:59:22,411 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:59:22,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:59:22,460 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:59:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889864861] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:59:22,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:59:22,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-26 18:59:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51487275] [2023-08-26 18:59:22,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:59:22,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 18:59:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:22,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 18:59:22,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-26 18:59:22,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 443 [2023-08-26 18:59:22,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 168 flow. Second operand has 12 states, 12 states have (on average 185.08333333333334) internal successors, (2221), 12 states have internal predecessors, (2221), 0 states have call successors, (0), 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:22,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:22,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 443 [2023-08-26 18:59:22,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:22,714 INFO L124 PetriNetUnfolderBase]: 595/1317 cut-off events. [2023-08-26 18:59:22,714 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-08-26 18:59:22,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2557 conditions, 1317 events. 595/1317 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8218 event pairs, 546 based on Foata normal form. 6/896 useless extension candidates. Maximal degree in co-relation 2505. Up to 1171 conditions per place. [2023-08-26 18:59:22,721 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 52 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2023-08-26 18:59:22,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 73 transitions, 330 flow [2023-08-26 18:59:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:59:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:59:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2277 transitions. [2023-08-26 18:59:22,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4283295711060948 [2023-08-26 18:59:22,728 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2277 transitions. [2023-08-26 18:59:22,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2277 transitions. [2023-08-26 18:59:22,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:22,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2277 transitions. [2023-08-26 18:59:22,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 189.75) internal successors, (2277), 12 states have internal predecessors, (2277), 0 states have call successors, (0), 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:22,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 443.0) internal successors, (5759), 13 states have internal predecessors, (5759), 0 states have call successors, (0), 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:22,747 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 443.0) internal successors, (5759), 13 states have internal predecessors, (5759), 0 states have call successors, (0), 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:22,747 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 168 flow. Second operand 12 states and 2277 transitions. [2023-08-26 18:59:22,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 73 transitions, 330 flow [2023-08-26 18:59:22,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 73 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:59:22,754 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 248 flow [2023-08-26 18:59:22,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=248, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2023-08-26 18:59:22,758 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 18 predicate places. [2023-08-26 18:59:22,758 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 248 flow [2023-08-26 18:59:22,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 185.08333333333334) internal successors, (2221), 12 states have internal predecessors, (2221), 0 states have call successors, (0), 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:22,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:22,759 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2023-08-26 18:59:22,767 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:59:22,964 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,SelfDestructingSolverStorable3 [2023-08-26 18:59:22,965 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:59:22,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash -512035078, now seen corresponding path program 2 times [2023-08-26 18:59:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:22,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703461514] [2023-08-26 18:59:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:23,107 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:59:23,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:23,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703461514] [2023-08-26 18:59:23,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703461514] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:59:23,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:59:23,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:59:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474070357] [2023-08-26 18:59:23,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:59:23,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:59:23,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:23,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:59:23,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:59:23,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 443 [2023-08-26 18:59:23,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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:23,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:23,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 443 [2023-08-26 18:59:23,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:23,304 INFO L124 PetriNetUnfolderBase]: 591/1295 cut-off events. [2023-08-26 18:59:23,304 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-26 18:59:23,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 1295 events. 591/1295 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9050 event pairs, 0 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 2508. Up to 1179 conditions per place. [2023-08-26 18:59:23,311 INFO L140 encePairwiseOnDemand]: 439/443 looper letters, 84 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2023-08-26 18:59:23,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 95 transitions, 464 flow [2023-08-26 18:59:23,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:59:23,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:59:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2023-08-26 18:59:23,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4018058690744921 [2023-08-26 18:59:23,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2023-08-26 18:59:23,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2023-08-26 18:59:23,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:23,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2023-08-26 18:59:23,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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:23,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 443.0) internal successors, (1772), 4 states have internal predecessors, (1772), 0 states have call successors, (0), 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:23,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 443.0) internal successors, (1772), 4 states have internal predecessors, (1772), 0 states have call successors, (0), 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:23,318 INFO L175 Difference]: Start difference. First operand has 88 places, 73 transitions, 248 flow. Second operand 3 states and 534 transitions. [2023-08-26 18:59:23,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 95 transitions, 464 flow [2023-08-26 18:59:23,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 95 transitions, 416 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 18:59:23,323 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 210 flow [2023-08-26 18:59:23,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2023-08-26 18:59:23,325 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 16 predicate places. [2023-08-26 18:59:23,325 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 210 flow [2023-08-26 18:59:23,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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:23,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:23,326 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-26 18:59:23,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:59:23,326 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:59:23,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:23,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1687521517, now seen corresponding path program 1 times [2023-08-26 18:59:23,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:23,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919098842] [2023-08-26 18:59:23,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:23,469 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:59:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919098842] [2023-08-26 18:59:23,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919098842] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:59:23,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263393518] [2023-08-26 18:59:23,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:23,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:59:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:59:23,471 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:59:23,494 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:59:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:23,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 18:59:23,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:59:23,590 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:59:23,638 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:59:23,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:59:23,689 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:59:23,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263393518] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:59:23,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:59:23,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-26 18:59:23,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529378354] [2023-08-26 18:59:23,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:59:23,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:59:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:23,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:59:23,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:59:23,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 443 [2023-08-26 18:59:23,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 210 flow. Second operand has 8 states, 8 states have (on average 154.125) internal successors, (1233), 8 states have internal predecessors, (1233), 0 states have call successors, (0), 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:23,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:23,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 443 [2023-08-26 18:59:23,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:23,805 INFO L124 PetriNetUnfolderBase]: 44/149 cut-off events. [2023-08-26 18:59:23,805 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-08-26 18:59:23,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 149 events. 44/149 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 600 event pairs, 0 based on Foata normal form. 22/149 useless extension candidates. Maximal degree in co-relation 326. Up to 86 conditions per place. [2023-08-26 18:59:23,806 INFO L140 encePairwiseOnDemand]: 439/443 looper letters, 47 selfloop transitions, 2 changer transitions 11/65 dead transitions. [2023-08-26 18:59:23,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 305 flow [2023-08-26 18:59:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:59:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:59:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 659 transitions. [2023-08-26 18:59:23,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3718961625282167 [2023-08-26 18:59:23,809 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 659 transitions. [2023-08-26 18:59:23,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 659 transitions. [2023-08-26 18:59:23,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:23,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 659 transitions. [2023-08-26 18:59:23,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 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:23,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 443.0) internal successors, (2215), 5 states have internal predecessors, (2215), 0 states have call successors, (0), 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:23,814 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 443.0) internal successors, (2215), 5 states have internal predecessors, (2215), 0 states have call successors, (0), 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:23,814 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 210 flow. Second operand 4 states and 659 transitions. [2023-08-26 18:59:23,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 305 flow [2023-08-26 18:59:23,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:59:23,816 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 129 flow [2023-08-26 18:59:23,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-08-26 18:59:23,819 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -12 predicate places. [2023-08-26 18:59:23,819 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 129 flow [2023-08-26 18:59:23,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 154.125) internal successors, (1233), 8 states have internal predecessors, (1233), 0 states have call successors, (0), 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:23,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:23,819 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:59:23,827 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:59:24,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:59:24,026 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:59:24,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:24,026 INFO L85 PathProgramCache]: Analyzing trace with hash 773596454, now seen corresponding path program 1 times [2023-08-26 18:59:24,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:24,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025881628] [2023-08-26 18:59:24,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:24,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:24,295 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:59:24,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:24,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025881628] [2023-08-26 18:59:24,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025881628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:59:24,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:59:24,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:59:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166640966] [2023-08-26 18:59:24,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:59:24,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:59:24,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:24,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:59:24,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:59:24,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 443 [2023-08-26 18:59:24,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 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:24,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:24,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 443 [2023-08-26 18:59:24,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:24,365 INFO L124 PetriNetUnfolderBase]: 27/95 cut-off events. [2023-08-26 18:59:24,365 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-08-26 18:59:24,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 95 events. 27/95 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 229 event pairs, 0 based on Foata normal form. 9/89 useless extension candidates. Maximal degree in co-relation 181. Up to 65 conditions per place. [2023-08-26 18:59:24,366 INFO L140 encePairwiseOnDemand]: 437/443 looper letters, 28 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-08-26 18:59:24,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 36 transitions, 191 flow [2023-08-26 18:59:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:59:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:59:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 719 transitions. [2023-08-26 18:59:24,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3246049661399549 [2023-08-26 18:59:24,369 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 719 transitions. [2023-08-26 18:59:24,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 719 transitions. [2023-08-26 18:59:24,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:24,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 719 transitions. [2023-08-26 18:59:24,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 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:24,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 443.0) internal successors, (2658), 6 states have internal predecessors, (2658), 0 states have call successors, (0), 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:24,374 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 443.0) internal successors, (2658), 6 states have internal predecessors, (2658), 0 states have call successors, (0), 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:24,375 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 129 flow. Second operand 5 states and 719 transitions. [2023-08-26 18:59:24,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 36 transitions, 191 flow [2023-08-26 18:59:24,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 36 transitions, 187 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:59:24,378 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 126 flow [2023-08-26 18:59:24,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-08-26 18:59:24,379 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -18 predicate places. [2023-08-26 18:59:24,379 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 126 flow [2023-08-26 18:59:24,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 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:24,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:24,379 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:59:24,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:59:24,381 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:59:24,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:24,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1788318087, now seen corresponding path program 1 times [2023-08-26 18:59:24,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:24,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646965401] [2023-08-26 18:59:24,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:24,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:24,540 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:59:24,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646965401] [2023-08-26 18:59:24,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646965401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:59:24,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:59:24,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:59:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604029833] [2023-08-26 18:59:24,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:59:24,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:59:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:24,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:59:24,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:59:24,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 443 [2023-08-26 18:59:24,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 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:24,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:24,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 443 [2023-08-26 18:59:24,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:24,589 INFO L124 PetriNetUnfolderBase]: 17/70 cut-off events. [2023-08-26 18:59:24,590 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-08-26 18:59:24,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 70 events. 17/70 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 0 based on Foata normal form. 3/70 useless extension candidates. Maximal degree in co-relation 129. Up to 40 conditions per place. [2023-08-26 18:59:24,590 INFO L140 encePairwiseOnDemand]: 436/443 looper letters, 19 selfloop transitions, 2 changer transitions 8/31 dead transitions. [2023-08-26 18:59:24,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 31 transitions, 173 flow [2023-08-26 18:59:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:59:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:59:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2023-08-26 18:59:24,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32562076749435664 [2023-08-26 18:59:24,593 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2023-08-26 18:59:24,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2023-08-26 18:59:24,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:24,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2023-08-26 18:59:24,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 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:24,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 443.0) internal successors, (2215), 5 states have internal predecessors, (2215), 0 states have call successors, (0), 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:24,597 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 443.0) internal successors, (2215), 5 states have internal predecessors, (2215), 0 states have call successors, (0), 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:24,597 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 126 flow. Second operand 4 states and 577 transitions. [2023-08-26 18:59:24,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 31 transitions, 173 flow [2023-08-26 18:59:24,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 31 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:59:24,599 INFO L231 Difference]: Finished difference. Result has 47 places, 21 transitions, 99 flow [2023-08-26 18:59:24,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=47, PETRI_TRANSITIONS=21} [2023-08-26 18:59:24,601 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2023-08-26 18:59:24,601 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 21 transitions, 99 flow [2023-08-26 18:59:24,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 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:24,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:24,603 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:59:24,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:59:24,603 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:59:24,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:24,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1788317884, now seen corresponding path program 1 times [2023-08-26 18:59:24,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:24,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756698971] [2023-08-26 18:59:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:24,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:24,804 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:59:24,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:24,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756698971] [2023-08-26 18:59:24,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756698971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:59:24,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:59:24,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:59:24,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296516805] [2023-08-26 18:59:24,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:59:24,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:59:24,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:24,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:59:24,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:59:24,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 443 [2023-08-26 18:59:24,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 21 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:59:24,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:24,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 443 [2023-08-26 18:59:24,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:24,860 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2023-08-26 18:59:24,860 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-26 18:59:24,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 35 events. 4/35 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 3/38 useless extension candidates. Maximal degree in co-relation 64. Up to 12 conditions per place. [2023-08-26 18:59:24,861 INFO L140 encePairwiseOnDemand]: 438/443 looper letters, 18 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2023-08-26 18:59:24,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 24 transitions, 150 flow [2023-08-26 18:59:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:59:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:59:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-08-26 18:59:24,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30383747178329573 [2023-08-26 18:59:24,864 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-08-26 18:59:24,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-08-26 18:59:24,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:24,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-08-26 18:59:24,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 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:24,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 443.0) internal successors, (2658), 6 states have internal predecessors, (2658), 0 states have call successors, (0), 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:24,869 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 443.0) internal successors, (2658), 6 states have internal predecessors, (2658), 0 states have call successors, (0), 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:24,870 INFO L175 Difference]: Start difference. First operand has 47 places, 21 transitions, 99 flow. Second operand 5 states and 673 transitions. [2023-08-26 18:59:24,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 24 transitions, 150 flow [2023-08-26 18:59:24,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 24 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:59:24,871 INFO L231 Difference]: Finished difference. Result has 42 places, 22 transitions, 112 flow [2023-08-26 18:59:24,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=22} [2023-08-26 18:59:24,872 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -28 predicate places. [2023-08-26 18:59:24,872 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 22 transitions, 112 flow [2023-08-26 18:59:24,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:59:24,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:24,873 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:59:24,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:59:24,873 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:59:24,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:24,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1609400225, now seen corresponding path program 1 times [2023-08-26 18:59:24,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:24,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736585506] [2023-08-26 18:59:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:25,112 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:59:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:25,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736585506] [2023-08-26 18:59:25,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736585506] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:59:25,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208607924] [2023-08-26 18:59:25,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:25,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:59:25,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:59:25,121 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:59:25,137 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:59:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:25,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 18:59:25,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:59:25,241 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:25,312 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:59:25,312 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:25,332 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:25,390 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:25,402 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:59:25,402 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:59:35,449 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_272) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 18:59:37,466 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_272) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 18:59:37,560 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:59:37,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208607924] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:59:37,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:59:37,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-26 18:59:37,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908088586] [2023-08-26 18:59:37,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:59:37,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 18:59:37,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:59:37,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 18:59:37,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=79, Unknown=6, NotChecked=38, Total=156 [2023-08-26 18:59:37,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 443 [2023-08-26 18:59:37,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 22 transitions, 112 flow. Second operand has 13 states, 13 states have (on average 134.15384615384616) internal successors, (1744), 13 states have internal predecessors, (1744), 0 states have call successors, (0), 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:37,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:59:37,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 443 [2023-08-26 18:59:37,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:51,624 WARN L234 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 18:59:53,628 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 18:59:55,630 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 18:59:57,632 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 18:59:59,642 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:00:01,646 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:00:03,653 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:00:07,682 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:00:09,684 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:00:11,685 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:00:11,698 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2023-08-26 19:00:11,698 INFO L125 PetriNetUnfolderBase]: For 63/64 co-relation queries the response was YES. [2023-08-26 19:00:11,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 34 events. 4/34 cut-off events. For 63/64 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 1 based on Foata normal form. 1/35 useless extension candidates. Maximal degree in co-relation 72. Up to 12 conditions per place. [2023-08-26 19:00:11,698 INFO L140 encePairwiseOnDemand]: 439/443 looper letters, 0 selfloop transitions, 0 changer transitions 22/22 dead transitions. [2023-08-26 19:00:11,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 22 transitions, 151 flow [2023-08-26 19:00:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:00:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:00:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-08-26 19:00:11,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3029345372460497 [2023-08-26 19:00:11,701 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-08-26 19:00:11,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-08-26 19:00:11,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:11,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-08-26 19:00:11,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 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:11,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 443.0) internal successors, (2658), 6 states have internal predecessors, (2658), 0 states have call successors, (0), 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:11,706 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 443.0) internal successors, (2658), 6 states have internal predecessors, (2658), 0 states have call successors, (0), 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:11,706 INFO L175 Difference]: Start difference. First operand has 42 places, 22 transitions, 112 flow. Second operand 5 states and 671 transitions. [2023-08-26 19:00:11,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 22 transitions, 151 flow [2023-08-26 19:00:11,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 22 transitions, 145 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 19:00:11,707 INFO L231 Difference]: Finished difference. Result has 42 places, 0 transitions, 0 flow [2023-08-26 19:00:11,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=42, PETRI_TRANSITIONS=0} [2023-08-26 19:00:11,708 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -28 predicate places. [2023-08-26 19:00:11,708 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 0 transitions, 0 flow [2023-08-26 19:00:11,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 134.15384615384616) internal successors, (1744), 13 states have internal predecessors, (1744), 0 states have call successors, (0), 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:11,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 37 remaining) [2023-08-26 19:00:11,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 37 remaining) [2023-08-26 19:00:11,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 37 remaining) [2023-08-26 19:00:11,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 37 remaining) [2023-08-26 19:00:11,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 37 remaining) [2023-08-26 19:00:11,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 37 remaining) [2023-08-26 19:00:11,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 37 remaining) [2023-08-26 19:00:11,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 37 remaining) [2023-08-26 19:00:11,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 37 remaining) [2023-08-26 19:00:11,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 37 remaining) [2023-08-26 19:00:11,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 37 remaining) [2023-08-26 19:00:11,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 37 remaining) [2023-08-26 19:00:11,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONASSERT (24 of 37 remaining) [2023-08-26 19:00:11,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 37 remaining) [2023-08-26 19:00:11,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 37 remaining) [2023-08-26 19:00:11,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 37 remaining) [2023-08-26 19:00:11,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 37 remaining) [2023-08-26 19:00:11,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 37 remaining) [2023-08-26 19:00:11,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 37 remaining) [2023-08-26 19:00:11,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 37 remaining) [2023-08-26 19:00:11,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 37 remaining) [2023-08-26 19:00:11,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 37 remaining) [2023-08-26 19:00:11,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 37 remaining) [2023-08-26 19:00:11,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 37 remaining) [2023-08-26 19:00:11,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 37 remaining) [2023-08-26 19:00:11,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 37 remaining) [2023-08-26 19:00:11,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 37 remaining) [2023-08-26 19:00:11,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 37 remaining) [2023-08-26 19:00:11,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 37 remaining) [2023-08-26 19:00:11,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (7 of 37 remaining) [2023-08-26 19:00:11,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 37 remaining) [2023-08-26 19:00:11,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 37 remaining) [2023-08-26 19:00:11,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 37 remaining) [2023-08-26 19:00:11,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONASSERT (3 of 37 remaining) [2023-08-26 19:00:11,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 37 remaining) [2023-08-26 19:00:11,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 37 remaining) [2023-08-26 19:00:11,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 37 remaining) [2023-08-26 19:00:11,725 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 19:00:11,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:11,922 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 19:00:11,923 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-26 19:00:11,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 225 transitions, 458 flow [2023-08-26 19:00:11,971 INFO L124 PetriNetUnfolderBase]: 48/315 cut-off events. [2023-08-26 19:00:11,971 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-26 19:00:11,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 315 events. 48/315 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1244 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. [2023-08-26 19:00:11,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 225 transitions, 458 flow [2023-08-26 19:00:11,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 220 transitions, 445 flow [2023-08-26 19:00:11,975 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:00:11,975 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 220 transitions, 445 flow [2023-08-26 19:00:11,976 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 220 transitions, 445 flow [2023-08-26 19:00:11,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 220 transitions, 445 flow [2023-08-26 19:00:12,004 INFO L124 PetriNetUnfolderBase]: 47/310 cut-off events. [2023-08-26 19:00:12,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:00:12,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 310 events. 47/310 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1197 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. [2023-08-26 19:00:12,013 INFO L119 LiptonReduction]: Number of co-enabled transitions 15744 [2023-08-26 19:00:15,375 INFO L134 LiptonReduction]: Checked pairs total: 32994 [2023-08-26 19:00:15,375 INFO L136 LiptonReduction]: Total number of compositions: 215 [2023-08-26 19:00:15,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-26 19:00:15,377 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;@78150b53, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:00:15,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-26 19:00:15,380 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:00:15,381 INFO L124 PetriNetUnfolderBase]: 13/59 cut-off events. [2023-08-26 19:00:15,381 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:00:15,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:15,381 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-26 19:00:15,381 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:00:15,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:15,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2008644739, now seen corresponding path program 1 times [2023-08-26 19:00:15,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:15,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325820061] [2023-08-26 19:00:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:15,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:00:15,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325820061] [2023-08-26 19:00:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325820061] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:00:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:00:15,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:00:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454620563] [2023-08-26 19:00:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:00:15,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:00:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:15,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:00:15,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:00:15,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 440 [2023-08-26 19:00:15,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 91 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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:15,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:15,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 440 [2023-08-26 19:00:15,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:15,587 INFO L124 PetriNetUnfolderBase]: 616/1355 cut-off events. [2023-08-26 19:00:15,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:00:15,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 1355 events. 616/1355 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8630 event pairs, 567 based on Foata normal form. 102/976 useless extension candidates. Maximal degree in co-relation 2501. Up to 1213 conditions per place. [2023-08-26 19:00:15,589 INFO L140 encePairwiseOnDemand]: 408/440 looper letters, 29 selfloop transitions, 2 changer transitions 26/63 dead transitions. [2023-08-26 19:00:15,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 237 flow [2023-08-26 19:00:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:00:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:00:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2023-08-26 19:00:15,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810606060606061 [2023-08-26 19:00:15,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 635 transitions. [2023-08-26 19:00:15,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 635 transitions. [2023-08-26 19:00:15,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:15,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 635 transitions. [2023-08-26 19:00:15,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:00:15,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 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:15,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 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:15,596 INFO L175 Difference]: Start difference. First operand has 69 places, 91 transitions, 187 flow. Second operand 3 states and 635 transitions. [2023-08-26 19:00:15,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 237 flow [2023-08-26 19:00:15,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 237 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:00:15,597 INFO L231 Difference]: Finished difference. Result has 65 places, 37 transitions, 89 flow [2023-08-26 19:00:15,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=65, PETRI_TRANSITIONS=37} [2023-08-26 19:00:15,598 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -4 predicate places. [2023-08-26 19:00:15,598 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 37 transitions, 89 flow [2023-08-26 19:00:15,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 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:15,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:15,598 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-26 19:00:15,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 19:00:15,599 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:00:15,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:15,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1766588412, now seen corresponding path program 1 times [2023-08-26 19:00:15,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:15,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318088730] [2023-08-26 19:00:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:15,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:00:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:15,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318088730] [2023-08-26 19:00:15,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318088730] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:00:15,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700288567] [2023-08-26 19:00:15,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:15,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:15,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:00:15,633 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 19:00:15,637 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 19:00:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:15,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 19:00:15,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:00:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:00:15,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:00:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:00:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700288567] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:00:15,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:00:15,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:00:15,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508075001] [2023-08-26 19:00:15,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:00:15,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:00:15,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:15,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:00:15,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:00:15,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 440 [2023-08-26 19:00:15,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 37 transitions, 89 flow. Second operand has 6 states, 6 states have (on average 185.5) internal successors, (1113), 6 states have internal predecessors, (1113), 0 states have call successors, (0), 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:15,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:15,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 440 [2023-08-26 19:00:15,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:15,804 INFO L124 PetriNetUnfolderBase]: 112/279 cut-off events. [2023-08-26 19:00:15,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:00:15,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 279 events. 112/279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1151 event pairs, 105 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 531. Up to 245 conditions per place. [2023-08-26 19:00:15,805 INFO L140 encePairwiseOnDemand]: 437/440 looper letters, 29 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-08-26 19:00:15,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 169 flow [2023-08-26 19:00:15,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:00:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:00:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1141 transitions. [2023-08-26 19:00:15,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4321969696969697 [2023-08-26 19:00:15,808 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1141 transitions. [2023-08-26 19:00:15,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1141 transitions. [2023-08-26 19:00:15,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:15,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1141 transitions. [2023-08-26 19:00:15,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 190.16666666666666) internal successors, (1141), 6 states have internal predecessors, (1141), 0 states have call successors, (0), 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:15,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 440.0) internal successors, (3080), 7 states have internal predecessors, (3080), 0 states have call successors, (0), 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:15,827 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 440.0) internal successors, (3080), 7 states have internal predecessors, (3080), 0 states have call successors, (0), 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:15,827 INFO L175 Difference]: Start difference. First operand has 65 places, 37 transitions, 89 flow. Second operand 6 states and 1141 transitions. [2023-08-26 19:00:15,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 169 flow [2023-08-26 19:00:15,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 165 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 19:00:15,829 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 121 flow [2023-08-26 19:00:15,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-26 19:00:15,829 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -22 predicate places. [2023-08-26 19:00:15,829 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 121 flow [2023-08-26 19:00:15,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.5) internal successors, (1113), 6 states have internal predecessors, (1113), 0 states have call successors, (0), 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:15,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:15,830 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-26 19:00:15,840 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 19:00:16,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-26 19:00:16,036 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:00:16,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:16,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1543580477, now seen corresponding path program 2 times [2023-08-26 19:00:16,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:16,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313714856] [2023-08-26 19:00:16,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:16,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:00:16,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:16,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313714856] [2023-08-26 19:00:16,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313714856] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:00:16,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079766507] [2023-08-26 19:00:16,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:00:16,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:16,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:00:16,088 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 19:00:16,099 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 19:00:16,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:00:16,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:00:16,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 19:00:16,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:00:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:00:16,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:00:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 19:00:16,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079766507] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:00:16,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:00:16,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-26 19:00:16,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673303835] [2023-08-26 19:00:16,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:00:16,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 19:00:16,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:16,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 19:00:16,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-26 19:00:16,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 440 [2023-08-26 19:00:16,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 121 flow. Second operand has 12 states, 12 states have (on average 185.25) internal successors, (2223), 12 states have internal predecessors, (2223), 0 states have call successors, (0), 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:16,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:16,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 440 [2023-08-26 19:00:16,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:16,317 INFO L124 PetriNetUnfolderBase]: 112/285 cut-off events. [2023-08-26 19:00:16,317 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 19:00:16,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 285 events. 112/285 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1151 event pairs, 105 based on Foata normal form. 6/180 useless extension candidates. Maximal degree in co-relation 522. Up to 245 conditions per place. [2023-08-26 19:00:16,318 INFO L140 encePairwiseOnDemand]: 437/440 looper letters, 29 selfloop transitions, 11 changer transitions 0/46 dead transitions. [2023-08-26 19:00:16,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 237 flow [2023-08-26 19:00:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 19:00:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 19:00:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2254 transitions. [2023-08-26 19:00:16,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268939393939394 [2023-08-26 19:00:16,324 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2254 transitions. [2023-08-26 19:00:16,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2254 transitions. [2023-08-26 19:00:16,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:16,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2254 transitions. [2023-08-26 19:00:16,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 187.83333333333334) internal successors, (2254), 12 states have internal predecessors, (2254), 0 states have call successors, (0), 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:16,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 440.0) internal successors, (5720), 13 states have internal predecessors, (5720), 0 states have call successors, (0), 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:16,336 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 440.0) internal successors, (5720), 13 states have internal predecessors, (5720), 0 states have call successors, (0), 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:16,337 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 121 flow. Second operand 12 states and 2254 transitions. [2023-08-26 19:00:16,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 237 flow [2023-08-26 19:00:16,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 46 transitions, 223 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 19:00:16,338 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 191 flow [2023-08-26 19:00:16,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2023-08-26 19:00:16,339 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -6 predicate places. [2023-08-26 19:00:16,339 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 191 flow [2023-08-26 19:00:16,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 185.25) internal successors, (2223), 12 states have internal predecessors, (2223), 0 states have call successors, (0), 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:16,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:16,339 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-26 19:00:16,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 19:00:16,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:16,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 19:00:16,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:16,546 INFO L85 PathProgramCache]: Analyzing trace with hash -164388131, now seen corresponding path program 3 times [2023-08-26 19:00:16,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:16,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809617218] [2023-08-26 19:00:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:16,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 19:00:16,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 19:00:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 19:00:16,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 19:00:16,593 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 19:00:16,594 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-26 19:00:16,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 19:00:16,594 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-26 19:00:16,595 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-26 19:00:16,595 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-26 19:00:16,595 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-26 19:00:16,626 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 19:00:16,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 309 transitions, 636 flow [2023-08-26 19:00:16,671 INFO L124 PetriNetUnfolderBase]: 80/516 cut-off events. [2023-08-26 19:00:16,672 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-26 19:00:16,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 516 events. 80/516 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2399 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 317. Up to 12 conditions per place. [2023-08-26 19:00:16,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 309 transitions, 636 flow [2023-08-26 19:00:16,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 309 transitions, 636 flow [2023-08-26 19:00:16,682 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:00:16,682 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 309 transitions, 636 flow [2023-08-26 19:00:16,683 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 309 transitions, 636 flow [2023-08-26 19:00:16,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 309 transitions, 636 flow [2023-08-26 19:00:16,725 INFO L124 PetriNetUnfolderBase]: 80/516 cut-off events. [2023-08-26 19:00:16,725 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-26 19:00:16,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 516 events. 80/516 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2399 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 317. Up to 12 conditions per place. [2023-08-26 19:00:16,747 INFO L119 LiptonReduction]: Number of co-enabled transitions 46740 [2023-08-26 19:00:20,794 INFO L134 LiptonReduction]: Checked pairs total: 94266 [2023-08-26 19:00:20,795 INFO L136 LiptonReduction]: Total number of compositions: 287 [2023-08-26 19:00:20,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 19:00:20,798 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;@78150b53, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:00:20,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2023-08-26 19:00:20,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:00:20,799 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-08-26 19:00:20,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:00:20,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:20,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:00:20,799 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:20,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1790237, now seen corresponding path program 1 times [2023-08-26 19:00:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:20,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157387618] [2023-08-26 19:00:20,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:20,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:20,824 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 19:00:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157387618] [2023-08-26 19:00:20,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157387618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:00:20,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:00:20,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:00:20,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384942036] [2023-08-26 19:00:20,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:00:20,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:00:20,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:20,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:00:20,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:00:20,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 596 [2023-08-26 19:00:20,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 135 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 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:20,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:20,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 596 [2023-08-26 19:00:20,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:24,047 INFO L124 PetriNetUnfolderBase]: 27239/43895 cut-off events. [2023-08-26 19:00:24,047 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-08-26 19:00:24,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84056 conditions, 43895 events. 27239/43895 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 1794. Compared 361213 event pairs, 25814 based on Foata normal form. 3534/31459 useless extension candidates. Maximal degree in co-relation 34186. Up to 40029 conditions per place. [2023-08-26 19:00:24,298 INFO L140 encePairwiseOnDemand]: 553/596 looper letters, 76 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2023-08-26 19:00:24,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 96 transitions, 366 flow [2023-08-26 19:00:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:00:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:00:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2023-08-26 19:00:24,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4893736017897092 [2023-08-26 19:00:24,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 875 transitions. [2023-08-26 19:00:24,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 875 transitions. [2023-08-26 19:00:24,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:24,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 875 transitions. [2023-08-26 19:00:24,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.6666666666667) internal successors, (875), 3 states have internal predecessors, (875), 0 states have call successors, (0), 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:24,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:00:24,306 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:00:24,306 INFO L175 Difference]: Start difference. First operand has 102 places, 135 transitions, 288 flow. Second operand 3 states and 875 transitions. [2023-08-26 19:00:24,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 96 transitions, 366 flow [2023-08-26 19:00:24,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:00:24,308 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 220 flow [2023-08-26 19:00:24,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2023-08-26 19:00:24,309 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -5 predicate places. [2023-08-26 19:00:24,309 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 220 flow [2023-08-26 19:00:24,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 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:24,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:24,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 19:00:24,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 19:00:24,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:24,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:24,310 INFO L85 PathProgramCache]: Analyzing trace with hash 55471697, now seen corresponding path program 1 times [2023-08-26 19:00:24,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:24,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031806072] [2023-08-26 19:00:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:24,336 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 19:00:24,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031806072] [2023-08-26 19:00:24,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031806072] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:00:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841495367] [2023-08-26 19:00:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:24,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:24,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:00:24,337 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 19:00:24,360 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 19:00:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:24,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 19:00:24,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:00:24,425 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 19:00:24,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:00:24,435 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 19:00:24,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841495367] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:00:24,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:00:24,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 19:00:24,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860064544] [2023-08-26 19:00:24,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:00:24,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 19:00:24,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:24,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 19:00:24,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 19:00:24,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 596 [2023-08-26 19:00:24,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 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:24,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:24,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 596 [2023-08-26 19:00:24,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:27,360 INFO L124 PetriNetUnfolderBase]: 27239/43898 cut-off events. [2023-08-26 19:00:27,361 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-08-26 19:00:27,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84072 conditions, 43898 events. 27239/43898 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 1794. Compared 361305 event pairs, 25814 based on Foata normal form. 0/27928 useless extension candidates. Maximal degree in co-relation 84059. Up to 40029 conditions per place. [2023-08-26 19:00:27,611 INFO L140 encePairwiseOnDemand]: 593/596 looper letters, 76 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2023-08-26 19:00:27,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 394 flow [2023-08-26 19:00:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:00:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:00:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1596 transitions. [2023-08-26 19:00:27,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4463087248322148 [2023-08-26 19:00:27,615 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1596 transitions. [2023-08-26 19:00:27,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1596 transitions. [2023-08-26 19:00:27,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:27,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1596 transitions. [2023-08-26 19:00:27,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 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:27,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 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:27,624 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 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:27,624 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 220 flow. Second operand 6 states and 1596 transitions. [2023-08-26 19:00:27,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 394 flow [2023-08-26 19:00:27,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 99 transitions, 390 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 19:00:27,628 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 252 flow [2023-08-26 19:00:27,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2023-08-26 19:00:27,629 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 2 predicate places. [2023-08-26 19:00:27,629 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 252 flow [2023-08-26 19:00:27,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 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:27,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:27,629 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 19:00:27,635 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 19:00:27,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:27,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:27,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1030554083, now seen corresponding path program 2 times [2023-08-26 19:00:27,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:27,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408400503] [2023-08-26 19:00:27,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:27,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:27,886 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 19:00:27,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:27,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408400503] [2023-08-26 19:00:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408400503] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:00:27,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633057868] [2023-08-26 19:00:27,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:00:27,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:27,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:00:27,888 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 19:00:27,891 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 19:00:27,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 19:00:27,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:00:27,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:00:27,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:00:27,979 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 19:00:27,989 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 19:00:27,990 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 19:00:27,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633057868] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:00:27,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 19:00:27,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2023-08-26 19:00:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283169667] [2023-08-26 19:00:27,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:00:27,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:00:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:00:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-26 19:00:27,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 596 [2023-08-26 19:00:27,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 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:27,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:27,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 596 [2023-08-26 19:00:27,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:30,782 INFO L124 PetriNetUnfolderBase]: 29718/46879 cut-off events. [2023-08-26 19:00:30,782 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-08-26 19:00:30,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90432 conditions, 46879 events. 29718/46879 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 372358 event pairs, 21103 based on Foata normal form. 0/30502 useless extension candidates. Maximal degree in co-relation 90397. Up to 43362 conditions per place. [2023-08-26 19:00:31,103 INFO L140 encePairwiseOnDemand]: 592/596 looper letters, 105 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2023-08-26 19:00:31,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 123 transitions, 514 flow [2023-08-26 19:00:31,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:00:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:00:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2023-08-26 19:00:31,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4110738255033557 [2023-08-26 19:00:31,106 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 735 transitions. [2023-08-26 19:00:31,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 735 transitions. [2023-08-26 19:00:31,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:31,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 735 transitions. [2023-08-26 19:00:31,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 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:31,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:00:31,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:00:31,111 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 252 flow. Second operand 3 states and 735 transitions. [2023-08-26 19:00:31,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 123 transitions, 514 flow [2023-08-26 19:00:31,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 123 transitions, 500 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 19:00:31,115 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 252 flow [2023-08-26 19:00:31,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2023-08-26 19:00:31,115 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 4 predicate places. [2023-08-26 19:00:31,116 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 252 flow [2023-08-26 19:00:31,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 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:31,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:31,116 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 19:00:31,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-26 19:00:31,328 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,SelfDestructingSolverStorable16 [2023-08-26 19:00:31,329 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:31,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:31,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1030554085, now seen corresponding path program 1 times [2023-08-26 19:00:31,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:31,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887870955] [2023-08-26 19:00:31,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:31,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:31,381 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 19:00:31,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:31,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887870955] [2023-08-26 19:00:31,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887870955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:00:31,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:00:31,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:00:31,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111700320] [2023-08-26 19:00:31,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:00:31,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:00:31,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:31,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:00:31,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:00:31,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 596 [2023-08-26 19:00:31,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 100 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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:31,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:31,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 596 [2023-08-26 19:00:31,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:34,851 INFO L124 PetriNetUnfolderBase]: 31500/49083 cut-off events. [2023-08-26 19:00:34,851 INFO L125 PetriNetUnfolderBase]: For 1312/1312 co-relation queries the response was YES. [2023-08-26 19:00:34,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97126 conditions, 49083 events. 31500/49083 cut-off events. For 1312/1312 co-relation queries the response was YES. Maximal size of possible extension queue 1908. Compared 384881 event pairs, 28720 based on Foata normal form. 0/31490 useless extension candidates. Maximal degree in co-relation 97096. Up to 44419 conditions per place. [2023-08-26 19:00:35,108 INFO L140 encePairwiseOnDemand]: 592/596 looper letters, 128 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2023-08-26 19:00:35,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 143 transitions, 598 flow [2023-08-26 19:00:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:00:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:00:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 772 transitions. [2023-08-26 19:00:35,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4317673378076063 [2023-08-26 19:00:35,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 772 transitions. [2023-08-26 19:00:35,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 772 transitions. [2023-08-26 19:00:35,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:35,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 772 transitions. [2023-08-26 19:00:35,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 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:35,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:00:35,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:00:35,114 INFO L175 Difference]: Start difference. First operand has 106 places, 100 transitions, 252 flow. Second operand 3 states and 772 transitions. [2023-08-26 19:00:35,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 143 transitions, 598 flow [2023-08-26 19:00:35,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 143 transitions, 596 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:00:35,118 INFO L231 Difference]: Finished difference. Result has 105 places, 98 transitions, 250 flow [2023-08-26 19:00:35,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2023-08-26 19:00:35,119 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 3 predicate places. [2023-08-26 19:00:35,119 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 250 flow [2023-08-26 19:00:35,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 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:35,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:35,119 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:00:35,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 19:00:35,119 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:35,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:35,120 INFO L85 PathProgramCache]: Analyzing trace with hash 690856889, now seen corresponding path program 1 times [2023-08-26 19:00:35,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:35,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124768267] [2023-08-26 19:00:35,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:35,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:35,195 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 19:00:35,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:35,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124768267] [2023-08-26 19:00:35,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124768267] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:00:35,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918347663] [2023-08-26 19:00:35,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:35,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:35,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:00:35,197 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 19:00:35,216 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 19:00:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:35,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 19:00:35,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:00:35,305 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 19:00:35,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:00:35,353 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 19:00:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918347663] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:00:35,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:00:35,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 19:00:35,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392218214] [2023-08-26 19:00:35,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:00:35,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 19:00:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 19:00:35,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 19:00:35,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 596 [2023-08-26 19:00:35,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 250 flow. Second operand has 13 states, 13 states have (on average 253.46153846153845) internal successors, (3295), 13 states have internal predecessors, (3295), 0 states have call successors, (0), 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:35,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:35,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 596 [2023-08-26 19:00:35,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:38,003 INFO L124 PetriNetUnfolderBase]: 25476/40526 cut-off events. [2023-08-26 19:00:38,004 INFO L125 PetriNetUnfolderBase]: For 1412/1412 co-relation queries the response was YES. [2023-08-26 19:00:38,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79849 conditions, 40526 events. 25476/40526 cut-off events. For 1412/1412 co-relation queries the response was YES. Maximal size of possible extension queue 1676. Compared 325560 event pairs, 23991 based on Foata normal form. 6/27273 useless extension candidates. Maximal degree in co-relation 79795. Up to 37195 conditions per place. [2023-08-26 19:00:38,226 INFO L140 encePairwiseOnDemand]: 593/596 looper letters, 75 selfloop transitions, 11 changer transitions 0/104 dead transitions. [2023-08-26 19:00:38,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 458 flow [2023-08-26 19:00:38,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 19:00:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 19:00:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3115 transitions. [2023-08-26 19:00:38,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355425055928412 [2023-08-26 19:00:38,232 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3115 transitions. [2023-08-26 19:00:38,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3115 transitions. [2023-08-26 19:00:38,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:38,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3115 transitions. [2023-08-26 19:00:38,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 259.5833333333333) internal successors, (3115), 12 states have internal predecessors, (3115), 0 states have call successors, (0), 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:38,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 596.0) internal successors, (7748), 13 states have internal predecessors, (7748), 0 states have call successors, (0), 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:38,247 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 596.0) internal successors, (7748), 13 states have internal predecessors, (7748), 0 states have call successors, (0), 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:38,247 INFO L175 Difference]: Start difference. First operand has 105 places, 98 transitions, 250 flow. Second operand 12 states and 3115 transitions. [2023-08-26 19:00:38,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 458 flow [2023-08-26 19:00:38,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 104 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:00:38,277 INFO L231 Difference]: Finished difference. Result has 120 places, 104 transitions, 330 flow [2023-08-26 19:00:38,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=330, PETRI_PLACES=120, PETRI_TRANSITIONS=104} [2023-08-26 19:00:38,277 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2023-08-26 19:00:38,277 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 104 transitions, 330 flow [2023-08-26 19:00:38,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 253.46153846153845) internal successors, (3295), 13 states have internal predecessors, (3295), 0 states have call successors, (0), 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:38,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:38,278 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:00:38,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-26 19:00:38,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:38,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:38,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -448383175, now seen corresponding path program 2 times [2023-08-26 19:00:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:38,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628509589] [2023-08-26 19:00:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:38,705 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 19:00:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628509589] [2023-08-26 19:00:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628509589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:00:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:00:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:00:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287821434] [2023-08-26 19:00:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:00:38,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:00:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:38,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:00:38,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:00:38,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 596 [2023-08-26 19:00:38,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 104 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 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:38,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:38,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 596 [2023-08-26 19:00:38,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:41,378 INFO L124 PetriNetUnfolderBase]: 24173/38073 cut-off events. [2023-08-26 19:00:41,378 INFO L125 PetriNetUnfolderBase]: For 1082/1082 co-relation queries the response was YES. [2023-08-26 19:00:41,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75738 conditions, 38073 events. 24173/38073 cut-off events. For 1082/1082 co-relation queries the response was YES. Maximal size of possible extension queue 1396. Compared 297415 event pairs, 6893 based on Foata normal form. 601/26581 useless extension candidates. Maximal degree in co-relation 75660. Up to 33385 conditions per place. [2023-08-26 19:00:41,649 INFO L140 encePairwiseOnDemand]: 586/596 looper letters, 193 selfloop transitions, 6 changer transitions 0/212 dead transitions. [2023-08-26 19:00:41,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 212 transitions, 960 flow [2023-08-26 19:00:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:00:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:00:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1345 transitions. [2023-08-26 19:00:41,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761185682326622 [2023-08-26 19:00:41,653 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1345 transitions. [2023-08-26 19:00:41,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1345 transitions. [2023-08-26 19:00:41,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:41,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1345 transitions. [2023-08-26 19:00:41,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 224.16666666666666) internal successors, (1345), 6 states have internal predecessors, (1345), 0 states have call successors, (0), 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:41,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 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:41,661 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 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:41,661 INFO L175 Difference]: Start difference. First operand has 120 places, 104 transitions, 330 flow. Second operand 6 states and 1345 transitions. [2023-08-26 19:00:41,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 212 transitions, 960 flow [2023-08-26 19:00:41,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 212 transitions, 912 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 19:00:41,666 INFO L231 Difference]: Finished difference. Result has 114 places, 100 transitions, 286 flow [2023-08-26 19:00:41,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=114, PETRI_TRANSITIONS=100} [2023-08-26 19:00:41,667 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 12 predicate places. [2023-08-26 19:00:41,667 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 100 transitions, 286 flow [2023-08-26 19:00:41,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 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:41,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:41,668 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:00:41,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 19:00:41,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:41,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:41,668 INFO L85 PathProgramCache]: Analyzing trace with hash -448845997, now seen corresponding path program 1 times [2023-08-26 19:00:41,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:41,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690156178] [2023-08-26 19:00:41,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:41,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:41,756 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 19:00:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:41,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690156178] [2023-08-26 19:00:41,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690156178] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:00:41,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369642633] [2023-08-26 19:00:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:41,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:41,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:00:41,761 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 19:00:41,770 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 19:00:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:41,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 19:00:41,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:00:41,882 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 19:00:41,910 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 19:00:41,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:00:41,948 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 19:00:41,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369642633] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:00:41,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:00:41,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 19:00:41,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912290224] [2023-08-26 19:00:41,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:00:41,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 19:00:41,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:41,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 19:00:41,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-08-26 19:00:41,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 596 [2023-08-26 19:00:41,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 100 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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:41,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:41,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 596 [2023-08-26 19:00:41,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:44,151 INFO L124 PetriNetUnfolderBase]: 19373/31060 cut-off events. [2023-08-26 19:00:44,152 INFO L125 PetriNetUnfolderBase]: For 1522/1522 co-relation queries the response was YES. [2023-08-26 19:00:44,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63118 conditions, 31060 events. 19373/31060 cut-off events. For 1522/1522 co-relation queries the response was YES. Maximal size of possible extension queue 1232. Compared 245952 event pairs, 231 based on Foata normal form. 19/23036 useless extension candidates. Maximal degree in co-relation 63063. Up to 25892 conditions per place. [2023-08-26 19:00:44,334 INFO L140 encePairwiseOnDemand]: 592/596 looper letters, 177 selfloop transitions, 4 changer transitions 0/197 dead transitions. [2023-08-26 19:00:44,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 197 transitions, 846 flow [2023-08-26 19:00:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:00:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:00:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1222 transitions. [2023-08-26 19:00:44,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41006711409395974 [2023-08-26 19:00:44,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1222 transitions. [2023-08-26 19:00:44,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1222 transitions. [2023-08-26 19:00:44,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:44,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1222 transitions. [2023-08-26 19:00:44,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 244.4) internal successors, (1222), 5 states have internal predecessors, (1222), 0 states have call successors, (0), 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:44,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 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:44,343 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 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:44,343 INFO L175 Difference]: Start difference. First operand has 114 places, 100 transitions, 286 flow. Second operand 5 states and 1222 transitions. [2023-08-26 19:00:44,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 197 transitions, 846 flow [2023-08-26 19:00:44,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 197 transitions, 845 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:00:44,356 INFO L231 Difference]: Finished difference. Result has 116 places, 99 transitions, 289 flow [2023-08-26 19:00:44,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=116, PETRI_TRANSITIONS=99} [2023-08-26 19:00:44,357 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 14 predicate places. [2023-08-26 19:00:44,357 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 99 transitions, 289 flow [2023-08-26 19:00:44,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 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:44,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:44,358 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:00:44,363 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:44,563 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,SelfDestructingSolverStorable20 [2023-08-26 19:00:44,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:44,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1014979331, now seen corresponding path program 1 times [2023-08-26 19:00:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752801178] [2023-08-26 19:00:44,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:44,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:44,664 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 19:00:44,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:44,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752801178] [2023-08-26 19:00:44,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752801178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:00:44,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:00:44,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:00:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296242673] [2023-08-26 19:00:44,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:00:44,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:00:44,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:44,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:00:44,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:00:44,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 596 [2023-08-26 19:00:44,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 99 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 197.5) internal successors, (1185), 6 states have internal predecessors, (1185), 0 states have call successors, (0), 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:44,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:44,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 596 [2023-08-26 19:00:44,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:46,854 INFO L124 PetriNetUnfolderBase]: 17476/28100 cut-off events. [2023-08-26 19:00:46,854 INFO L125 PetriNetUnfolderBase]: For 3311/3311 co-relation queries the response was YES. [2023-08-26 19:00:46,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57059 conditions, 28100 events. 17476/28100 cut-off events. For 3311/3311 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 228278 event pairs, 498 based on Foata normal form. 0/21724 useless extension candidates. Maximal degree in co-relation 57004. Up to 23510 conditions per place. [2023-08-26 19:00:47,013 INFO L140 encePairwiseOnDemand]: 582/596 looper letters, 190 selfloop transitions, 10 changer transitions 0/213 dead transitions. [2023-08-26 19:00:47,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 213 transitions, 937 flow [2023-08-26 19:00:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:00:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:00:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1176 transitions. [2023-08-26 19:00:47,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3946308724832215 [2023-08-26 19:00:47,016 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1176 transitions. [2023-08-26 19:00:47,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1176 transitions. [2023-08-26 19:00:47,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:47,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1176 transitions. [2023-08-26 19:00:47,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 235.2) internal successors, (1176), 5 states have internal predecessors, (1176), 0 states have call successors, (0), 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:47,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 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:47,021 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 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:47,021 INFO L175 Difference]: Start difference. First operand has 116 places, 99 transitions, 289 flow. Second operand 5 states and 1176 transitions. [2023-08-26 19:00:47,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 213 transitions, 937 flow [2023-08-26 19:00:47,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 213 transitions, 920 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-26 19:00:47,028 INFO L231 Difference]: Finished difference. Result has 120 places, 105 transitions, 356 flow [2023-08-26 19:00:47,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=120, PETRI_TRANSITIONS=105} [2023-08-26 19:00:47,028 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2023-08-26 19:00:47,029 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 105 transitions, 356 flow [2023-08-26 19:00:47,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.5) internal successors, (1185), 6 states have internal predecessors, (1185), 0 states have call successors, (0), 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:47,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:47,029 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:00:47,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 19:00:47,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:47,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1014978925, now seen corresponding path program 1 times [2023-08-26 19:00:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650527305] [2023-08-26 19:00:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:47,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:47,175 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 19:00:47,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:47,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650527305] [2023-08-26 19:00:47,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650527305] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:00:47,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:00:47,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:00:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649450731] [2023-08-26 19:00:47,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:00:47,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:00:47,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:47,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:00:47,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:00:47,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 596 [2023-08-26 19:00:47,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 105 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 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:47,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:47,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 596 [2023-08-26 19:00:47,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:50,427 INFO L124 PetriNetUnfolderBase]: 25426/41183 cut-off events. [2023-08-26 19:00:50,427 INFO L125 PetriNetUnfolderBase]: For 11153/11200 co-relation queries the response was YES. [2023-08-26 19:00:50,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89591 conditions, 41183 events. 25426/41183 cut-off events. For 11153/11200 co-relation queries the response was YES. Maximal size of possible extension queue 1480. Compared 339275 event pairs, 5515 based on Foata normal form. 47/32124 useless extension candidates. Maximal degree in co-relation 89533. Up to 22163 conditions per place. [2023-08-26 19:00:50,708 INFO L140 encePairwiseOnDemand]: 583/596 looper letters, 262 selfloop transitions, 29 changer transitions 0/304 dead transitions. [2023-08-26 19:00:50,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 304 transitions, 1469 flow [2023-08-26 19:00:50,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 19:00:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 19:00:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1594 transitions. [2023-08-26 19:00:50,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38207094918504314 [2023-08-26 19:00:50,711 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1594 transitions. [2023-08-26 19:00:50,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1594 transitions. [2023-08-26 19:00:50,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:50,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1594 transitions. [2023-08-26 19:00:50,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 227.71428571428572) internal successors, (1594), 7 states have internal predecessors, (1594), 0 states have call successors, (0), 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:50,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 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:50,716 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 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:50,716 INFO L175 Difference]: Start difference. First operand has 120 places, 105 transitions, 356 flow. Second operand 7 states and 1594 transitions. [2023-08-26 19:00:50,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 304 transitions, 1469 flow [2023-08-26 19:00:50,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 304 transitions, 1458 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:00:50,764 INFO L231 Difference]: Finished difference. Result has 129 places, 132 transitions, 586 flow [2023-08-26 19:00:50,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=586, PETRI_PLACES=129, PETRI_TRANSITIONS=132} [2023-08-26 19:00:50,765 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 27 predicate places. [2023-08-26 19:00:50,765 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 132 transitions, 586 flow [2023-08-26 19:00:50,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 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:50,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:50,765 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:00:50,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 19:00:50,766 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:50,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1519840996, now seen corresponding path program 1 times [2023-08-26 19:00:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:50,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607215481] [2023-08-26 19:00:50,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:50,979 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 19:00:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607215481] [2023-08-26 19:00:50,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607215481] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:00:50,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981000333] [2023-08-26 19:00:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:50,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:50,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:00:50,981 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:51,008 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:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:51,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-26 19:00:51,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:00:51,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:00:51,195 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:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-26 19:00:51,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 19:00:51,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981000333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:00:51,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 19:00:51,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2023-08-26 19:00:51,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234652424] [2023-08-26 19:00:51,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:00:51,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:00:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:51,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:00:51,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-26 19:00:51,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 596 [2023-08-26 19:00:51,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 132 transitions, 586 flow. Second operand has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 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:51,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:51,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 596 [2023-08-26 19:00:51,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:53,841 INFO L124 PetriNetUnfolderBase]: 17245/29006 cut-off events. [2023-08-26 19:00:53,841 INFO L125 PetriNetUnfolderBase]: For 18660/18660 co-relation queries the response was YES. [2023-08-26 19:00:53,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70310 conditions, 29006 events. 17245/29006 cut-off events. For 18660/18660 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 234938 event pairs, 3523 based on Foata normal form. 2288/27572 useless extension candidates. Maximal degree in co-relation 70246. Up to 23402 conditions per place. [2023-08-26 19:00:54,042 INFO L140 encePairwiseOnDemand]: 579/596 looper letters, 223 selfloop transitions, 21 changer transitions 3/260 dead transitions. [2023-08-26 19:00:54,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 260 transitions, 1681 flow [2023-08-26 19:00:54,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:00:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:00:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1333 transitions. [2023-08-26 19:00:54,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37276286353467564 [2023-08-26 19:00:54,044 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1333 transitions. [2023-08-26 19:00:54,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1333 transitions. [2023-08-26 19:00:54,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:00:54,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1333 transitions. [2023-08-26 19:00:54,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.16666666666666) internal successors, (1333), 6 states have internal predecessors, (1333), 0 states have call successors, (0), 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:54,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 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:54,048 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 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:54,048 INFO L175 Difference]: Start difference. First operand has 129 places, 132 transitions, 586 flow. Second operand 6 states and 1333 transitions. [2023-08-26 19:00:54,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 260 transitions, 1681 flow [2023-08-26 19:00:54,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 260 transitions, 1681 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:00:54,067 INFO L231 Difference]: Finished difference. Result has 133 places, 142 transitions, 754 flow [2023-08-26 19:00:54,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=754, PETRI_PLACES=133, PETRI_TRANSITIONS=142} [2023-08-26 19:00:54,068 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2023-08-26 19:00:54,068 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 142 transitions, 754 flow [2023-08-26 19:00:54,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 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:54,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:00:54,068 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:00:54,075 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:54,272 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,SelfDestructingSolverStorable23 [2023-08-26 19:00:54,273 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:00:54,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:00:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1591627273, now seen corresponding path program 1 times [2023-08-26 19:00:54,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:00:54,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003380387] [2023-08-26 19:00:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:54,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:00:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:54,424 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 19:00:54,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:00:54,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003380387] [2023-08-26 19:00:54,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003380387] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:00:54,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424849544] [2023-08-26 19:00:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:00:54,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:00:54,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:00:54,429 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:54,464 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:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:00:54,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 19:00:54,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:00:54,565 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:54,614 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:00:54,615 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:54,630 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:54,674 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:54,683 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 19:00:54,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:01:02,701 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_701 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_701) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 19:01:04,713 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_701 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_701) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 19:01:04,795 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 19:01:04,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424849544] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:01:04,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:01:04,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-26 19:01:04,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574901717] [2023-08-26 19:01:04,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:01:04,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 19:01:04,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:01:04,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 19:01:04,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=80, Unknown=5, NotChecked=38, Total=156 [2023-08-26 19:01:04,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 596 [2023-08-26 19:01:04,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 142 transitions, 754 flow. Second operand has 13 states, 13 states have (on average 191.3846153846154) internal successors, (2488), 13 states have internal predecessors, (2488), 0 states have call successors, (0), 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:01:04,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:01:04,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 596 [2023-08-26 19:01:04,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:01:09,762 INFO L124 PetriNetUnfolderBase]: 16813/27935 cut-off events. [2023-08-26 19:01:09,763 INFO L125 PetriNetUnfolderBase]: For 26640/26667 co-relation queries the response was YES. [2023-08-26 19:01:09,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73402 conditions, 27935 events. 16813/27935 cut-off events. For 26640/26667 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 220912 event pairs, 4578 based on Foata normal form. 325/24776 useless extension candidates. Maximal degree in co-relation 73334. Up to 15398 conditions per place. [2023-08-26 19:01:09,946 INFO L140 encePairwiseOnDemand]: 582/596 looper letters, 231 selfloop transitions, 34 changer transitions 9/287 dead transitions. [2023-08-26 19:01:09,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 287 transitions, 1790 flow [2023-08-26 19:01:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 19:01:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 19:01:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1549 transitions. [2023-08-26 19:01:09,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37128475551294343 [2023-08-26 19:01:09,948 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1549 transitions. [2023-08-26 19:01:09,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1549 transitions. [2023-08-26 19:01:09,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:01:09,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1549 transitions. [2023-08-26 19:01:09,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 221.28571428571428) internal successors, (1549), 7 states have internal predecessors, (1549), 0 states have call successors, (0), 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:01:09,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 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:01:09,952 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 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:01:09,952 INFO L175 Difference]: Start difference. First operand has 133 places, 142 transitions, 754 flow. Second operand 7 states and 1549 transitions. [2023-08-26 19:01:09,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 287 transitions, 1790 flow [2023-08-26 19:01:10,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 287 transitions, 1789 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:01:10,013 INFO L231 Difference]: Finished difference. Result has 140 places, 146 transitions, 881 flow [2023-08-26 19:01:10,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=881, PETRI_PLACES=140, PETRI_TRANSITIONS=146} [2023-08-26 19:01:10,013 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 38 predicate places. [2023-08-26 19:01:10,013 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 146 transitions, 881 flow [2023-08-26 19:01:10,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 191.3846153846154) internal successors, (2488), 13 states have internal predecessors, (2488), 0 states have call successors, (0), 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:01:10,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:01:10,014 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:01:10,019 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:01:10,217 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,SelfDestructingSolverStorable24 [2023-08-26 19:01:10,218 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:01:10,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:01:10,218 INFO L85 PathProgramCache]: Analyzing trace with hash -129572705, now seen corresponding path program 1 times [2023-08-26 19:01:10,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:01:10,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685794096] [2023-08-26 19:01:10,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:01:10,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:01:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:01:10,353 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 19:01:10,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:01:10,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685794096] [2023-08-26 19:01:10,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685794096] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:01:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289806401] [2023-08-26 19:01:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:01:10,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:01:10,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:01:10,357 INFO L229 MonitoredProcess]: Starting monitored process 14 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:01:10,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-26 19:01:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:01:10,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 19:01:10,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:01:10,505 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:01:10,555 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:01:10,555 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:01:10,572 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:01:10,595 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:01:10,631 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 19:01:10,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:01:22,753 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 19:01:22,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289806401] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:01:22,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:01:22,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-26 19:01:22,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778232630] [2023-08-26 19:01:22,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:01:22,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 19:01:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:01:22,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 19:01:22,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=92, Unknown=5, NotChecked=0, Total=132 [2023-08-26 19:01:22,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 596 [2023-08-26 19:01:22,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 146 transitions, 881 flow. Second operand has 12 states, 12 states have (on average 191.75) internal successors, (2301), 12 states have internal predecessors, (2301), 0 states have call successors, (0), 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:01:22,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:01:22,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 596 [2023-08-26 19:01:22,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:01:25,475 INFO L124 PetriNetUnfolderBase]: 17616/29698 cut-off events. [2023-08-26 19:01:25,475 INFO L125 PetriNetUnfolderBase]: For 36619/36678 co-relation queries the response was YES. [2023-08-26 19:01:25,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79968 conditions, 29698 events. 17616/29698 cut-off events. For 36619/36678 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 241031 event pairs, 3179 based on Foata normal form. 131/26571 useless extension candidates. Maximal degree in co-relation 79897. Up to 17346 conditions per place. [2023-08-26 19:01:25,725 INFO L140 encePairwiseOnDemand]: 581/596 looper letters, 222 selfloop transitions, 44 changer transitions 17/296 dead transitions. [2023-08-26 19:01:25,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 296 transitions, 2061 flow [2023-08-26 19:01:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 19:01:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 19:01:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1540 transitions. [2023-08-26 19:01:25,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3691275167785235 [2023-08-26 19:01:25,727 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1540 transitions. [2023-08-26 19:01:25,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1540 transitions. [2023-08-26 19:01:25,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:01:25,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1540 transitions. [2023-08-26 19:01:25,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 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:01:25,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 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:01:25,732 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 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:01:25,733 INFO L175 Difference]: Start difference. First operand has 140 places, 146 transitions, 881 flow. Second operand 7 states and 1540 transitions. [2023-08-26 19:01:25,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 296 transitions, 2061 flow [2023-08-26 19:01:25,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 296 transitions, 1999 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 19:01:25,813 INFO L231 Difference]: Finished difference. Result has 149 places, 161 transitions, 1144 flow [2023-08-26 19:01:25,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1144, PETRI_PLACES=149, PETRI_TRANSITIONS=161} [2023-08-26 19:01:25,814 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 47 predicate places. [2023-08-26 19:01:25,814 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 161 transitions, 1144 flow [2023-08-26 19:01:25,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 191.75) internal successors, (2301), 12 states have internal predecessors, (2301), 0 states have call successors, (0), 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:01:25,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:01:25,814 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:01:25,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-26 19:01:26,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-26 19:01:26,015 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:01:26,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:01:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash -180305694, now seen corresponding path program 1 times [2023-08-26 19:01:26,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:01:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136126418] [2023-08-26 19:01:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:01:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:01:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:01:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:01:26,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:01:26,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136126418] [2023-08-26 19:01:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136126418] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:01:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551716343] [2023-08-26 19:01:26,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:01:26,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:01:26,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:01:26,066 INFO L229 MonitoredProcess]: Starting monitored process 15 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:01:26,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-26 19:01:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:01:26,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 19:01:26,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:01:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:01:26,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:01:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:01:26,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551716343] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:01:26,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:01:26,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-26 19:01:26,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794082084] [2023-08-26 19:01:26,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:01:26,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 19:01:26,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:01:26,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 19:01:26,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-08-26 19:01:26,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 596 [2023-08-26 19:01:26,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 161 transitions, 1144 flow. Second operand has 9 states, 9 states have (on average 253.66666666666666) internal successors, (2283), 9 states have internal predecessors, (2283), 0 states have call successors, (0), 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:01:26,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:01:26,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 596 [2023-08-26 19:01:26,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:01:26,803 INFO L124 PetriNetUnfolderBase]: 1567/2935 cut-off events. [2023-08-26 19:01:26,803 INFO L125 PetriNetUnfolderBase]: For 5290/5340 co-relation queries the response was YES. [2023-08-26 19:01:26,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9072 conditions, 2935 events. 1567/2935 cut-off events. For 5290/5340 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 18756 event pairs, 321 based on Foata normal form. 332/3117 useless extension candidates. Maximal degree in co-relation 9039. Up to 1872 conditions per place. [2023-08-26 19:01:26,820 INFO L140 encePairwiseOnDemand]: 593/596 looper letters, 92 selfloop transitions, 3 changer transitions 24/129 dead transitions. [2023-08-26 19:01:26,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 129 transitions, 976 flow [2023-08-26 19:01:26,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:01:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:01:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1335 transitions. [2023-08-26 19:01:26,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44798657718120805 [2023-08-26 19:01:26,823 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1335 transitions. [2023-08-26 19:01:26,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1335 transitions. [2023-08-26 19:01:26,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:01:26,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1335 transitions. [2023-08-26 19:01:26,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 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:01:26,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 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:01:26,827 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 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:01:26,827 INFO L175 Difference]: Start difference. First operand has 149 places, 161 transitions, 1144 flow. Second operand 5 states and 1335 transitions. [2023-08-26 19:01:26,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 129 transitions, 976 flow [2023-08-26 19:01:26,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 129 transitions, 850 flow, removed 46 selfloop flow, removed 13 redundant places. [2023-08-26 19:01:26,840 INFO L231 Difference]: Finished difference. Result has 98 places, 60 transitions, 296 flow [2023-08-26 19:01:26,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=98, PETRI_TRANSITIONS=60} [2023-08-26 19:01:26,841 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -4 predicate places. [2023-08-26 19:01:26,841 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 60 transitions, 296 flow [2023-08-26 19:01:26,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 253.66666666666666) internal successors, (2283), 9 states have internal predecessors, (2283), 0 states have call successors, (0), 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:01:26,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:01:26,841 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:01:26,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-26 19:01:27,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:01:27,050 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:01:27,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:01:27,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1878311785, now seen corresponding path program 1 times [2023-08-26 19:01:27,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:01:27,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942375379] [2023-08-26 19:01:27,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:01:27,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:01:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:01:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:01:27,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:01:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942375379] [2023-08-26 19:01:27,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942375379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:01:27,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:01:27,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:01:27,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829898668] [2023-08-26 19:01:27,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:01:27,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:01:27,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:01:27,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:01:27,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:01:27,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 596 [2023-08-26 19:01:27,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 60 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 198.4) internal successors, (992), 5 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:01:27,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:01:27,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 596 [2023-08-26 19:01:27,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:01:27,437 INFO L124 PetriNetUnfolderBase]: 736/1461 cut-off events. [2023-08-26 19:01:27,437 INFO L125 PetriNetUnfolderBase]: For 2531/2531 co-relation queries the response was YES. [2023-08-26 19:01:27,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4567 conditions, 1461 events. 736/1461 cut-off events. For 2531/2531 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8533 event pairs, 216 based on Foata normal form. 192/1501 useless extension candidates. Maximal degree in co-relation 4539. Up to 684 conditions per place. [2023-08-26 19:01:27,446 INFO L140 encePairwiseOnDemand]: 582/596 looper letters, 61 selfloop transitions, 17 changer transitions 5/90 dead transitions. [2023-08-26 19:01:27,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 90 transitions, 604 flow [2023-08-26 19:01:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:01:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:01:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1041 transitions. [2023-08-26 19:01:27,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3493288590604027 [2023-08-26 19:01:27,448 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1041 transitions. [2023-08-26 19:01:27,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1041 transitions. [2023-08-26 19:01:27,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:01:27,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1041 transitions. [2023-08-26 19:01:27,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 208.2) internal successors, (1041), 5 states have internal predecessors, (1041), 0 states have call successors, (0), 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:01:27,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 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:01:27,452 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 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:01:27,452 INFO L175 Difference]: Start difference. First operand has 98 places, 60 transitions, 296 flow. Second operand 5 states and 1041 transitions. [2023-08-26 19:01:27,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 90 transitions, 604 flow [2023-08-26 19:01:27,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 90 transitions, 565 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-26 19:01:27,456 INFO L231 Difference]: Finished difference. Result has 93 places, 66 transitions, 343 flow [2023-08-26 19:01:27,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=93, PETRI_TRANSITIONS=66} [2023-08-26 19:01:27,457 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -9 predicate places. [2023-08-26 19:01:27,457 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 66 transitions, 343 flow [2023-08-26 19:01:27,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 198.4) internal successors, (992), 5 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:01:27,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:01:27,458 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:01:27,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-26 19:01:27,458 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:01:27,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:01:27,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2097972432, now seen corresponding path program 1 times [2023-08-26 19:01:27,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:01:27,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369719858] [2023-08-26 19:01:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:01:27,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:01:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:01:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:01:32,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:01:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369719858] [2023-08-26 19:01:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369719858] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:01:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284268998] [2023-08-26 19:01:32,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:01:32,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:01:32,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:01:32,042 INFO L229 MonitoredProcess]: Starting monitored process 16 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:01:32,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-26 19:01:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:01:32,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 19:01:32,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:01:32,212 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:01:32,294 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:01:32,294 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:01:32,329 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:01:32,353 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:01:32,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:01:32,437 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:01:32,438 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:01:32,494 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:01:32,542 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 19:01:32,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:01:32,678 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-26 19:01:32,683 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-26 19:01:36,738 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_949 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_94| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_92| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_92| |v_t_funThread2of2ForFork0_~p~0#1.offset_94|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_946) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_94| v_ArrVal_949) |v_t_funThread1of2ForFork0_~p~0#1.offset_92|) 0))) is different from false [2023-08-26 19:01:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:01:36,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284268998] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:01:36,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:01:36,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 30 [2023-08-26 19:01:36,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360372298] [2023-08-26 19:01:36,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:01:36,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-26 19:01:36,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:01:36,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-26 19:01:36,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=773, Unknown=2, NotChecked=58, Total=992 [2023-08-26 19:01:36,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 596 [2023-08-26 19:01:36,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 66 transitions, 343 flow. Second operand has 32 states, 32 states have (on average 156.96875) internal successors, (5023), 32 states have internal predecessors, (5023), 0 states have call successors, (0), 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:01:36,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:01:36,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 596 [2023-08-26 19:01:36,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:01:38,221 INFO L124 PetriNetUnfolderBase]: 1008/1983 cut-off events. [2023-08-26 19:01:38,221 INFO L125 PetriNetUnfolderBase]: For 2875/2881 co-relation queries the response was YES. [2023-08-26 19:01:38,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6454 conditions, 1983 events. 1008/1983 cut-off events. For 2875/2881 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12411 event pairs, 173 based on Foata normal form. 12/1769 useless extension candidates. Maximal degree in co-relation 6427. Up to 784 conditions per place. [2023-08-26 19:01:38,229 INFO L140 encePairwiseOnDemand]: 584/596 looper letters, 78 selfloop transitions, 32 changer transitions 21/137 dead transitions. [2023-08-26 19:01:38,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 921 flow [2023-08-26 19:01:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-26 19:01:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-26 19:01:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3214 transitions. [2023-08-26 19:01:38,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2696308724832215 [2023-08-26 19:01:38,233 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3214 transitions. [2023-08-26 19:01:38,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3214 transitions. [2023-08-26 19:01:38,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:01:38,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3214 transitions. [2023-08-26 19:01:38,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 160.7) internal successors, (3214), 20 states have internal predecessors, (3214), 0 states have call successors, (0), 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:01:38,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 596.0) internal successors, (12516), 21 states have internal predecessors, (12516), 0 states have call successors, (0), 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:01:38,244 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 596.0) internal successors, (12516), 21 states have internal predecessors, (12516), 0 states have call successors, (0), 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:01:38,244 INFO L175 Difference]: Start difference. First operand has 93 places, 66 transitions, 343 flow. Second operand 20 states and 3214 transitions. [2023-08-26 19:01:38,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 921 flow [2023-08-26 19:01:38,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 137 transitions, 920 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:01:38,250 INFO L231 Difference]: Finished difference. Result has 116 places, 77 transitions, 523 flow [2023-08-26 19:01:38,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=523, PETRI_PLACES=116, PETRI_TRANSITIONS=77} [2023-08-26 19:01:38,251 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 14 predicate places. [2023-08-26 19:01:38,251 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 77 transitions, 523 flow [2023-08-26 19:01:38,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 156.96875) internal successors, (5023), 32 states have internal predecessors, (5023), 0 states have call successors, (0), 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:01:38,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:01:38,252 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:01:38,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-26 19:01:38,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-26 19:01:38,458 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:01:38,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:01:38,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1008414370, now seen corresponding path program 2 times [2023-08-26 19:01:38,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:01:38,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985107745] [2023-08-26 19:01:38,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:01:38,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:01:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:01:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:01:41,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:01:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985107745] [2023-08-26 19:01:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985107745] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:01:41,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252869387] [2023-08-26 19:01:41,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:01:41,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:01:41,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:01:41,678 INFO L229 MonitoredProcess]: Starting monitored process 17 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:01:41,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-26 19:01:41,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:01:41,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:01:41,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 19:01:41,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:01:41,816 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:01:41,898 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:01:41,898 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:01:41,930 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:01:41,948 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:01:41,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:01:42,024 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:01:42,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:01:42,088 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:01:42,134 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 19:01:42,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:01:42,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-26 19:01:42,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-26 19:01:48,333 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_96| Int) (v_ArrVal_1034 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_94| Int) (v_ArrVal_1031 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1031) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_96| v_ArrVal_1034) |v_t_funThread1of2ForFork0_~p~0#1.offset_94|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_94| |v_t_funThread2of2ForFork0_~p~0#1.offset_96|))) is different from false [2023-08-26 19:01:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:01:48,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252869387] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:01:48,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:01:48,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 30 [2023-08-26 19:01:48,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235109563] [2023-08-26 19:01:48,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:01:48,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-26 19:01:48,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:01:48,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-26 19:01:48,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=772, Unknown=2, NotChecked=58, Total=992 [2023-08-26 19:01:48,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 596 [2023-08-26 19:01:48,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 77 transitions, 523 flow. Second operand has 32 states, 32 states have (on average 158.96875) internal successors, (5087), 32 states have internal predecessors, (5087), 0 states have call successors, (0), 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:01:48,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:01:48,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 596 [2023-08-26 19:01:48,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:01:50,102 INFO L124 PetriNetUnfolderBase]: 1203/2418 cut-off events. [2023-08-26 19:01:50,102 INFO L125 PetriNetUnfolderBase]: For 7794/7812 co-relation queries the response was YES. [2023-08-26 19:01:50,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8970 conditions, 2418 events. 1203/2418 cut-off events. For 7794/7812 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16103 event pairs, 219 based on Foata normal form. 24/2176 useless extension candidates. Maximal degree in co-relation 8938. Up to 976 conditions per place. [2023-08-26 19:01:50,112 INFO L140 encePairwiseOnDemand]: 585/596 looper letters, 100 selfloop transitions, 40 changer transitions 25/171 dead transitions. [2023-08-26 19:01:50,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 171 transitions, 1333 flow [2023-08-26 19:01:50,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-26 19:01:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-26 19:01:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3913 transitions. [2023-08-26 19:01:50,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2735598434004474 [2023-08-26 19:01:50,122 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3913 transitions. [2023-08-26 19:01:50,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3913 transitions. [2023-08-26 19:01:50,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:01:50,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3913 transitions. [2023-08-26 19:01:50,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 163.04166666666666) internal successors, (3913), 24 states have internal predecessors, (3913), 0 states have call successors, (0), 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:01:50,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 596.0) internal successors, (14900), 25 states have internal predecessors, (14900), 0 states have call successors, (0), 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:01:50,137 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 596.0) internal successors, (14900), 25 states have internal predecessors, (14900), 0 states have call successors, (0), 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:01:50,137 INFO L175 Difference]: Start difference. First operand has 116 places, 77 transitions, 523 flow. Second operand 24 states and 3913 transitions. [2023-08-26 19:01:50,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 171 transitions, 1333 flow [2023-08-26 19:01:50,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 171 transitions, 1228 flow, removed 19 selfloop flow, removed 22 redundant places. [2023-08-26 19:01:50,153 INFO L231 Difference]: Finished difference. Result has 121 places, 92 transitions, 711 flow [2023-08-26 19:01:50,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=711, PETRI_PLACES=121, PETRI_TRANSITIONS=92} [2023-08-26 19:01:50,155 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 19 predicate places. [2023-08-26 19:01:50,155 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 92 transitions, 711 flow [2023-08-26 19:01:50,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 158.96875) internal successors, (5087), 32 states have internal predecessors, (5087), 0 states have call successors, (0), 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:01:50,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:01:50,156 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:01:50,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-26 19:01:50,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:01:50,373 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:01:50,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:01:50,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1450928020, now seen corresponding path program 1 times [2023-08-26 19:01:50,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:01:50,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583192570] [2023-08-26 19:01:50,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:01:50,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:01:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:01:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:01:53,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:01:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583192570] [2023-08-26 19:01:53,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583192570] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:01:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220415208] [2023-08-26 19:01:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:01:53,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:01:53,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:01:53,913 INFO L229 MonitoredProcess]: Starting monitored process 18 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:01:53,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-26 19:01:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:01:54,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-26 19:01:54,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:01:54,043 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:01:54,134 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:01:54,134 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:01:54,181 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:01:54,207 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:01:54,246 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:01:54,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:01:54,306 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:01:54,324 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:01:54,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:01:54,372 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:01:54,427 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:01:54,427 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:01:54,481 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 19:01:54,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:01:54,553 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_98| Int) (v_ArrVal_1122 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_98|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1122) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_98|)) 0)))) is different from false [2023-08-26 19:01:54,633 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:01:54,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 19:01:54,640 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:01:54,640 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 19:01:54,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 19:02:04,779 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1121 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_98| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_96| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_96| |v_t_funThread2of2ForFork0_~p~0#1.offset_98|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1116) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_96| v_ArrVal_1121) |v_t_funThread2of2ForFork0_~p~0#1.offset_98|) 0)))) is different from false [2023-08-26 19:02:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:02:06,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220415208] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:02:06,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:02:06,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 33 [2023-08-26 19:02:06,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388670400] [2023-08-26 19:02:06,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:02:06,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 19:02:06,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:02:06,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 19:02:06,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=861, Unknown=6, NotChecked=126, Total=1190 [2023-08-26 19:02:06,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 596 [2023-08-26 19:02:06,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 92 transitions, 711 flow. Second operand has 35 states, 35 states have (on average 156.8) internal successors, (5488), 35 states have internal predecessors, (5488), 0 states have call successors, (0), 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:06,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:02:06,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 596 [2023-08-26 19:02:06,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:02:08,347 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1121 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_98| Int) (v_ArrVal_1122 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1122) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_98|)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1121)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_98|) 0))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_98| Int)) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_98|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_98|)) 0))))) is different from false [2023-08-26 19:02:08,965 INFO L124 PetriNetUnfolderBase]: 1439/2890 cut-off events. [2023-08-26 19:02:08,966 INFO L125 PetriNetUnfolderBase]: For 11211/11241 co-relation queries the response was YES. [2023-08-26 19:02:08,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11077 conditions, 2890 events. 1439/2890 cut-off events. For 11211/11241 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 20094 event pairs, 257 based on Foata normal form. 12/2587 useless extension candidates. Maximal degree in co-relation 11050. Up to 1382 conditions per place. [2023-08-26 19:02:08,978 INFO L140 encePairwiseOnDemand]: 580/596 looper letters, 107 selfloop transitions, 45 changer transitions 21/179 dead transitions. [2023-08-26 19:02:08,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 179 transitions, 1506 flow [2023-08-26 19:02:08,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-26 19:02:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-26 19:02:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3697 transitions. [2023-08-26 19:02:08,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2696965275751386 [2023-08-26 19:02:08,983 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3697 transitions. [2023-08-26 19:02:08,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3697 transitions. [2023-08-26 19:02:08,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:02:08,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3697 transitions. [2023-08-26 19:02:08,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 160.7391304347826) internal successors, (3697), 23 states have internal predecessors, (3697), 0 states have call successors, (0), 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:08,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 596.0) internal successors, (14304), 24 states have internal predecessors, (14304), 0 states have call successors, (0), 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:08,997 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 596.0) internal successors, (14304), 24 states have internal predecessors, (14304), 0 states have call successors, (0), 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:08,997 INFO L175 Difference]: Start difference. First operand has 121 places, 92 transitions, 711 flow. Second operand 23 states and 3697 transitions. [2023-08-26 19:02:08,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 179 transitions, 1506 flow [2023-08-26 19:02:09,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 179 transitions, 1271 flow, removed 85 selfloop flow, removed 17 redundant places. [2023-08-26 19:02:09,025 INFO L231 Difference]: Finished difference. Result has 130 places, 109 transitions, 778 flow [2023-08-26 19:02:09,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=778, PETRI_PLACES=130, PETRI_TRANSITIONS=109} [2023-08-26 19:02:09,026 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 28 predicate places. [2023-08-26 19:02:09,026 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 109 transitions, 778 flow [2023-08-26 19:02:09,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 156.8) internal successors, (5488), 35 states have internal predecessors, (5488), 0 states have call successors, (0), 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:09,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:02:09,027 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:02:09,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-26 19:02:09,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:02:09,237 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:02:09,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:02:09,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1028867604, now seen corresponding path program 2 times [2023-08-26 19:02:09,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:02:09,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982880821] [2023-08-26 19:02:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:02:09,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:02:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:02:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:02:11,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:02:11,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982880821] [2023-08-26 19:02:11,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982880821] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:02:11,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699994583] [2023-08-26 19:02:11,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:02:11,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:02:11,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:02:11,886 INFO L229 MonitoredProcess]: Starting monitored process 19 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:02:11,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-26 19:02:12,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:02:12,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:02:12,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-26 19:02:12,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:02:12,109 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:02:12,202 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:02:12,202 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:02:12,231 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:02:12,259 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:02:12,294 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:02:12,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:02:12,352 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:02:12,397 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:02:12,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:02:12,440 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:02:12,490 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 19:02:12,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:02:12,630 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_100| Int) (v_ArrVal_1207 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1207)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_100|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1206) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_100|)) 0)))) is different from false [2023-08-26 19:02:12,648 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:02:12,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 19:02:12,656 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:02:12,656 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 19:02:12,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 19:02:28,774 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_100| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_98| Int) (v_ArrVal_1203 (Array Int Int)) (v_ArrVal_1207 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1203) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_98| v_ArrVal_1207) |v_t_funThread2of2ForFork0_~p~0#1.offset_100|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_98| |v_t_funThread2of2ForFork0_~p~0#1.offset_100|)))) is different from false [2023-08-26 19:02:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:02:30,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699994583] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:02:30,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:02:30,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 31 [2023-08-26 19:02:30,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925776366] [2023-08-26 19:02:30,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:02:30,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-26 19:02:30,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:02:30,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-26 19:02:30,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=795, Unknown=5, NotChecked=118, Total=1056 [2023-08-26 19:02:30,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 596 [2023-08-26 19:02:30,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 109 transitions, 778 flow. Second operand has 33 states, 33 states have (on average 156.9090909090909) internal successors, (5178), 33 states have internal predecessors, (5178), 0 states have call successors, (0), 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:30,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:02:30,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 596 [2023-08-26 19:02:30,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:02:33,109 INFO L124 PetriNetUnfolderBase]: 1587/3220 cut-off events. [2023-08-26 19:02:33,109 INFO L125 PetriNetUnfolderBase]: For 9153/9183 co-relation queries the response was YES. [2023-08-26 19:02:33,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12902 conditions, 3220 events. 1587/3220 cut-off events. For 9153/9183 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 23116 event pairs, 255 based on Foata normal form. 21/2897 useless extension candidates. Maximal degree in co-relation 12872. Up to 1663 conditions per place. [2023-08-26 19:02:33,124 INFO L140 encePairwiseOnDemand]: 584/596 looper letters, 141 selfloop transitions, 46 changer transitions 29/222 dead transitions. [2023-08-26 19:02:33,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 222 transitions, 1891 flow [2023-08-26 19:02:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-26 19:02:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-26 19:02:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4342 transitions. [2023-08-26 19:02:33,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26982351478995775 [2023-08-26 19:02:33,129 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4342 transitions. [2023-08-26 19:02:33,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4342 transitions. [2023-08-26 19:02:33,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:02:33,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4342 transitions. [2023-08-26 19:02:33,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 160.8148148148148) internal successors, (4342), 27 states have internal predecessors, (4342), 0 states have call successors, (0), 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:33,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 596.0) internal successors, (16688), 28 states have internal predecessors, (16688), 0 states have call successors, (0), 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:33,146 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 596.0) internal successors, (16688), 28 states have internal predecessors, (16688), 0 states have call successors, (0), 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:33,146 INFO L175 Difference]: Start difference. First operand has 130 places, 109 transitions, 778 flow. Second operand 27 states and 4342 transitions. [2023-08-26 19:02:33,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 222 transitions, 1891 flow [2023-08-26 19:02:33,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 222 transitions, 1718 flow, removed 68 selfloop flow, removed 15 redundant places. [2023-08-26 19:02:33,175 INFO L231 Difference]: Finished difference. Result has 145 places, 124 transitions, 908 flow [2023-08-26 19:02:33,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=908, PETRI_PLACES=145, PETRI_TRANSITIONS=124} [2023-08-26 19:02:33,175 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 43 predicate places. [2023-08-26 19:02:33,176 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 124 transitions, 908 flow [2023-08-26 19:02:33,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 156.9090909090909) internal successors, (5178), 33 states have internal predecessors, (5178), 0 states have call successors, (0), 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:33,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:02:33,177 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:02:33,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-26 19:02:33,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:02:33,382 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:02:33,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:02:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash 108931168, now seen corresponding path program 3 times [2023-08-26 19:02:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:02:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529250238] [2023-08-26 19:02:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:02:33,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:02:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:02:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:02:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:02:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529250238] [2023-08-26 19:02:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529250238] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:02:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871951384] [2023-08-26 19:02:43,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 19:02:43,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:02:43,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:02:43,160 INFO L229 MonitoredProcess]: Starting monitored process 20 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:02:43,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-26 19:02:43,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 19:02:43,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:02:43,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 19:02:43,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:02:43,309 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:02:43,397 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:02:43,398 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:02:43,430 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:02:43,452 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:02:43,492 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:02:43,544 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:02:43,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:02:43,610 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:02:43,661 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 19:02:43,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:02:43,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-26 19:02:43,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-26 19:02:49,858 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1292 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_102| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_100| Int) (v_ArrVal_1289 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_100| |v_t_funThread2of2ForFork0_~p~0#1.offset_102|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1289) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_100| v_ArrVal_1292) |v_t_funThread2of2ForFork0_~p~0#1.offset_102|) 0))) is different from false [2023-08-26 19:02:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:02:49,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871951384] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:02:49,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:02:49,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 29 [2023-08-26 19:02:49,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412163489] [2023-08-26 19:02:49,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:02:49,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-26 19:02:49,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:02:49,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-26 19:02:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=715, Unknown=2, NotChecked=56, Total=930 [2023-08-26 19:02:49,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 596 [2023-08-26 19:02:49,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 124 transitions, 908 flow. Second operand has 31 states, 31 states have (on average 160.03225806451613) internal successors, (4961), 31 states have internal predecessors, (4961), 0 states have call successors, (0), 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:49,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:02:49,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 596 [2023-08-26 19:02:49,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:02:51,291 INFO L124 PetriNetUnfolderBase]: 1600/3298 cut-off events. [2023-08-26 19:02:51,291 INFO L125 PetriNetUnfolderBase]: For 8402/8432 co-relation queries the response was YES. [2023-08-26 19:02:51,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13107 conditions, 3298 events. 1600/3298 cut-off events. For 8402/8432 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 24248 event pairs, 346 based on Foata normal form. 12/2958 useless extension candidates. Maximal degree in co-relation 13073. Up to 2020 conditions per place. [2023-08-26 19:02:51,307 INFO L140 encePairwiseOnDemand]: 585/596 looper letters, 124 selfloop transitions, 32 changer transitions 20/182 dead transitions. [2023-08-26 19:02:51,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 182 transitions, 1563 flow [2023-08-26 19:02:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 19:02:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 19:02:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3110 transitions. [2023-08-26 19:02:51,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2746379371246909 [2023-08-26 19:02:51,311 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3110 transitions. [2023-08-26 19:02:51,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3110 transitions. [2023-08-26 19:02:51,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:02:51,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3110 transitions. [2023-08-26 19:02:51,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 163.68421052631578) internal successors, (3110), 19 states have internal predecessors, (3110), 0 states have call successors, (0), 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:51,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 596.0) internal successors, (11920), 20 states have internal predecessors, (11920), 0 states have call successors, (0), 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:51,323 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 596.0) internal successors, (11920), 20 states have internal predecessors, (11920), 0 states have call successors, (0), 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:51,323 INFO L175 Difference]: Start difference. First operand has 145 places, 124 transitions, 908 flow. Second operand 19 states and 3110 transitions. [2023-08-26 19:02:51,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 182 transitions, 1563 flow [2023-08-26 19:02:51,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 182 transitions, 1485 flow, removed 8 selfloop flow, removed 19 redundant places. [2023-08-26 19:02:51,343 INFO L231 Difference]: Finished difference. Result has 147 places, 129 transitions, 960 flow [2023-08-26 19:02:51,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=960, PETRI_PLACES=147, PETRI_TRANSITIONS=129} [2023-08-26 19:02:51,344 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 45 predicate places. [2023-08-26 19:02:51,344 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 129 transitions, 960 flow [2023-08-26 19:02:51,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 160.03225806451613) internal successors, (4961), 31 states have internal predecessors, (4961), 0 states have call successors, (0), 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:51,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:02:51,345 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:02:51,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-26 19:02:51,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:02:51,551 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:02:51,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:02:51,551 INFO L85 PathProgramCache]: Analyzing trace with hash 661688336, now seen corresponding path program 3 times [2023-08-26 19:02:51,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:02:51,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763611582] [2023-08-26 19:02:51,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:02:51,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:02:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:02:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:02:54,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:02:54,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763611582] [2023-08-26 19:02:54,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763611582] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:02:54,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703363763] [2023-08-26 19:02:54,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 19:02:54,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:02:54,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:02:54,706 INFO L229 MonitoredProcess]: Starting monitored process 21 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:02:54,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-26 19:02:54,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 19:02:54,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:02:54,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-26 19:02:54,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:02:54,843 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:02:54,955 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:02:54,955 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:02:54,987 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:02:55,011 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:02:55,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:02:55,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:02:55,113 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:02:55,142 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:02:55,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:02:55,196 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:02:55,252 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:02:55,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:02:55,307 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 19:02:55,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:02:55,518 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:02:55,518 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 19:02:55,525 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:02:55,525 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 19:02:55,527 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 19:03:13,656 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1378 Int) (v_ArrVal_1374 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_102| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_104| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1374) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_104| v_ArrVal_1378) |v_t_funThread1of2ForFork0_~p~0#1.offset_102|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_102| |v_t_funThread2of2ForFork0_~p~0#1.offset_104|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-26 19:03:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 19:03:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703363763] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:03:15,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:03:15,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 33 [2023-08-26 19:03:15,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380755139] [2023-08-26 19:03:15,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:03:15,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 19:03:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:03:15,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 19:03:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=911, Unknown=7, NotChecked=64, Total=1190 [2023-08-26 19:03:15,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 596 [2023-08-26 19:03:15,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 129 transitions, 960 flow. Second operand has 35 states, 35 states have (on average 158.8) internal successors, (5558), 35 states have internal predecessors, (5558), 0 states have call successors, (0), 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:03:15,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:03:15,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 596 [2023-08-26 19:03:15,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:03:17,582 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_102| Int) (v_ArrVal_1380 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1380) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_102|)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_102|) 0))) (forall ((v_ArrVal_1378 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_102| Int) (v_ArrVal_1380 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1380) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_102|)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1378)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_102|) 0)))) is different from false [2023-08-26 19:03:17,860 INFO L124 PetriNetUnfolderBase]: 1676/3504 cut-off events. [2023-08-26 19:03:17,860 INFO L125 PetriNetUnfolderBase]: For 9403/9409 co-relation queries the response was YES. [2023-08-26 19:03:17,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13884 conditions, 3504 events. 1676/3504 cut-off events. For 9403/9409 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 26650 event pairs, 267 based on Foata normal form. 12/3148 useless extension candidates. Maximal degree in co-relation 13846. Up to 1937 conditions per place. [2023-08-26 19:03:17,877 INFO L140 encePairwiseOnDemand]: 582/596 looper letters, 120 selfloop transitions, 51 changer transitions 17/194 dead transitions. [2023-08-26 19:03:17,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 194 transitions, 1692 flow [2023-08-26 19:03:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 19:03:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 19:03:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3414 transitions. [2023-08-26 19:03:17,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27277085330776607 [2023-08-26 19:03:17,881 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3414 transitions. [2023-08-26 19:03:17,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3414 transitions. [2023-08-26 19:03:17,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:03:17,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3414 transitions. [2023-08-26 19:03:17,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 162.57142857142858) internal successors, (3414), 21 states have internal predecessors, (3414), 0 states have call successors, (0), 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:03:17,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 596.0) internal successors, (13112), 22 states have internal predecessors, (13112), 0 states have call successors, (0), 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:03:17,892 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 596.0) internal successors, (13112), 22 states have internal predecessors, (13112), 0 states have call successors, (0), 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:03:17,892 INFO L175 Difference]: Start difference. First operand has 147 places, 129 transitions, 960 flow. Second operand 21 states and 3414 transitions. [2023-08-26 19:03:17,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 194 transitions, 1692 flow [2023-08-26 19:03:17,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 194 transitions, 1621 flow, removed 8 selfloop flow, removed 15 redundant places. [2023-08-26 19:03:17,915 INFO L231 Difference]: Finished difference. Result has 155 places, 144 transitions, 1162 flow [2023-08-26 19:03:17,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1162, PETRI_PLACES=155, PETRI_TRANSITIONS=144} [2023-08-26 19:03:17,916 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 53 predicate places. [2023-08-26 19:03:17,916 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 144 transitions, 1162 flow [2023-08-26 19:03:17,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 158.8) internal successors, (5558), 35 states have internal predecessors, (5558), 0 states have call successors, (0), 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:03:17,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:03:17,917 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:03:17,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-26 19:03:18,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-08-26 19:03:18,122 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:03:18,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:03:18,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1692046400, now seen corresponding path program 4 times [2023-08-26 19:03:18,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:03:18,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554431761] [2023-08-26 19:03:18,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:03:18,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:03:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:03:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:03:24,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:03:24,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554431761] [2023-08-26 19:03:24,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554431761] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:03:24,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227562485] [2023-08-26 19:03:24,343 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 19:03:24,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:03:24,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:03:24,344 INFO L229 MonitoredProcess]: Starting monitored process 22 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:03:24,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-26 19:03:24,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 19:03:24,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:03:24,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-26 19:03:24,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:03:24,504 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:03:24,588 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:03:24,588 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:03:24,624 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:03:24,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:03:24,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:03:24,700 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:03:24,737 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:03:24,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:03:24,782 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:03:24,824 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:03:24,875 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:03:24,876 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:03:24,919 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 19:03:24,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:03:25,080 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_106| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1465)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_106|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1466) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_106|)) 0)))) is different from false [2023-08-26 19:03:25,114 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:03:25,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 19:03:25,121 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:03:25,121 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 19:03:25,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 19:03:25,472 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_106| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_104| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_104| v_ArrVal_1465)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_106|) 0))) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_106| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_104| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_104| |v_t_funThread2of2ForFork0_~p~0#1.offset_106|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_104| v_ArrVal_1465)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_106|) 0))))) is different from false [2023-08-26 19:03:25,498 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 Int) (v_ArrVal_1460 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_106| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_104| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_104| |v_t_funThread2of2ForFork0_~p~0#1.offset_106|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1460))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_104| v_ArrVal_1465))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_106|) 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 Int) (v_ArrVal_1460 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_106| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_104| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1460))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_104| v_ArrVal_1465))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_106|) 0)))) is different from false [2023-08-26 19:03:33,620 WARN L234 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:03:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-26 19:03:33,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227562485] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:03:33,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:03:33,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 33 [2023-08-26 19:03:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936481020] [2023-08-26 19:03:33,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:03:33,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 19:03:33,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:03:33,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 19:03:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=835, Unknown=3, NotChecked=186, Total=1190 [2023-08-26 19:03:33,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 596 [2023-08-26 19:03:33,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 144 transitions, 1162 flow. Second operand has 35 states, 35 states have (on average 158.8) internal successors, (5558), 35 states have internal predecessors, (5558), 0 states have call successors, (0), 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:03:33,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:03:33,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 596 [2023-08-26 19:03:33,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:03:35,564 INFO L124 PetriNetUnfolderBase]: 1666/3489 cut-off events. [2023-08-26 19:03:35,564 INFO L125 PetriNetUnfolderBase]: For 11137/11167 co-relation queries the response was YES. [2023-08-26 19:03:35,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14997 conditions, 3489 events. 1666/3489 cut-off events. For 11137/11167 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 26374 event pairs, 262 based on Foata normal form. 3/3135 useless extension candidates. Maximal degree in co-relation 14956. Up to 1682 conditions per place. [2023-08-26 19:03:35,580 INFO L140 encePairwiseOnDemand]: 587/596 looper letters, 133 selfloop transitions, 38 changer transitions 17/194 dead transitions. [2023-08-26 19:03:35,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 194 transitions, 1857 flow [2023-08-26 19:03:35,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 19:03:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 19:03:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3085 transitions. [2023-08-26 19:03:35,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2724302366654892 [2023-08-26 19:03:35,584 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3085 transitions. [2023-08-26 19:03:35,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3085 transitions. [2023-08-26 19:03:35,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:03:35,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3085 transitions. [2023-08-26 19:03:35,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 162.3684210526316) internal successors, (3085), 19 states have internal predecessors, (3085), 0 states have call successors, (0), 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:03:35,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 596.0) internal successors, (11920), 20 states have internal predecessors, (11920), 0 states have call successors, (0), 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:03:35,592 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 596.0) internal successors, (11920), 20 states have internal predecessors, (11920), 0 states have call successors, (0), 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:03:35,592 INFO L175 Difference]: Start difference. First operand has 155 places, 144 transitions, 1162 flow. Second operand 19 states and 3085 transitions. [2023-08-26 19:03:35,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 194 transitions, 1857 flow [2023-08-26 19:03:35,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 194 transitions, 1738 flow, removed 33 selfloop flow, removed 16 redundant places. [2023-08-26 19:03:35,615 INFO L231 Difference]: Finished difference. Result has 159 places, 147 transitions, 1170 flow [2023-08-26 19:03:35,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1170, PETRI_PLACES=159, PETRI_TRANSITIONS=147} [2023-08-26 19:03:35,615 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 57 predicate places. [2023-08-26 19:03:35,615 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 147 transitions, 1170 flow [2023-08-26 19:03:35,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 158.8) internal successors, (5558), 35 states have internal predecessors, (5558), 0 states have call successors, (0), 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:03:35,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:03:35,616 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:03:35,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-26 19:03:35,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-26 19:03:35,817 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:03:35,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:03:35,817 INFO L85 PathProgramCache]: Analyzing trace with hash 464121572, now seen corresponding path program 4 times [2023-08-26 19:03:35,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:03:35,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917760362] [2023-08-26 19:03:35,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:03:35,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:03:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:03:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 19:03:38,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:03:38,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917760362] [2023-08-26 19:03:38,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917760362] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:03:38,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290605077] [2023-08-26 19:03:38,618 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 19:03:38,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:03:38,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:03:38,619 INFO L229 MonitoredProcess]: Starting monitored process 23 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:03:38,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-26 19:03:38,764 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 19:03:38,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:03:38,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-26 19:03:38,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:03:38,770 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:03:38,833 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:03:38,833 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:03:38,860 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:03:38,876 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:03:38,895 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:03:38,943 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:03:38,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:03:39,004 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:03:39,056 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:03:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-26 19:03:39,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:03:39,116 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1557 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1557) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 19:03:39,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-26 19:03:39,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-26 19:03:40,431 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1552 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_106| Int) (v_ArrVal_1556 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_108| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1552))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_108| v_ArrVal_1556))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1557) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_106|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_106| |v_t_funThread2of2ForFork0_~p~0#1.offset_108|))) is different from false [2023-08-26 19:03:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-26 19:03:40,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290605077] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:03:40,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:03:40,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 7] total 30 [2023-08-26 19:03:40,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595759811] [2023-08-26 19:03:40,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:03:40,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-26 19:03:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:03:40,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-26 19:03:40,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=739, Unknown=19, NotChecked=114, Total=992 [2023-08-26 19:03:40,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 596 [2023-08-26 19:03:40,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 147 transitions, 1170 flow. Second operand has 32 states, 32 states have (on average 159.03125) internal successors, (5089), 32 states have internal predecessors, (5089), 0 states have call successors, (0), 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:03:40,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:03:40,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 596 [2023-08-26 19:03:40,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:04:10,874 WARN L234 SmtUtils]: Spent 30.11s on a formula simplification. DAG size of input: 45 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:04:13,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:04:15,444 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:04:17,451 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:04:19,453 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:04:21,534 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:04:23,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:04:25,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:04:27,559 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:04:29,561 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:04:32,179 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:04:34,188 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:04:36,193 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:04:38,208 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:04:40,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:04:42,224 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:04:44,229 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:04:46,243 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:04:48,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:04:50,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:04:52,527 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:04:54,535 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:04:56,567 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:04:58,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:05:00,595 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:05:03,159 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:05:05,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 [1] [2023-08-26 19:05:07,168 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:05:09,180 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:05:11,183 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:05:13,185 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:05:15,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:05:17,200 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:05:19,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:05:21,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:05:23,215 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:05:25,718 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:05:27,750 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:05:29,752 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:05:31,794 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:05:33,800 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:05:35,807 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:05:37,886 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:05:39,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:05:41,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:05:43,902 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:05:45,904 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:05:47,915 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:05:49,936 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:05:51,988 INFO L124 PetriNetUnfolderBase]: 1693/3615 cut-off events. [2023-08-26 19:05:51,988 INFO L125 PetriNetUnfolderBase]: For 10822/10846 co-relation queries the response was YES. [2023-08-26 19:05:52,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15342 conditions, 3615 events. 1693/3615 cut-off events. For 10822/10846 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 27853 event pairs, 351 based on Foata normal form. 8/3252 useless extension candidates. Maximal degree in co-relation 15299. Up to 2164 conditions per place. [2023-08-26 19:05:52,008 INFO L140 encePairwiseOnDemand]: 580/596 looper letters, 135 selfloop transitions, 34 changer transitions 50/225 dead transitions. [2023-08-26 19:05:52,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 225 transitions, 2042 flow [2023-08-26 19:05:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-26 19:05:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-26 19:05:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3902 transitions. [2023-08-26 19:05:52,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2727908277404922 [2023-08-26 19:05:52,012 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3902 transitions. [2023-08-26 19:05:52,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3902 transitions. [2023-08-26 19:05:52,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:05:52,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3902 transitions. [2023-08-26 19:05:52,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 162.58333333333334) internal successors, (3902), 24 states have internal predecessors, (3902), 0 states have call successors, (0), 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:05:52,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 596.0) internal successors, (14900), 25 states have internal predecessors, (14900), 0 states have call successors, (0), 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:05:52,023 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 596.0) internal successors, (14900), 25 states have internal predecessors, (14900), 0 states have call successors, (0), 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:05:52,023 INFO L175 Difference]: Start difference. First operand has 159 places, 147 transitions, 1170 flow. Second operand 24 states and 3902 transitions. [2023-08-26 19:05:52,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 225 transitions, 2042 flow [2023-08-26 19:05:52,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 225 transitions, 1968 flow, removed 5 selfloop flow, removed 17 redundant places. [2023-08-26 19:05:52,044 INFO L231 Difference]: Finished difference. Result has 173 places, 149 transitions, 1227 flow [2023-08-26 19:05:52,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1227, PETRI_PLACES=173, PETRI_TRANSITIONS=149} [2023-08-26 19:05:52,044 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 71 predicate places. [2023-08-26 19:05:52,044 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 149 transitions, 1227 flow [2023-08-26 19:05:52,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 159.03125) internal successors, (5089), 32 states have internal predecessors, (5089), 0 states have call successors, (0), 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:05:52,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:05:52,045 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:05:52,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-26 19:05:52,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:05:52,246 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:05:52,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:05:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1004501404, now seen corresponding path program 5 times [2023-08-26 19:05:52,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:05:52,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655914446] [2023-08-26 19:05:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:05:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:05:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:05:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:05:55,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:05:55,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655914446] [2023-08-26 19:05:55,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655914446] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:05:55,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198850603] [2023-08-26 19:05:55,041 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-26 19:05:55,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:05:55,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:05:55,042 INFO L229 MonitoredProcess]: Starting monitored process 24 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:05:55,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-26 19:05:55,594 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-26 19:05:55,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:05:55,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-26 19:05:55,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:05:55,603 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:05:55,690 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:05:55,690 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:05:55,722 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:05:55,747 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:05:55,762 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:05:55,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:05:55,827 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:05:55,923 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:05:55,923 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:05:55,970 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:05:56,023 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:05:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:05:56,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:05:56,332 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:05:56,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 19:05:56,340 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:05:56,341 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 19:05:56,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 19:05:56,372 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_1648 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_108| Int) (v_ArrVal_1647 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_108| v_ArrVal_1647)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1648) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1648 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_108| Int) (v_ArrVal_1647 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_108| v_ArrVal_1647)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1648) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_108| |v_t_funThread2of2ForFork0_~p~0#1.offset_110|))))) is different from false [2023-08-26 19:05:56,910 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1648 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (v_ArrVal_1642 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_108| Int) (v_ArrVal_1647 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_108| |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1642))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_108| v_ArrVal_1647))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1648) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0))) (or (forall ((v_ArrVal_1648 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (v_ArrVal_1642 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_108| Int) (v_ArrVal_1647 Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1642))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_108| v_ArrVal_1647))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1648) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-26 19:06:05,040 WARN L234 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:06:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-26 19:06:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198850603] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:06:05,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:06:05,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 33 [2023-08-26 19:06:05,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208038157] [2023-08-26 19:06:05,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:06:05,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 19:06:05,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:06:05,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 19:06:05,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=912, Unknown=31, NotChecked=126, Total=1190 [2023-08-26 19:06:05,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 596 [2023-08-26 19:06:05,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 149 transitions, 1227 flow. Second operand has 35 states, 35 states have (on average 158.9142857142857) internal successors, (5562), 35 states have internal predecessors, (5562), 0 states have call successors, (0), 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:06:05,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:06:05,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 596 [2023-08-26 19:06:05,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:06:24,584 WARN L234 SmtUtils]: Spent 18.80s on a formula simplification. DAG size of input: 50 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:06:26,586 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:06:28,594 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:06:31,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:06:33,136 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:06:35,137 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:06:37,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:06:39,143 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:06:41,145 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:06:43,147 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:06:45,149 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:06:47,151 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:06:49,154 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:06:51,156 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:06:53,159 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:06:55,171 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:06:57,172 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:06:59,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:07:01,176 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:07:03,178 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:07:05,792 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:07:08,729 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:07:10,737 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:07:12,752 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:07:14,754 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:07:16,755 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:07:18,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:07:20,777 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:07:22,797 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:07:24,807 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:07:26,809 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:07:28,824 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:07:31,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:07:33,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:07:35,464 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:07:37,465 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:07:39,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:07:41,490 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:07:44,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:07:46,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:07:48,534 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:07:50,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:07:52,555 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:07:54,577 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:07:56,601 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:07:58,614 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:08:00,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 [1] [2023-08-26 19:08:02,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:08:04,631 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:08:06,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:08:08,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:08:10,696 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:08:12,698 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:08:14,749 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:08:16,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:08:18,766 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:08:20,780 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:08:22,791 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:08:24,803 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:08:26,816 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:08:28,192 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (.cse0 (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (and (or (<= (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 28) 0) (not .cse0) (and (<= 280 |c_t_funThread2of2ForFork0_~p~0#1.offset|) (= 280 (select |c_#length| |c_t_funThread2of2ForFork0_~p~0#1.base|)))) (forall ((v_ArrVal_1648 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1647 Int)) (or (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1645) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_110|)))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1647)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1648) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (forall ((v_ArrVal_1648 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (v_ArrVal_1647 Int)) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_110|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1647)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1648) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1647)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1648) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) (or (and (= (select .cse1 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) .cse0) (exists ((|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1647 Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1647) (select |c_#memory_int| 4)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |t_funThread1of2ForFork0_~p~0#1.offset|)))))) is different from false [2023-08-26 19:08:28,325 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1648 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1648) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1647 Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1647)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1648) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-08-26 19:08:29,397 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 1) 0) (= (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (and (<= 280 |c_t_funThread2of2ForFork0_~p~0#1.offset|) (= 280 (select |c_#length| |c_t_funThread2of2ForFork0_~p~0#1.base|)))) (forall ((v_ArrVal_1648 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1648) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-08-26 19:08:30,557 INFO L124 PetriNetUnfolderBase]: 1913/4135 cut-off events. [2023-08-26 19:08:30,558 INFO L125 PetriNetUnfolderBase]: For 14736/14760 co-relation queries the response was YES. [2023-08-26 19:08:30,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18135 conditions, 4135 events. 1913/4135 cut-off events. For 14736/14760 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 33172 event pairs, 322 based on Foata normal form. 18/3733 useless extension candidates. Maximal degree in co-relation 18085. Up to 2134 conditions per place. [2023-08-26 19:08:30,583 INFO L140 encePairwiseOnDemand]: 573/596 looper letters, 173 selfloop transitions, 78 changer transitions 91/348 dead transitions. [2023-08-26 19:08:30,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 348 transitions, 3134 flow [2023-08-26 19:08:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-26 19:08:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-26 19:08:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 5888 transitions. [2023-08-26 19:08:30,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2744220730797912 [2023-08-26 19:08:30,589 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 5888 transitions. [2023-08-26 19:08:30,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 5888 transitions. [2023-08-26 19:08:30,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:08:30,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 5888 transitions. [2023-08-26 19:08:30,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 163.55555555555554) internal successors, (5888), 36 states have internal predecessors, (5888), 0 states have call successors, (0), 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:08:30,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 596.0) internal successors, (22052), 37 states have internal predecessors, (22052), 0 states have call successors, (0), 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:08:30,610 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 596.0) internal successors, (22052), 37 states have internal predecessors, (22052), 0 states have call successors, (0), 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:08:30,610 INFO L175 Difference]: Start difference. First operand has 173 places, 149 transitions, 1227 flow. Second operand 36 states and 5888 transitions. [2023-08-26 19:08:30,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 348 transitions, 3134 flow [2023-08-26 19:08:30,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 348 transitions, 3046 flow, removed 11 selfloop flow, removed 20 redundant places. [2023-08-26 19:08:30,651 INFO L231 Difference]: Finished difference. Result has 199 places, 191 transitions, 1764 flow [2023-08-26 19:08:30,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=1764, PETRI_PLACES=199, PETRI_TRANSITIONS=191} [2023-08-26 19:08:30,652 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 97 predicate places. [2023-08-26 19:08:30,652 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 191 transitions, 1764 flow [2023-08-26 19:08:30,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 158.9142857142857) internal successors, (5562), 35 states have internal predecessors, (5562), 0 states have call successors, (0), 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:08:30,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:08:30,653 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:08:30,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-26 19:08:30,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:08:30,859 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:08:30,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:08:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1931623984, now seen corresponding path program 6 times [2023-08-26 19:08:30,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:08:30,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687716204] [2023-08-26 19:08:30,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:08:30,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:08:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:08:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:08:33,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:08:33,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687716204] [2023-08-26 19:08:33,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687716204] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:08:33,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834521918] [2023-08-26 19:08:33,880 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-26 19:08:33,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:08:33,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:08:33,881 INFO L229 MonitoredProcess]: Starting monitored process 25 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:08:33,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-26 19:08:34,136 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-26 19:08:34,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:08:34,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-26 19:08:34,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:08:34,145 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:08:34,278 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:08:34,278 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:08:34,317 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:08:34,351 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:08:34,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:08:34,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:08:34,451 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:08:34,550 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:08:34,550 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:08:34,606 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:08:34,672 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:08:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 19:08:34,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:08:34,972 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_112| Int) (v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1739 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1738)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1739) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_112|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1736) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_112|)) 0)))) is different from false [2023-08-26 19:08:34,993 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:08:34,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 19:08:35,003 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:08:35,003 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 19:08:35,008 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 19:08:35,041 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_110| Int) (v_ArrVal_1738 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_112| Int) (v_ArrVal_1739 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_110| v_ArrVal_1738)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1739) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_112|) 0))) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_110| Int) (v_ArrVal_1738 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_112| Int) (v_ArrVal_1739 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_110| v_ArrVal_1738)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1739) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_112|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_110| |v_t_funThread2of2ForFork0_~p~0#1.offset_112|))))) is different from false [2023-08-26 19:08:35,071 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_110| Int) (v_ArrVal_1738 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_112| Int) (v_ArrVal_1733 (Array Int Int)) (v_ArrVal_1739 (Array Int Int))) (or (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1733))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_110| v_ArrVal_1738))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1739) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_112|)) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_110| |v_t_funThread2of2ForFork0_~p~0#1.offset_112|))) (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_110| Int) (v_ArrVal_1738 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_112| Int) (v_ArrVal_1733 (Array Int Int)) (v_ArrVal_1739 (Array Int Int))) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1733))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_110| v_ArrVal_1738))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1739) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_112|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-26 19:08:43,272 WARN L234 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:08:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-26 19:08:43,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834521918] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:08:43,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:08:43,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 33 [2023-08-26 19:08:43,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812191824] [2023-08-26 19:08:43,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:08:43,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 19:08:43,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:08:43,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 19:08:43,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=853, Unknown=31, NotChecked=186, Total=1190 [2023-08-26 19:08:43,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 596 [2023-08-26 19:08:43,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 191 transitions, 1764 flow. Second operand has 35 states, 35 states have (on average 156.9142857142857) internal successors, (5492), 35 states have internal predecessors, (5492), 0 states have call successors, (0), 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:08:43,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:08:43,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 596 [2023-08-26 19:08:43,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:08:47,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:08:49,036 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 1) 0) (= (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (<= (select |c_#length| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|)) (forall ((v_ArrVal_1739 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1739) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-08-26 19:08:49,072 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1739 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1739) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) (or (and (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_~#__global_lock~0.offset|)) (< |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_~#__global_lock~0.offset| 1)) (<= |c_~#__global_lock~0.offset| 0)) (= (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (<= (select |c_#length| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|))) is different from false [2023-08-26 19:08:49,610 INFO L124 PetriNetUnfolderBase]: 1936/4177 cut-off events. [2023-08-26 19:08:49,610 INFO L125 PetriNetUnfolderBase]: For 31056/31080 co-relation queries the response was YES. [2023-08-26 19:08:49,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23703 conditions, 4177 events. 1936/4177 cut-off events. For 31056/31080 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 33547 event pairs, 311 based on Foata normal form. 9/4020 useless extension candidates. Maximal degree in co-relation 23642. Up to 1945 conditions per place. [2023-08-26 19:08:49,642 INFO L140 encePairwiseOnDemand]: 577/596 looper letters, 171 selfloop transitions, 90 changer transitions 61/328 dead transitions. [2023-08-26 19:08:49,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 328 transitions, 3755 flow [2023-08-26 19:08:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-26 19:08:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-26 19:08:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5149 transitions. [2023-08-26 19:08:49,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26997692953020136 [2023-08-26 19:08:49,649 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5149 transitions. [2023-08-26 19:08:49,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5149 transitions. [2023-08-26 19:08:49,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:08:49,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5149 transitions. [2023-08-26 19:08:49,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 160.90625) internal successors, (5149), 32 states have internal predecessors, (5149), 0 states have call successors, (0), 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:08:49,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 596.0) internal successors, (19668), 33 states have internal predecessors, (19668), 0 states have call successors, (0), 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:08:49,672 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 596.0) internal successors, (19668), 33 states have internal predecessors, (19668), 0 states have call successors, (0), 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:08:49,672 INFO L175 Difference]: Start difference. First operand has 199 places, 191 transitions, 1764 flow. Second operand 32 states and 5149 transitions. [2023-08-26 19:08:49,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 328 transitions, 3755 flow [2023-08-26 19:08:49,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 328 transitions, 3608 flow, removed 46 selfloop flow, removed 23 redundant places. [2023-08-26 19:08:49,753 INFO L231 Difference]: Finished difference. Result has 211 places, 208 transitions, 2173 flow [2023-08-26 19:08:49,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2173, PETRI_PLACES=211, PETRI_TRANSITIONS=208} [2023-08-26 19:08:49,754 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 109 predicate places. [2023-08-26 19:08:49,754 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 208 transitions, 2173 flow [2023-08-26 19:08:49,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 156.9142857142857) internal successors, (5492), 35 states have internal predecessors, (5492), 0 states have call successors, (0), 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:08:49,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:08:49,755 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:08:49,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-26 19:08:49,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-26 19:08:49,956 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:08:49,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:08:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1028610428, now seen corresponding path program 7 times [2023-08-26 19:08:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:08:49,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092872715] [2023-08-26 19:08:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:08:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:08:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:09:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 19:09:41,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:09:41,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092872715] [2023-08-26 19:09:41,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092872715] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:09:41,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349770675] [2023-08-26 19:09:41,799 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-26 19:09:41,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:09:41,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:09:41,800 INFO L229 MonitoredProcess]: Starting monitored process 26 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:09:41,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-26 19:09:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:09:41,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-26 19:09:41,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:09:41,962 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:09:42,037 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:09:42,037 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:09:42,068 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:09:42,088 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:09:42,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:09:42,168 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:09:42,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:09:42,240 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:09:42,286 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:09:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-26 19:09:42,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:09:42,373 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1829 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1829) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 19:09:42,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-26 19:09:42,514 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-26 19:09:42,520 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_112| Int) (v_ArrVal_1827 Int) (v_ArrVal_1829 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_114| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_112| |v_t_funThread2of2ForFork0_~p~0#1.offset_114|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_112| v_ArrVal_1827)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1829) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_114|) 0))) is different from false [2023-08-26 19:09:42,539 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1824 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_112| Int) (v_ArrVal_1827 Int) (v_ArrVal_1829 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_114| Int)) (or (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1824))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_112| v_ArrVal_1827))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1829) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_114|)) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_112| |v_t_funThread2of2ForFork0_~p~0#1.offset_114|))) is different from false [2023-08-26 19:09:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-26 19:09:42,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349770675] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:09:42,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:09:42,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 7] total 31 [2023-08-26 19:09:42,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945326214] [2023-08-26 19:09:42,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:09:42,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-26 19:09:42,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:09:42,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-26 19:09:42,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=746, Unknown=9, NotChecked=174, Total=1056 [2023-08-26 19:09:42,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 596 [2023-08-26 19:09:42,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 208 transitions, 2173 flow. Second operand has 33 states, 33 states have (on average 158.96969696969697) internal successors, (5246), 33 states have internal predecessors, (5246), 0 states have call successors, (0), 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:09:42,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:09:42,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 596 [2023-08-26 19:09:42,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:09:44,584 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (or (and (= (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) .cse1) (= |c_~#__global_lock~0.offset| 0) (or (and (<= |c_t_funThread2of2ForFork0_~p~0#1.offset| 0) (not (= |c_t_funThread1of2ForFork0_~p~0#1.offset| 0))) (not .cse1)) (forall ((v_ArrVal_1827 Int) (v_ArrVal_1829 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1827)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1829) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-08-26 19:09:44,995 INFO L124 PetriNetUnfolderBase]: 1756/3859 cut-off events. [2023-08-26 19:09:44,996 INFO L125 PetriNetUnfolderBase]: For 38223/38247 co-relation queries the response was YES. [2023-08-26 19:09:45,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24110 conditions, 3859 events. 1756/3859 cut-off events. For 38223/38247 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 30888 event pairs, 362 based on Foata normal form. 5/3711 useless extension candidates. Maximal degree in co-relation 24045. Up to 2327 conditions per place. [2023-08-26 19:09:45,022 INFO L140 encePairwiseOnDemand]: 579/596 looper letters, 199 selfloop transitions, 41 changer transitions 35/281 dead transitions. [2023-08-26 19:09:45,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 281 transitions, 3517 flow [2023-08-26 19:09:45,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-26 19:09:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-26 19:09:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4058 transitions. [2023-08-26 19:09:45,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2723489932885906 [2023-08-26 19:09:45,026 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4058 transitions. [2023-08-26 19:09:45,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4058 transitions. [2023-08-26 19:09:45,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:09:45,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4058 transitions. [2023-08-26 19:09:45,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 162.32) internal successors, (4058), 25 states have internal predecessors, (4058), 0 states have call successors, (0), 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:09:45,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 596.0) internal successors, (15496), 26 states have internal predecessors, (15496), 0 states have call successors, (0), 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:09:45,037 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 596.0) internal successors, (15496), 26 states have internal predecessors, (15496), 0 states have call successors, (0), 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:09:45,037 INFO L175 Difference]: Start difference. First operand has 211 places, 208 transitions, 2173 flow. Second operand 25 states and 4058 transitions. [2023-08-26 19:09:45,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 281 transitions, 3517 flow [2023-08-26 19:09:45,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 281 transitions, 3330 flow, removed 48 selfloop flow, removed 24 redundant places. [2023-08-26 19:09:45,099 INFO L231 Difference]: Finished difference. Result has 216 places, 215 transitions, 2175 flow [2023-08-26 19:09:45,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1986, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2175, PETRI_PLACES=216, PETRI_TRANSITIONS=215} [2023-08-26 19:09:45,099 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 114 predicate places. [2023-08-26 19:09:45,099 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 215 transitions, 2175 flow [2023-08-26 19:09:45,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 158.96969696969697) internal successors, (5246), 33 states have internal predecessors, (5246), 0 states have call successors, (0), 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:09:45,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:09:45,100 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:09:45,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-08-26 19:09:45,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-26 19:09:45,301 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:09:45,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:09:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash -938368330, now seen corresponding path program 5 times [2023-08-26 19:09:45,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:09:45,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032017245] [2023-08-26 19:09:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:09:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:09:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:09:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 19:09:49,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:09:49,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032017245] [2023-08-26 19:09:49,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032017245] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:09:49,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168333737] [2023-08-26 19:09:49,564 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-26 19:09:49,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:09:49,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:09:49,565 INFO L229 MonitoredProcess]: Starting monitored process 27 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:09:49,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-26 19:09:50,175 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-26 19:09:50,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:09:50,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-26 19:09:50,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:09:50,186 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:09:50,290 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:09:50,290 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:09:50,332 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:09:50,362 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:09:50,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:09:50,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:09:50,481 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:09:50,541 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:09:50,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:09:50,596 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:09:50,660 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:09:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-26 19:09:50,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:09:50,736 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1920) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 19:09:50,966 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:09:50,967 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 19:09:50,975 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:09:50,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 19:09:50,980 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 19:09:51,004 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1918 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_116| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_114| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_116| v_ArrVal_1918)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1920) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_114|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_114| |v_t_funThread2of2ForFork0_~p~0#1.offset_116|))) (or (forall ((v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1918 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_116| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_114| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_116| v_ArrVal_1918)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1920) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_114|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-26 19:09:51,499 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1918 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_116| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_114| Int) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1914))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_116| v_ArrVal_1918))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1920) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_114|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1918 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_116| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_114| Int) (v_ArrVal_1914 (Array Int Int))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1914))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_116| v_ArrVal_1918))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1920) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_114|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_114| |v_t_funThread2of2ForFork0_~p~0#1.offset_116|)))) is different from false [2023-08-26 19:09:59,669 WARN L234 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:09:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-26 19:09:59,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168333737] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:09:59,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:09:59,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 8] total 32 [2023-08-26 19:09:59,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512080577] [2023-08-26 19:09:59,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:09:59,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-26 19:09:59,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:09:59,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-26 19:09:59,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=813, Unknown=19, NotChecked=180, Total=1122 [2023-08-26 19:09:59,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 596 [2023-08-26 19:09:59,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 215 transitions, 2175 flow. Second operand has 34 states, 34 states have (on average 156.91176470588235) internal successors, (5335), 34 states have internal predecessors, (5335), 0 states have call successors, (0), 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:09:59,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:09:59,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 596 [2023-08-26 19:09:59,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:10:34,949 WARN L234 SmtUtils]: Spent 34.36s on a formula simplification. DAG size of input: 51 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:10:36,952 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:10:38,953 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:10:40,963 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:10:42,976 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:10:44,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 [1] [2023-08-26 19:10:46,989 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:10:49,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:10:51,101 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:10:53,719 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:10:55,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:10:57,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:10:59,768 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:01,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:11:04,412 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:06,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:11:08,424 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:10,439 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:12,443 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:14,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:11:16,487 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:18,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:11:20,566 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:22,569 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:24,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:11:26,694 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:28,696 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:30,699 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:32,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:11:35,428 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:37,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:11:39,446 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:41,488 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:43,510 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:45,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:11:47,519 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:50,307 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:52,329 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,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:11:58,677 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,699 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:02,988 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:05,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 19:12:07,307 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:09,524 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:11,947 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:13,981 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:17,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:12:19,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 19:12:19,812 INFO L124 PetriNetUnfolderBase]: 1887/4161 cut-off events. [2023-08-26 19:12:19,812 INFO L125 PetriNetUnfolderBase]: For 39856/39868 co-relation queries the response was YES. [2023-08-26 19:12:19,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25446 conditions, 4161 events. 1887/4161 cut-off events. For 39856/39868 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 34083 event pairs, 325 based on Foata normal form. 16/3980 useless extension candidates. Maximal degree in co-relation 25377. Up to 1903 conditions per place. [2023-08-26 19:12:19,842 INFO L140 encePairwiseOnDemand]: 577/596 looper letters, 183 selfloop transitions, 38 changer transitions 129/356 dead transitions. [2023-08-26 19:12:19,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 356 transitions, 4072 flow [2023-08-26 19:12:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-26 19:12:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-26 19:12:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5156 transitions. [2023-08-26 19:12:19,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2703439597315436 [2023-08-26 19:12:19,846 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5156 transitions. [2023-08-26 19:12:19,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5156 transitions. [2023-08-26 19:12:19,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:12:19,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5156 transitions. [2023-08-26 19:12:19,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 161.125) internal successors, (5156), 32 states have internal predecessors, (5156), 0 states have call successors, (0), 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:12:19,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 596.0) internal successors, (19668), 33 states have internal predecessors, (19668), 0 states have call successors, (0), 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:12:19,860 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 596.0) internal successors, (19668), 33 states have internal predecessors, (19668), 0 states have call successors, (0), 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:12:19,860 INFO L175 Difference]: Start difference. First operand has 216 places, 215 transitions, 2175 flow. Second operand 32 states and 5156 transitions. [2023-08-26 19:12:19,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 356 transitions, 4072 flow [2023-08-26 19:12:19,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 356 transitions, 3976 flow, removed 20 selfloop flow, removed 17 redundant places. [2023-08-26 19:12:19,946 INFO L231 Difference]: Finished difference. Result has 238 places, 200 transitions, 2105 flow [2023-08-26 19:12:19,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2105, PETRI_PLACES=238, PETRI_TRANSITIONS=200} [2023-08-26 19:12:19,947 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 136 predicate places. [2023-08-26 19:12:19,947 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 200 transitions, 2105 flow [2023-08-26 19:12:19,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 156.91176470588235) internal successors, (5335), 34 states have internal predecessors, (5335), 0 states have call successors, (0), 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:12:19,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:12:19,948 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:12:19,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-26 19:12:20,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-08-26 19:12:20,149 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:12:20,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:12:20,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1137692834, now seen corresponding path program 6 times [2023-08-26 19:12:20,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:12:20,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572219117] [2023-08-26 19:12:20,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:12:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:12:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:12:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 19:12:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:12:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572219117] [2023-08-26 19:12:22,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572219117] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:12:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451564691] [2023-08-26 19:12:22,623 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-26 19:12:22,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:12:22,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:12:22,624 INFO L229 MonitoredProcess]: Starting monitored process 28 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:12:22,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-26 19:12:22,946 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-26 19:12:22,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:12:22,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-26 19:12:22,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:12:22,954 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:12:23,153 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-26 19:12:23,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-26 19:12:23,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:12:23,260 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:12:23,306 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 19:12:23,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:12:23,408 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:12:23,452 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:12:23,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 19:12:23,527 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:12:23,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 19:12:23,658 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:12:23,659 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 19:12:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-26 19:12:23,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:12:23,862 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2012 (Array Int Int)) (v_ArrVal_2011 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_116| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2012) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_116|)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2011) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_116|)) 0)))) is different from false [2023-08-26 19:12:23,871 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2010 Int) (v_ArrVal_2012 (Array Int Int)) (v_ArrVal_2011 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_116| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2011) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_116|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2010)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2012) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_116|) 0))) is different from false [2023-08-26 19:12:23,902 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:12:23,902 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 19:12:23,910 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 19:12:23,911 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 19:12:23,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 19:12:24,084 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_2010 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_118| Int) (v_ArrVal_2012 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_116| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_118| v_ArrVal_2010)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2012) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_116|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_116| |v_t_funThread2of2ForFork0_~p~0#1.offset_118|))) (or (forall ((v_ArrVal_2010 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_118| Int) (v_ArrVal_2012 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_116| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_118| v_ArrVal_2010)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2012) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_116|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-26 19:12:24,142 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_2010 Int) (v_ArrVal_2005 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_118| Int) (v_ArrVal_2012 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_116| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2005))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_118| v_ArrVal_2010))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2012) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_116|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_2010 Int) (v_ArrVal_2005 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_118| Int) (v_ArrVal_2012 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_116| Int)) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2005))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_118| v_ArrVal_2010))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2012) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_116|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_116| |v_t_funThread2of2ForFork0_~p~0#1.offset_118|)))) is different from false [2023-08-26 19:12:32,297 WARN L234 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:12:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-26 19:12:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451564691] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:12:32,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:12:32,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 33 [2023-08-26 19:12:32,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624057235] [2023-08-26 19:12:32,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:12:32,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 19:12:32,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:12:32,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 19:12:32,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=783, Unknown=4, NotChecked=244, Total=1190 [2023-08-26 19:12:32,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 596 [2023-08-26 19:12:32,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 200 transitions, 2105 flow. Second operand has 35 states, 35 states have (on average 155.85714285714286) internal successors, (5455), 35 states have internal predecessors, (5455), 0 states have call successors, (0), 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:12:32,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:12:32,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 596 [2023-08-26 19:12:32,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:12:35,343 INFO L124 PetriNetUnfolderBase]: 1428/3150 cut-off events. [2023-08-26 19:12:35,344 INFO L125 PetriNetUnfolderBase]: For 40248/40248 co-relation queries the response was YES. [2023-08-26 19:12:35,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21779 conditions, 3150 events. 1428/3150 cut-off events. For 40248/40248 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 24338 event pairs, 290 based on Foata normal form. 1/3043 useless extension candidates. Maximal degree in co-relation 21700. Up to 1754 conditions per place. [2023-08-26 19:12:35,369 INFO L140 encePairwiseOnDemand]: 586/596 looper letters, 184 selfloop transitions, 37 changer transitions 15/242 dead transitions. [2023-08-26 19:12:35,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 242 transitions, 3072 flow [2023-08-26 19:12:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 19:12:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 19:12:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3333 transitions. [2023-08-26 19:12:35,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26629913710450626 [2023-08-26 19:12:35,372 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3333 transitions. [2023-08-26 19:12:35,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3333 transitions. [2023-08-26 19:12:35,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:12:35,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3333 transitions. [2023-08-26 19:12:35,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 158.71428571428572) internal successors, (3333), 21 states have internal predecessors, (3333), 0 states have call successors, (0), 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:12:35,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 596.0) internal successors, (13112), 22 states have internal predecessors, (13112), 0 states have call successors, (0), 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:12:35,379 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 596.0) internal successors, (13112), 22 states have internal predecessors, (13112), 0 states have call successors, (0), 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:12:35,379 INFO L175 Difference]: Start difference. First operand has 238 places, 200 transitions, 2105 flow. Second operand 21 states and 3333 transitions. [2023-08-26 19:12:35,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 242 transitions, 3072 flow [2023-08-26 19:12:35,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 242 transitions, 2923 flow, removed 29 selfloop flow, removed 31 redundant places. [2023-08-26 19:12:35,439 INFO L231 Difference]: Finished difference. Result has 213 places, 202 transitions, 2067 flow [2023-08-26 19:12:35,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2067, PETRI_PLACES=213, PETRI_TRANSITIONS=202} [2023-08-26 19:12:35,440 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 111 predicate places. [2023-08-26 19:12:35,440 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 202 transitions, 2067 flow [2023-08-26 19:12:35,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 155.85714285714286) internal successors, (5455), 35 states have internal predecessors, (5455), 0 states have call successors, (0), 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:12:35,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:12:35,440 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, 1] [2023-08-26 19:12:35,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-26 19:12:35,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:12:35,641 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2023-08-26 19:12:35,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:12:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2131916309, now seen corresponding path program 1 times [2023-08-26 19:12:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:12:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914107432] [2023-08-26 19:12:35,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:12:35,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:12:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:12:35,974 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 19:12:35,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:12:35,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914107432] [2023-08-26 19:12:35,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914107432] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:12:35,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437599697] [2023-08-26 19:12:35,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:12:35,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:12:35,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:12:35,977 INFO L229 MonitoredProcess]: Starting monitored process 29 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:12:35,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-26 19:12:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:12:36,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-26 19:12:36,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:12:36,181 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:12:36,232 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:12:36,232 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:12:36,257 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:12:36,285 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:12:36,382 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 19:12:36,446 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 19:12:36,488 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 19:12:36,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-08-26 19:12:45,237 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:45,264 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:12:46,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-26 19:12:46,438 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-26 19:12:46,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-26 19:12:46,466 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10ASSERT_VIOLATIONASSERT (47 of 48 remaining) [2023-08-26 19:12:46,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-08-26 19:12:46,466 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-08-26 19:12:46,466 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 48 remaining) [2023-08-26 19:12:46,466 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 48 remaining) [2023-08-26 19:12:46,466 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 48 remaining) [2023-08-26 19:12:46,466 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 48 remaining) [2023-08-26 19:12:46,466 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10ASSERT_VIOLATIONASSERT (34 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 48 remaining) [2023-08-26 19:12:46,467 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (9 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10ASSERT_VIOLATIONASSERT (6 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 48 remaining) [2023-08-26 19:12:46,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 48 remaining) [2023-08-26 19:12:46,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 48 remaining) [2023-08-26 19:12:46,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 48 remaining) [2023-08-26 19:12:46,469 INFO L445 BasicCegarLoop]: Path program histogram: [7, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:12:46,469 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:46,470 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-26 19:12:46,470 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 19:12:46,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:12:46 BasicIcfg [2023-08-26 19:12:46,474 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 19:12:46,474 INFO L158 Benchmark]: Toolchain (without parser) took 811302.64ms. Allocated memory was 341.8MB in the beginning and 14.5GB in the end (delta: 14.1GB). Free memory was 315.9MB in the beginning and 12.1GB in the end (delta: -11.8GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-26 19:12:46,474 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 341.8MB. Free memory is still 318.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:12:46,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.83ms. Allocated memory is still 341.8MB. Free memory was 315.9MB in the beginning and 286.6MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 19:12:46,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.20ms. Allocated memory is still 341.8MB. Free memory was 286.1MB in the beginning and 283.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:12:46,475 INFO L158 Benchmark]: Boogie Preprocessor took 50.46ms. Allocated memory is still 341.8MB. Free memory was 283.5MB in the beginning and 281.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:12:46,475 INFO L158 Benchmark]: RCFGBuilder took 630.23ms. Allocated memory is still 341.8MB. Free memory was 281.4MB in the beginning and 313.0MB in the end (delta: -31.6MB). Peak memory consumption was 24.9MB. Max. memory is 16.0GB. [2023-08-26 19:12:46,475 INFO L158 Benchmark]: TraceAbstraction took 810043.90ms. Allocated memory was 341.8MB in the beginning and 14.5GB in the end (delta: 14.1GB). Free memory was 312.0MB in the beginning and 12.1GB in the end (delta: -11.8GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-26 19:12:46,476 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.14ms. Allocated memory is still 341.8MB. Free memory is still 318.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 510.83ms. Allocated memory is still 341.8MB. Free memory was 315.9MB in the beginning and 286.6MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.20ms. Allocated memory is still 341.8MB. Free memory was 286.1MB in the beginning and 283.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.46ms. Allocated memory is still 341.8MB. Free memory was 283.5MB in the beginning and 281.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 630.23ms. Allocated memory is still 341.8MB. Free memory was 281.4MB in the beginning and 313.0MB in the end (delta: -31.6MB). Peak memory consumption was 24.9MB. Max. memory is 16.0GB. * TraceAbstraction took 810043.90ms. Allocated memory was 341.8MB in the beginning and 14.5GB in the end (delta: 14.1GB). Free memory was 312.0MB in the beginning and 12.1GB in the end (delta: -11.8GB). Peak memory consumption was 2.4GB. 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.9s, 195 PlacesBefore, 70 PlacesAfterwards, 225 TransitionsBefore, 93 TransitionsAfterwards, 15744 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 146 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 22 ConcurrentYvCompositions, 7 ChoiceCompositions, 218 TotalNumberOfCompositions, 30675 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16574, independent: 16230, independent conditional: 0, independent unconditional: 16230, dependent: 344, dependent conditional: 0, dependent unconditional: 344, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8846, independent: 8763, independent conditional: 0, independent unconditional: 8763, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16574, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 261, dependent conditional: 0, dependent unconditional: 261, unknown: 8846, unknown conditional: 0, unknown unconditional: 8846] , Statistics on independence cache: Total cache size (in pairs): 518, Positive cache size: 480, Positive conditional cache size: 0, Positive unconditional cache size: 480, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 191 PlacesBefore, 69 PlacesAfterwards, 220 TransitionsBefore, 91 TransitionsAfterwards, 15744 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 149 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 20 ConcurrentYvCompositions, 7 ChoiceCompositions, 215 TotalNumberOfCompositions, 32994 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16172, independent: 15780, independent conditional: 0, independent unconditional: 15780, dependent: 392, dependent conditional: 0, dependent unconditional: 392, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8882, independent: 8804, independent conditional: 0, independent unconditional: 8804, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16172, independent: 6976, independent conditional: 0, independent unconditional: 6976, dependent: 314, dependent conditional: 0, dependent unconditional: 314, unknown: 8882, unknown conditional: 0, unknown unconditional: 8882] , Statistics on independence cache: Total cache size (in pairs): 457, Positive cache size: 420, Positive conditional cache size: 0, Positive unconditional cache size: 420, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 266 PlacesBefore, 102 PlacesAfterwards, 309 TransitionsBefore, 135 TransitionsAfterwards, 46740 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 206 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 31 ConcurrentYvCompositions, 10 ChoiceCompositions, 287 TotalNumberOfCompositions, 94266 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 43622, independent: 43065, independent conditional: 0, independent unconditional: 43065, dependent: 557, dependent conditional: 0, dependent unconditional: 557, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 24714, independent: 24584, independent conditional: 0, independent unconditional: 24584, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 43622, independent: 18481, independent conditional: 0, independent unconditional: 18481, dependent: 427, dependent conditional: 0, dependent unconditional: 427, unknown: 24714, unknown conditional: 0, unknown unconditional: 24714] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1013, Positive conditional cache size: 0, Positive unconditional cache size: 1013, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, 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 CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 262 locations, 38 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: 55.3s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 18.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 18.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 14 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1019 IncrementalHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 1 mSDtfsCounter, 1019 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 28.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=4, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 199 ConstructedInterpolants, 19 QuantifiedInterpolants, 1726 SizeOfPredicates, 6 NumberOfNonLiveVariables, 572 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 560/599 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 331 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: 749.8s, OverallIterations: 28, TraceHistogramMax: 10, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 480.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 839 mSolverCounterUnknown, 4603 SdHoareTripleChecker+Valid, 340.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4603 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 338.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5943 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 776 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21380 IncrementalHoareTripleChecker+Invalid, 28938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 776 mSolverCounterUnsat, 42 mSDtfsCounter, 21380 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 839 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1568 GetRequests, 808 SyntacticMatches, 33 SemanticMatches, 727 ConstructedPredicates, 38 IntricatePredicates, 0 DeprecatedPredicates, 4806 ImplicationChecksByTransitivity, 242.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2175occurred in iteration=25, InterpolantAutomatonStates: 403, 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.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 244.8s InterpolantComputationTime, 1133 NumberOfCodeBlocks, 1109 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 1559 ConstructedInterpolants, 445 QuantifiedInterpolants, 39117 SizeOfPredicates, 131 NumberOfNonLiveVariables, 4797 ConjunctsInSsa, 586 ConjunctsInUnsatCore, 67 InterpolantComputations, 8 PerfectInterpolantSequences, 2508/3384 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 262 locations, 38 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: 4.7s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 345 IncrementalHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 345 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=3, InterpolantAutomatonStates: 21, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 247 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 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