/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 04:02:10,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 04:02:10,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 04:02:10,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 04:02:10,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 04:02:10,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 04:02:10,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 04:02:10,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 04:02:10,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 04:02:10,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 04:02:10,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 04:02:10,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 04:02:10,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 04:02:10,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 04:02:10,264 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 04:02:10,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 04:02:10,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 04:02:10,265 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 04:02:10,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 04:02:10,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 04:02:10,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 04:02:10,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 04:02:10,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 04:02:10,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 04:02:10,267 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 04:02:10,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 04:02:10,267 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 04:02:10,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 04:02:10,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 04:02:10,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 04:02:10,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:02:10,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 04:02:10,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 04:02:10,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 04:02:10,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 04:02:10,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 04:02:10,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 04:02:10,270 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 04:02:10,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 04:02:10,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 04:02:10,271 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 04:02:10,271 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-08-04 04:02:10,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 04:02:10,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 04:02:10,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 04:02:10,537 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 04:02:10,538 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 04:02:10,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i [2023-08-04 04:02:11,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 04:02:11,974 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 04:02:11,974 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i [2023-08-04 04:02:11,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ffe02f23/bdf3e4ff47df47548df637138b38203b/FLAGb0cb87f22 [2023-08-04 04:02:12,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ffe02f23/bdf3e4ff47df47548df637138b38203b [2023-08-04 04:02:12,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 04:02:12,011 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 04:02:12,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 04:02:12,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 04:02:12,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 04:02:12,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcbdcef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12, skipping insertion in model container [2023-08-04 04:02:12,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,081 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 04:02:12,458 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i[47038,47051] [2023-08-04 04:02:12,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:02:12,515 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 04:02:12,545 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 04:02:12,546 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 04:02:12,578 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i[47038,47051] [2023-08-04 04:02:12,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:02:12,635 INFO L206 MainTranslator]: Completed translation [2023-08-04 04:02:12,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12 WrapperNode [2023-08-04 04:02:12,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 04:02:12,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 04:02:12,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 04:02:12,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 04:02:12,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,705 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 204 [2023-08-04 04:02:12,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 04:02:12,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 04:02:12,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 04:02:12,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 04:02:12,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,725 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 04:02:12,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 04:02:12,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 04:02:12,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 04:02:12,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (1/1) ... [2023-08-04 04:02:12,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:02:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:12,765 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-04 04:02:12,779 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-04 04:02:12,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 04:02:12,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 04:02:12,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 04:02:12,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 04:02:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 04:02:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 04:02:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-04 04:02:12,813 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-04 04:02:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 04:02:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 04:02:12,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 04:02:12,815 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 04:02:12,923 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 04:02:12,925 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 04:02:13,129 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 04:02:13,137 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 04:02:13,137 INFO L302 CfgBuilder]: Removed 22 assume(true) statements. [2023-08-04 04:02:13,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:02:13 BoogieIcfgContainer [2023-08-04 04:02:13,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 04:02:13,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 04:02:13,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 04:02:13,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 04:02:13,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 04:02:12" (1/3) ... [2023-08-04 04:02:13,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd817b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:02:13, skipping insertion in model container [2023-08-04 04:02:13,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:02:12" (2/3) ... [2023-08-04 04:02:13,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd817b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:02:13, skipping insertion in model container [2023-08-04 04:02:13,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:02:13" (3/3) ... [2023-08-04 04:02:13,145 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_79-equ_racefree_bound2.i [2023-08-04 04:02:13,152 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 04:02:13,160 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 04:02:13,160 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 04:02:13,161 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 04:02:13,251 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-04 04:02:13,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 201 transitions, 410 flow [2023-08-04 04:02:13,399 INFO L124 PetriNetUnfolderBase]: 43/271 cut-off events. [2023-08-04 04:02:13,399 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 04:02:13,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 271 events. 43/271 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 823 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 132. Up to 8 conditions per place. [2023-08-04 04:02:13,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 201 transitions, 410 flow [2023-08-04 04:02:13,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 194 transitions, 393 flow [2023-08-04 04:02:13,422 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:02:13,435 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 194 transitions, 393 flow [2023-08-04 04:02:13,439 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 194 transitions, 393 flow [2023-08-04 04:02:13,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 194 transitions, 393 flow [2023-08-04 04:02:13,496 INFO L124 PetriNetUnfolderBase]: 41/264 cut-off events. [2023-08-04 04:02:13,497 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:02:13,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 264 events. 41/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 803 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 132. Up to 8 conditions per place. [2023-08-04 04:02:13,505 INFO L119 LiptonReduction]: Number of co-enabled transitions 8664 [2023-08-04 04:02:20,689 INFO L134 LiptonReduction]: Checked pairs total: 18412 [2023-08-04 04:02:20,689 INFO L136 LiptonReduction]: Total number of compositions: 166 [2023-08-04 04:02:20,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:02:20,706 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=true, 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;@3f19d0a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:02:20,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 04:02:20,711 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:02:20,711 INFO L124 PetriNetUnfolderBase]: 7/29 cut-off events. [2023-08-04 04:02:20,712 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:02:20,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:20,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 04:02:20,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:02:20,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash 733617857, now seen corresponding path program 1 times [2023-08-04 04:02:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:20,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123172203] [2023-08-04 04:02:20,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:21,026 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-04 04:02:21,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:21,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123172203] [2023-08-04 04:02:21,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123172203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:02:21,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:02:21,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:02:21,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398553662] [2023-08-04 04:02:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:02:21,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:02:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:21,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:02:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:02:21,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 367 [2023-08-04 04:02:21,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 64 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:21,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:21,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 367 [2023-08-04 04:02:21,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:21,245 INFO L124 PetriNetUnfolderBase]: 274/651 cut-off events. [2023-08-04 04:02:21,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:02:21,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 651 events. 274/651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3505 event pairs, 0 based on Foata normal form. 119/685 useless extension candidates. Maximal degree in co-relation 1175. Up to 529 conditions per place. [2023-08-04 04:02:21,254 INFO L140 encePairwiseOnDemand]: 342/367 looper letters, 49 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-04 04:02:21,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 225 flow [2023-08-04 04:02:21,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:02:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:02:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2023-08-04 04:02:21,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367847411444142 [2023-08-04 04:02:21,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 591 transitions. [2023-08-04 04:02:21,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions. [2023-08-04 04:02:21,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:21,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions. [2023-08-04 04:02:21,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:21,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:21,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:21,299 INFO L175 Difference]: Start difference. First operand has 44 places, 64 transitions, 133 flow. Second operand 3 states and 591 transitions. [2023-08-04 04:02:21,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 225 flow [2023-08-04 04:02:21,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 225 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:02:21,304 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 97 flow [2023-08-04 04:02:21,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-04 04:02:21,310 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-08-04 04:02:21,310 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 97 flow [2023-08-04 04:02:21,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:21,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:21,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:21,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 04:02:21,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:02:21,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash 423867485, now seen corresponding path program 1 times [2023-08-04 04:02:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:21,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557207259] [2023-08-04 04:02:21,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:21,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:21,587 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-04 04:02:21,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:21,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557207259] [2023-08-04 04:02:21,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557207259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:02:21,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:02:21,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:02:21,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310780490] [2023-08-04 04:02:21,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:02:21,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 04:02:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:21,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 04:02:21,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 04:02:21,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 367 [2023-08-04 04:02:21,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 97 flow. Second operand has 4 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-04 04:02:21,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:21,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 367 [2023-08-04 04:02:21,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:21,890 INFO L124 PetriNetUnfolderBase]: 301/688 cut-off events. [2023-08-04 04:02:21,890 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-04 04:02:21,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 688 events. 301/688 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3609 event pairs, 130 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 1355. Up to 367 conditions per place. [2023-08-04 04:02:21,893 INFO L140 encePairwiseOnDemand]: 361/367 looper letters, 37 selfloop transitions, 3 changer transitions 25/72 dead transitions. [2023-08-04 04:02:21,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 290 flow [2023-08-04 04:02:21,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:02:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:02:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 717 transitions. [2023-08-04 04:02:21,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4884196185286104 [2023-08-04 04:02:21,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 717 transitions. [2023-08-04 04:02:21,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 717 transitions. [2023-08-04 04:02:21,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:21,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 717 transitions. [2023-08-04 04:02:21,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:21,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 367.0) internal successors, (1835), 5 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:21,904 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 367.0) internal successors, (1835), 5 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:21,904 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 97 flow. Second operand 4 states and 717 transitions. [2023-08-04 04:02:21,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 290 flow [2023-08-04 04:02:21,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:02:21,906 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 103 flow [2023-08-04 04:02:21,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-04 04:02:21,907 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-08-04 04:02:21,907 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 103 flow [2023-08-04 04:02:21,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-04 04:02:21,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:21,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:21,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 04:02:21,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:02:21,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:21,909 INFO L85 PathProgramCache]: Analyzing trace with hash 290818371, now seen corresponding path program 1 times [2023-08-04 04:02:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:21,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554606368] [2023-08-04 04:02:21,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:21,966 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-04 04:02:21,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554606368] [2023-08-04 04:02:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554606368] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:02:21,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045540420] [2023-08-04 04:02:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:21,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:21,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:21,973 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-04 04:02:21,981 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-04 04:02:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:22,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:02:22,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:02:22,541 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-04 04:02:22,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:02:22,558 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-04 04:02:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045540420] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:02:22,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:02:22,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 04:02:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529367964] [2023-08-04 04:02:22,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:02:22,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:02:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:22,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:02:22,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:02:22,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 367 [2023-08-04 04:02:22,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 170.2) internal successors, (851), 5 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:22,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:22,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 367 [2023-08-04 04:02:22,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:22,643 INFO L124 PetriNetUnfolderBase]: 32/89 cut-off events. [2023-08-04 04:02:22,643 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-04 04:02:22,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 89 events. 32/89 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 9 based on Foata normal form. 17/103 useless extension candidates. Maximal degree in co-relation 204. Up to 66 conditions per place. [2023-08-04 04:02:22,644 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2023-08-04 04:02:22,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 165 flow [2023-08-04 04:02:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:02:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:02:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 708 transitions. [2023-08-04 04:02:22,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4822888283378747 [2023-08-04 04:02:22,646 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 708 transitions. [2023-08-04 04:02:22,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 708 transitions. [2023-08-04 04:02:22,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:22,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 708 transitions. [2023-08-04 04:02:22,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:22,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 367.0) internal successors, (1835), 5 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:22,652 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 367.0) internal successors, (1835), 5 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:22,652 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 103 flow. Second operand 4 states and 708 transitions. [2023-08-04 04:02:22,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 165 flow [2023-08-04 04:02:22,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 37 transitions, 147 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-04 04:02:22,654 INFO L231 Difference]: Finished difference. Result has 27 places, 0 transitions, 0 flow [2023-08-04 04:02:22,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=45, PETRI_DIFFERENCE_MINUEND_PLACES=24, 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=4, PETRI_FLOW=0, PETRI_PLACES=27, PETRI_TRANSITIONS=0} [2023-08-04 04:02:22,655 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -17 predicate places. [2023-08-04 04:02:22,655 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 0 transitions, 0 flow [2023-08-04 04:02:22,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 170.2) internal successors, (851), 5 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:22,658 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 04:02:22,658 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 04:02:22,658 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 04:02:22,667 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-04 04:02:22,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:22,865 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 04:02:22,866 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 04:02:22,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 201 transitions, 410 flow [2023-08-04 04:02:22,903 INFO L124 PetriNetUnfolderBase]: 43/271 cut-off events. [2023-08-04 04:02:22,904 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 04:02:22,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 271 events. 43/271 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 823 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 132. Up to 8 conditions per place. [2023-08-04 04:02:22,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 201 transitions, 410 flow [2023-08-04 04:02:22,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 194 transitions, 393 flow [2023-08-04 04:02:22,906 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:02:22,907 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 194 transitions, 393 flow [2023-08-04 04:02:22,907 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 194 transitions, 393 flow [2023-08-04 04:02:22,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 194 transitions, 393 flow [2023-08-04 04:02:22,928 INFO L124 PetriNetUnfolderBase]: 41/264 cut-off events. [2023-08-04 04:02:22,929 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:02:22,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 264 events. 41/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 803 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 132. Up to 8 conditions per place. [2023-08-04 04:02:22,933 INFO L119 LiptonReduction]: Number of co-enabled transitions 8664 [2023-08-04 04:02:27,978 INFO L134 LiptonReduction]: Checked pairs total: 17867 [2023-08-04 04:02:27,978 INFO L136 LiptonReduction]: Total number of compositions: 161 [2023-08-04 04:02:27,980 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 04:02:27,987 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=true, 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;@3f19d0a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:02:27,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 04:02:27,992 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:02:27,993 INFO L124 PetriNetUnfolderBase]: 15/48 cut-off events. [2023-08-04 04:02:27,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:02:27,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:27,993 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 04:02:27,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 04:02:27,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:27,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1729354892, now seen corresponding path program 1 times [2023-08-04 04:02:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:27,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434405424] [2023-08-04 04:02:27,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:02:28,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 04:02:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:02:28,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 04:02:28,047 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 04:02:28,047 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 04:02:28,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 04:02:28,047 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 04:02:28,048 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 04:02:28,048 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 04:02:28,048 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 04:02:28,081 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-04 04:02:28,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 260 transitions, 538 flow [2023-08-04 04:02:28,121 INFO L124 PetriNetUnfolderBase]: 72/424 cut-off events. [2023-08-04 04:02:28,122 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 04:02:28,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 72/424 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1596 event pairs, 0 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 273. Up to 12 conditions per place. [2023-08-04 04:02:28,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 260 transitions, 538 flow [2023-08-04 04:02:28,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 258 transitions, 534 flow [2023-08-04 04:02:28,129 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:02:28,129 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 258 transitions, 534 flow [2023-08-04 04:02:28,129 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 258 transitions, 534 flow [2023-08-04 04:02:28,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 258 transitions, 534 flow [2023-08-04 04:02:28,167 INFO L124 PetriNetUnfolderBase]: 71/422 cut-off events. [2023-08-04 04:02:28,170 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 04:02:28,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 422 events. 71/422 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1612 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 271. Up to 12 conditions per place. [2023-08-04 04:02:28,190 INFO L119 LiptonReduction]: Number of co-enabled transitions 25080 [2023-08-04 04:02:33,347 INFO L134 LiptonReduction]: Checked pairs total: 52594 [2023-08-04 04:02:33,348 INFO L136 LiptonReduction]: Total number of compositions: 202 [2023-08-04 04:02:33,351 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:02:33,356 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=true, 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;@3f19d0a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:02:33,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 04:02:33,359 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:02:33,359 INFO L124 PetriNetUnfolderBase]: 6/23 cut-off events. [2023-08-04 04:02:33,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:02:33,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:33,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 04:02:33,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:02:33,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1384375003, now seen corresponding path program 1 times [2023-08-04 04:02:33,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:33,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136557767] [2023-08-04 04:02:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:33,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:33,415 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-04 04:02:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136557767] [2023-08-04 04:02:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136557767] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:02:33,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:02:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:02:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452911481] [2023-08-04 04:02:33,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:02:33,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:02:33,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:33,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:02:33,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:02:33,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 462 [2023-08-04 04:02:33,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 98 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:33,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:33,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 462 [2023-08-04 04:02:33,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:34,499 INFO L124 PetriNetUnfolderBase]: 8903/13936 cut-off events. [2023-08-04 04:02:34,500 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-08-04 04:02:34,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26898 conditions, 13936 events. 8903/13936 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 93113 event pairs, 6020 based on Foata normal form. 3325/15003 useless extension candidates. Maximal degree in co-relation 11579. Up to 12844 conditions per place. [2023-08-04 04:02:34,656 INFO L140 encePairwiseOnDemand]: 428/462 looper letters, 66 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-04 04:02:34,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 320 flow [2023-08-04 04:02:34,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:02:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:02:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2023-08-04 04:02:34,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425685425685426 [2023-08-04 04:02:34,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2023-08-04 04:02:34,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2023-08-04 04:02:34,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:34,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2023-08-04 04:02:34,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:34,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:34,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:34,665 INFO L175 Difference]: Start difference. First operand has 67 places, 98 transitions, 214 flow. Second operand 3 states and 752 transitions. [2023-08-04 04:02:34,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 320 flow [2023-08-04 04:02:34,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 83 transitions, 320 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:02:34,670 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 164 flow [2023-08-04 04:02:34,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2023-08-04 04:02:34,671 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 3 predicate places. [2023-08-04 04:02:34,671 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 164 flow [2023-08-04 04:02:34,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:34,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:34,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:34,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 04:02:34,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:02:34,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1508875475, now seen corresponding path program 1 times [2023-08-04 04:02:34,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:34,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072830352] [2023-08-04 04:02:34,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:34,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:34,820 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-04 04:02:34,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:34,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072830352] [2023-08-04 04:02:34,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072830352] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:02:34,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:02:34,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:02:34,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884686461] [2023-08-04 04:02:34,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:02:34,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 04:02:34,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:34,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 04:02:34,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 04:02:34,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 462 [2023-08-04 04:02:34,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 207.5) internal successors, (830), 4 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:34,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:34,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 462 [2023-08-04 04:02:34,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:36,166 INFO L124 PetriNetUnfolderBase]: 10858/17603 cut-off events. [2023-08-04 04:02:36,166 INFO L125 PetriNetUnfolderBase]: For 754/754 co-relation queries the response was YES. [2023-08-04 04:02:36,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35008 conditions, 17603 events. 10858/17603 cut-off events. For 754/754 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 128189 event pairs, 3224 based on Foata normal form. 0/15413 useless extension candidates. Maximal degree in co-relation 34900. Up to 10872 conditions per place. [2023-08-04 04:02:36,256 INFO L140 encePairwiseOnDemand]: 449/462 looper letters, 115 selfloop transitions, 12 changer transitions 8/150 dead transitions. [2023-08-04 04:02:36,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 150 transitions, 626 flow [2023-08-04 04:02:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:02:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:02:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 961 transitions. [2023-08-04 04:02:36,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.520021645021645 [2023-08-04 04:02:36,260 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 961 transitions. [2023-08-04 04:02:36,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 961 transitions. [2023-08-04 04:02:36,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:36,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 961 transitions. [2023-08-04 04:02:36,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 240.25) internal successors, (961), 4 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:36,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 462.0) internal successors, (2310), 5 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:36,325 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 462.0) internal successors, (2310), 5 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:36,325 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 164 flow. Second operand 4 states and 961 transitions. [2023-08-04 04:02:36,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 150 transitions, 626 flow [2023-08-04 04:02:36,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 150 transitions, 623 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:02:36,330 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 262 flow [2023-08-04 04:02:36,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2023-08-04 04:02:36,331 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 8 predicate places. [2023-08-04 04:02:36,331 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 262 flow [2023-08-04 04:02:36,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 207.5) internal successors, (830), 4 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:36,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:36,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:36,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 04:02:36,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:02:36,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:36,333 INFO L85 PathProgramCache]: Analyzing trace with hash 283198393, now seen corresponding path program 1 times [2023-08-04 04:02:36,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:36,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007271469] [2023-08-04 04:02:36,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:36,386 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-04 04:02:36,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:36,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007271469] [2023-08-04 04:02:36,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007271469] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:02:36,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837757244] [2023-08-04 04:02:36,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:36,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:36,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:36,393 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-04 04:02:36,399 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-04 04:02:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:36,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:02:36,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:02:36,525 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-04 04:02:36,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:02:36,537 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-04 04:02:36,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837757244] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:02:36,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:02:36,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 04:02:36,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432773194] [2023-08-04 04:02:36,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:02:36,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:02:36,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:36,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:02:36,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:02:36,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 462 [2023-08-04 04:02:36,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 262 flow. Second operand has 5 states, 5 states have (on average 215.2) internal successors, (1076), 5 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:36,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:36,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 462 [2023-08-04 04:02:36,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:37,837 INFO L124 PetriNetUnfolderBase]: 10608/17914 cut-off events. [2023-08-04 04:02:37,837 INFO L125 PetriNetUnfolderBase]: For 5053/5053 co-relation queries the response was YES. [2023-08-04 04:02:37,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40297 conditions, 17914 events. 10608/17914 cut-off events. For 5053/5053 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 137887 event pairs, 826 based on Foata normal form. 15/16691 useless extension candidates. Maximal degree in co-relation 8249. Up to 14949 conditions per place. [2023-08-04 04:02:37,922 INFO L140 encePairwiseOnDemand]: 458/462 looper letters, 110 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2023-08-04 04:02:37,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 129 transitions, 646 flow [2023-08-04 04:02:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:02:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:02:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 950 transitions. [2023-08-04 04:02:37,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140692640692641 [2023-08-04 04:02:37,926 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 950 transitions. [2023-08-04 04:02:37,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 950 transitions. [2023-08-04 04:02:37,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:37,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 950 transitions. [2023-08-04 04:02:37,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 237.5) internal successors, (950), 4 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:37,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 462.0) internal successors, (2310), 5 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:37,945 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 462.0) internal successors, (2310), 5 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:37,945 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 262 flow. Second operand 4 states and 950 transitions. [2023-08-04 04:02:37,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 129 transitions, 646 flow [2023-08-04 04:02:37,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 129 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:02:37,958 INFO L231 Difference]: Finished difference. Result has 80 places, 80 transitions, 284 flow [2023-08-04 04:02:37,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=80, PETRI_TRANSITIONS=80} [2023-08-04 04:02:37,959 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2023-08-04 04:02:37,959 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 284 flow [2023-08-04 04:02:37,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 215.2) internal successors, (1076), 5 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:37,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:37,960 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:37,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 04:02:38,160 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,SelfDestructingSolverStorable6 [2023-08-04 04:02:38,160 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:02:38,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:38,161 INFO L85 PathProgramCache]: Analyzing trace with hash -491962152, now seen corresponding path program 1 times [2023-08-04 04:02:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:38,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273788146] [2023-08-04 04:02:38,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:38,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:38,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:38,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273788146] [2023-08-04 04:02:38,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273788146] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:02:38,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463502463] [2023-08-04 04:02:38,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:38,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:38,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:38,554 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-04 04:02:38,557 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-04 04:02:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:38,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-04 04:02:38,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:02:38,721 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 116 [2023-08-04 04:02:38,753 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-04 04:02:38,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 121 treesize of output 130 [2023-08-04 04:02:38,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2023-08-04 04:02:38,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2023-08-04 04:02:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:39,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:02:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463502463] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:02:39,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:02:39,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2023-08-04 04:02:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158566004] [2023-08-04 04:02:39,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:02:39,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 04:02:39,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:39,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 04:02:39,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=31, Unknown=4, NotChecked=0, Total=56 [2023-08-04 04:02:39,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 462 [2023-08-04 04:02:39,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 284 flow. Second operand has 8 states, 8 states have (on average 175.75) internal successors, (1406), 8 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:39,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:39,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 462 [2023-08-04 04:02:39,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:41,004 INFO L124 PetriNetUnfolderBase]: 12343/20356 cut-off events. [2023-08-04 04:02:41,004 INFO L125 PetriNetUnfolderBase]: For 9468/9486 co-relation queries the response was YES. [2023-08-04 04:02:41,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47882 conditions, 20356 events. 12343/20356 cut-off events. For 9468/9486 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 153498 event pairs, 4235 based on Foata normal form. 6/19076 useless extension candidates. Maximal degree in co-relation 21805. Up to 13604 conditions per place. [2023-08-04 04:02:41,066 INFO L140 encePairwiseOnDemand]: 453/462 looper letters, 116 selfloop transitions, 10 changer transitions 25/166 dead transitions. [2023-08-04 04:02:41,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 166 transitions, 850 flow [2023-08-04 04:02:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 04:02:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 04:02:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 999 transitions. [2023-08-04 04:02:41,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43246753246753245 [2023-08-04 04:02:41,071 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 999 transitions. [2023-08-04 04:02:41,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 999 transitions. [2023-08-04 04:02:41,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:41,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 999 transitions. [2023-08-04 04:02:41,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 199.8) internal successors, (999), 5 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:41,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 462.0) internal successors, (2772), 6 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:41,078 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 462.0) internal successors, (2772), 6 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:41,078 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 284 flow. Second operand 5 states and 999 transitions. [2023-08-04 04:02:41,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 166 transitions, 850 flow [2023-08-04 04:02:41,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 166 transitions, 843 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 04:02:41,089 INFO L231 Difference]: Finished difference. Result has 86 places, 83 transitions, 343 flow [2023-08-04 04:02:41,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=86, PETRI_TRANSITIONS=83} [2023-08-04 04:02:41,090 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 19 predicate places. [2023-08-04 04:02:41,090 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 343 flow [2023-08-04 04:02:41,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 175.75) internal successors, (1406), 8 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:41,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:41,091 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:41,099 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-04 04:02:41,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:41,296 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:02:41,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash 799128076, now seen corresponding path program 1 times [2023-08-04 04:02:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:41,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210418031] [2023-08-04 04:02:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:41,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:41,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210418031] [2023-08-04 04:02:41,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210418031] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:02:41,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948200065] [2023-08-04 04:02:41,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:41,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:41,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:41,395 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-04 04:02:41,397 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-04 04:02:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:41,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-04 04:02:41,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:02:41,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 04:02:41,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:02:41,537 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:02:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:41,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:02:41,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948200065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:02:41,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:02:41,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2023-08-04 04:02:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414337400] [2023-08-04 04:02:41,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:02:41,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:02:41,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:41,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:02:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-04 04:02:41,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 462 [2023-08-04 04:02:41,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 343 flow. Second operand has 5 states, 5 states have (on average 195.8) internal successors, (979), 5 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:41,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:41,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 462 [2023-08-04 04:02:41,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:42,606 INFO L124 PetriNetUnfolderBase]: 8307/15069 cut-off events. [2023-08-04 04:02:42,606 INFO L125 PetriNetUnfolderBase]: For 9045/9045 co-relation queries the response was YES. [2023-08-04 04:02:42,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37812 conditions, 15069 events. 8307/15069 cut-off events. For 9045/9045 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 117470 event pairs, 3046 based on Foata normal form. 1690/15705 useless extension candidates. Maximal degree in co-relation 23047. Up to 7968 conditions per place. [2023-08-04 04:02:42,654 INFO L140 encePairwiseOnDemand]: 442/462 looper letters, 101 selfloop transitions, 20 changer transitions 4/134 dead transitions. [2023-08-04 04:02:42,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 134 transitions, 827 flow [2023-08-04 04:02:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:02:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:02:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 877 transitions. [2023-08-04 04:02:42,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4745670995670996 [2023-08-04 04:02:42,657 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 877 transitions. [2023-08-04 04:02:42,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 877 transitions. [2023-08-04 04:02:42,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:42,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 877 transitions. [2023-08-04 04:02:42,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 219.25) internal successors, (877), 4 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:42,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 462.0) internal successors, (2310), 5 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:42,664 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 462.0) internal successors, (2310), 5 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:42,664 INFO L175 Difference]: Start difference. First operand has 86 places, 83 transitions, 343 flow. Second operand 4 states and 877 transitions. [2023-08-04 04:02:42,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 134 transitions, 827 flow [2023-08-04 04:02:42,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 134 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:02:42,686 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 425 flow [2023-08-04 04:02:42,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=425, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2023-08-04 04:02:42,688 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 22 predicate places. [2023-08-04 04:02:42,688 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 425 flow [2023-08-04 04:02:42,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 195.8) internal successors, (979), 5 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:42,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:42,689 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:42,697 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-04 04:02:42,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:42,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:02:42,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash -445906667, now seen corresponding path program 1 times [2023-08-04 04:02:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:42,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46577997] [2023-08-04 04:02:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:42,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:42,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46577997] [2023-08-04 04:02:42,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46577997] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:02:42,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:02:42,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 04:02:42,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881162997] [2023-08-04 04:02:42,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:02:42,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:02:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:42,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:02:42,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:02:43,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 462 [2023-08-04 04:02:43,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:43,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:43,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 462 [2023-08-04 04:02:43,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:44,227 INFO L124 PetriNetUnfolderBase]: 10084/19168 cut-off events. [2023-08-04 04:02:44,228 INFO L125 PetriNetUnfolderBase]: For 15675/15683 co-relation queries the response was YES. [2023-08-04 04:02:44,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53945 conditions, 19168 events. 10084/19168 cut-off events. For 15675/15683 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 170032 event pairs, 3684 based on Foata normal form. 229/17967 useless extension candidates. Maximal degree in co-relation 36805. Up to 11962 conditions per place. [2023-08-04 04:02:44,315 INFO L140 encePairwiseOnDemand]: 448/462 looper letters, 122 selfloop transitions, 19 changer transitions 5/161 dead transitions. [2023-08-04 04:02:44,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 161 transitions, 1066 flow [2023-08-04 04:02:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:02:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:02:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2023-08-04 04:02:44,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5086580086580087 [2023-08-04 04:02:44,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2023-08-04 04:02:44,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2023-08-04 04:02:44,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:44,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2023-08-04 04:02:44,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:44,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:44,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:44,323 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 425 flow. Second operand 3 states and 705 transitions. [2023-08-04 04:02:44,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 161 transitions, 1066 flow [2023-08-04 04:02:44,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 161 transitions, 1065 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:02:44,350 INFO L231 Difference]: Finished difference. Result has 91 places, 107 transitions, 593 flow [2023-08-04 04:02:44,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=91, PETRI_TRANSITIONS=107} [2023-08-04 04:02:44,352 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 24 predicate places. [2023-08-04 04:02:44,352 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 107 transitions, 593 flow [2023-08-04 04:02:44,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:44,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:44,352 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:44,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 04:02:44,353 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:02:44,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1289784363, now seen corresponding path program 2 times [2023-08-04 04:02:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:44,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356810576] [2023-08-04 04:02:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:44,474 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-04 04:02:44,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:44,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356810576] [2023-08-04 04:02:44,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356810576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:02:44,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:02:44,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 04:02:44,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723849656] [2023-08-04 04:02:44,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:02:44,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:02:44,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:44,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:02:44,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:02:44,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 462 [2023-08-04 04:02:44,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 107 transitions, 593 flow. Second operand has 5 states, 5 states have (on average 202.8) internal successors, (1014), 5 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:44,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:44,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 462 [2023-08-04 04:02:44,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:45,428 INFO L124 PetriNetUnfolderBase]: 5625/11514 cut-off events. [2023-08-04 04:02:45,429 INFO L125 PetriNetUnfolderBase]: For 12672/12682 co-relation queries the response was YES. [2023-08-04 04:02:45,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35454 conditions, 11514 events. 5625/11514 cut-off events. For 12672/12682 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 100575 event pairs, 1444 based on Foata normal form. 259/11145 useless extension candidates. Maximal degree in co-relation 32265. Up to 6872 conditions per place. [2023-08-04 04:02:45,469 INFO L140 encePairwiseOnDemand]: 456/462 looper letters, 139 selfloop transitions, 11 changer transitions 12/177 dead transitions. [2023-08-04 04:02:45,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 177 transitions, 1297 flow [2023-08-04 04:02:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:02:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:02:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 902 transitions. [2023-08-04 04:02:45,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2023-08-04 04:02:45,473 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 902 transitions. [2023-08-04 04:02:45,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 902 transitions. [2023-08-04 04:02:45,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:45,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 902 transitions. [2023-08-04 04:02:45,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:45,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 462.0) internal successors, (2310), 5 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:45,478 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 462.0) internal successors, (2310), 5 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:45,478 INFO L175 Difference]: Start difference. First operand has 91 places, 107 transitions, 593 flow. Second operand 4 states and 902 transitions. [2023-08-04 04:02:45,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 177 transitions, 1297 flow [2023-08-04 04:02:45,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 177 transitions, 1278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:02:45,498 INFO L231 Difference]: Finished difference. Result has 94 places, 108 transitions, 610 flow [2023-08-04 04:02:45,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=610, PETRI_PLACES=94, PETRI_TRANSITIONS=108} [2023-08-04 04:02:45,499 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 27 predicate places. [2023-08-04 04:02:45,499 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 108 transitions, 610 flow [2023-08-04 04:02:45,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 202.8) internal successors, (1014), 5 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:45,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:45,500 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:45,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 04:02:45,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:02:45,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash -262785069, now seen corresponding path program 1 times [2023-08-04 04:02:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:45,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804117937] [2023-08-04 04:02:45,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:45,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:46,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:46,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804117937] [2023-08-04 04:02:46,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804117937] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:02:46,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914511074] [2023-08-04 04:02:46,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:46,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:46,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:46,031 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-04 04:02:46,035 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-04 04:02:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:46,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-04 04:02:46,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:02:46,245 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 114 [2023-08-04 04:02:46,269 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:02:46,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 116 [2023-08-04 04:02:46,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:02:46,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 14 treesize of output 16 [2023-08-04 04:02:46,557 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 11 treesize of output 7 [2023-08-04 04:02:46,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:02:46,617 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-04 04:02:46,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:02:46,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:02:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:46,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:02:46,704 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_312) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:02:46,753 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 20 treesize of output 14 [2023-08-04 04:02:46,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:46,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914511074] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:02:46,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:02:46,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-04 04:02:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116582573] [2023-08-04 04:02:46,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:02:46,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-04 04:02:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:46,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-04 04:02:46,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=156, Unknown=1, NotChecked=26, Total=240 [2023-08-04 04:02:47,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 462 [2023-08-04 04:02:47,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 108 transitions, 610 flow. Second operand has 16 states, 16 states have (on average 144.0) internal successors, (2304), 16 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:47,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:47,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 462 [2023-08-04 04:02:47,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:50,415 INFO L124 PetriNetUnfolderBase]: 8852/17745 cut-off events. [2023-08-04 04:02:50,415 INFO L125 PetriNetUnfolderBase]: For 22390/22434 co-relation queries the response was YES. [2023-08-04 04:02:50,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56650 conditions, 17745 events. 8852/17745 cut-off events. For 22390/22434 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 159808 event pairs, 2052 based on Foata normal form. 273/16981 useless extension candidates. Maximal degree in co-relation 46844. Up to 4773 conditions per place. [2023-08-04 04:02:50,620 INFO L140 encePairwiseOnDemand]: 422/462 looper letters, 284 selfloop transitions, 107 changer transitions 218/618 dead transitions. [2023-08-04 04:02:50,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 618 transitions, 4429 flow [2023-08-04 04:02:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-04 04:02:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-04 04:02:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3885 transitions. [2023-08-04 04:02:50,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3503787878787879 [2023-08-04 04:02:50,632 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3885 transitions. [2023-08-04 04:02:50,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3885 transitions. [2023-08-04 04:02:50,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:50,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3885 transitions. [2023-08-04 04:02:50,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 161.875) internal successors, (3885), 24 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:50,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 462.0) internal successors, (11550), 25 states have internal predecessors, (11550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:50,660 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 462.0) internal successors, (11550), 25 states have internal predecessors, (11550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:50,660 INFO L175 Difference]: Start difference. First operand has 94 places, 108 transitions, 610 flow. Second operand 24 states and 3885 transitions. [2023-08-04 04:02:50,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 618 transitions, 4429 flow [2023-08-04 04:02:50,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 618 transitions, 4428 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:02:50,689 INFO L231 Difference]: Finished difference. Result has 133 places, 209 transitions, 1841 flow [2023-08-04 04:02:50,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1841, PETRI_PLACES=133, PETRI_TRANSITIONS=209} [2023-08-04 04:02:50,690 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 66 predicate places. [2023-08-04 04:02:50,690 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 209 transitions, 1841 flow [2023-08-04 04:02:50,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 144.0) internal successors, (2304), 16 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:50,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:50,697 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:50,703 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-04 04:02:50,902 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-04 04:02:50,902 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:02:50,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:50,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1286896161, now seen corresponding path program 1 times [2023-08-04 04:02:50,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:50,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993833828] [2023-08-04 04:02:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:50,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:51,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993833828] [2023-08-04 04:02:51,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993833828] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:02:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922953322] [2023-08-04 04:02:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:51,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:51,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:51,575 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-04 04:02:51,578 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-04 04:02:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:51,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-04 04:02:51,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:02:51,757 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:02:51,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 122 [2023-08-04 04:02:51,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 104 treesize of output 104 [2023-08-04 04:02:51,867 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 47 treesize of output 47 [2023-08-04 04:02:51,998 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 47 treesize of output 47 [2023-08-04 04:02:52,095 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 11 treesize of output 7 [2023-08-04 04:02:52,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:02:52,202 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:02:52,313 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 47 treesize of output 47 [2023-08-04 04:02:52,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:02:52,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:02:52,439 INFO L322 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-08-04 04:02:52,440 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 15 treesize of output 11 [2023-08-04 04:02:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:52,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:02:52,549 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_369 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_369) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_368 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#A~0.base| v_ArrVal_368) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0))) is different from false [2023-08-04 04:02:52,590 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:02:52,590 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 21 treesize of output 22 [2023-08-04 04:02:52,598 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:02:52,598 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 35 treesize of output 38 [2023-08-04 04:02:52,603 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 20 treesize of output 18 [2023-08-04 04:02:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-08-04 04:02:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922953322] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:02:52,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:02:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2023-08-04 04:02:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699279751] [2023-08-04 04:02:52,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:02:52,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 04:02:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:52,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 04:02:52,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=240, Unknown=2, NotChecked=32, Total=342 [2023-08-04 04:02:52,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 462 [2023-08-04 04:02:52,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 209 transitions, 1841 flow. Second operand has 19 states, 19 states have (on average 143.68421052631578) internal successors, (2730), 19 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:52,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:52,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 462 [2023-08-04 04:02:52,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:56,220 INFO L124 PetriNetUnfolderBase]: 6929/15336 cut-off events. [2023-08-04 04:02:56,220 INFO L125 PetriNetUnfolderBase]: For 58850/58903 co-relation queries the response was YES. [2023-08-04 04:02:56,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65060 conditions, 15336 events. 6929/15336 cut-off events. For 58850/58903 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 143322 event pairs, 3306 based on Foata normal form. 195/15015 useless extension candidates. Maximal degree in co-relation 58865. Up to 8611 conditions per place. [2023-08-04 04:02:56,301 INFO L140 encePairwiseOnDemand]: 444/462 looper letters, 333 selfloop transitions, 82 changer transitions 96/520 dead transitions. [2023-08-04 04:02:56,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 520 transitions, 5235 flow [2023-08-04 04:02:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-04 04:02:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-04 04:02:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2565 transitions. [2023-08-04 04:02:56,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3469967532467532 [2023-08-04 04:02:56,308 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2565 transitions. [2023-08-04 04:02:56,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2565 transitions. [2023-08-04 04:02:56,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:56,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2565 transitions. [2023-08-04 04:02:56,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 160.3125) internal successors, (2565), 16 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:56,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 462.0) internal successors, (7854), 17 states have internal predecessors, (7854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:56,323 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 462.0) internal successors, (7854), 17 states have internal predecessors, (7854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:56,323 INFO L175 Difference]: Start difference. First operand has 133 places, 209 transitions, 1841 flow. Second operand 16 states and 2565 transitions. [2023-08-04 04:02:56,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 520 transitions, 5235 flow [2023-08-04 04:02:56,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 520 transitions, 5070 flow, removed 67 selfloop flow, removed 3 redundant places. [2023-08-04 04:02:56,584 INFO L231 Difference]: Finished difference. Result has 150 places, 250 transitions, 2502 flow [2023-08-04 04:02:56,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=1735, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2502, PETRI_PLACES=150, PETRI_TRANSITIONS=250} [2023-08-04 04:02:56,585 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 83 predicate places. [2023-08-04 04:02:56,585 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 250 transitions, 2502 flow [2023-08-04 04:02:56,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.68421052631578) internal successors, (2730), 19 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:56,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:56,586 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:56,593 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-04 04:02:56,791 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-04 04:02:56,792 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:02:56,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:56,792 INFO L85 PathProgramCache]: Analyzing trace with hash -811833180, now seen corresponding path program 1 times [2023-08-04 04:02:56,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:56,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047793261] [2023-08-04 04:02:56,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:56,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:57,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:57,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047793261] [2023-08-04 04:02:57,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047793261] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:02:57,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020827007] [2023-08-04 04:02:57,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:57,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:57,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:57,055 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-04 04:02:57,058 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-04 04:02:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:57,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-04 04:02:57,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:02:57,226 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 116 [2023-08-04 04:02:57,244 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:02:57,244 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 118 [2023-08-04 04:02:57,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:02:57,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:02:57,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:02:57,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:02:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:57,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:02:57,433 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_441) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:02:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-04 04:02:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020827007] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:02:57,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:02:57,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 11 [2023-08-04 04:02:57,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962775336] [2023-08-04 04:02:57,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:02:57,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 04:02:57,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:57,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 04:02:57,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2023-08-04 04:02:57,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 462 [2023-08-04 04:02:57,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 250 transitions, 2502 flow. Second operand has 13 states, 13 states have (on average 166.23076923076923) internal successors, (2161), 13 states have internal predecessors, (2161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:57,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:57,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 462 [2023-08-04 04:02:57,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:59,022 INFO L124 PetriNetUnfolderBase]: 5100/11770 cut-off events. [2023-08-04 04:02:59,022 INFO L125 PetriNetUnfolderBase]: For 52822/52909 co-relation queries the response was YES. [2023-08-04 04:02:59,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49413 conditions, 11770 events. 5100/11770 cut-off events. For 52822/52909 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 109470 event pairs, 2492 based on Foata normal form. 74/11342 useless extension candidates. Maximal degree in co-relation 48825. Up to 7454 conditions per place. [2023-08-04 04:02:59,106 INFO L140 encePairwiseOnDemand]: 451/462 looper letters, 276 selfloop transitions, 36 changer transitions 75/404 dead transitions. [2023-08-04 04:02:59,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 404 transitions, 4487 flow [2023-08-04 04:02:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-04 04:02:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-04 04:02:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1631 transitions. [2023-08-04 04:02:59,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39225589225589225 [2023-08-04 04:02:59,110 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1631 transitions. [2023-08-04 04:02:59,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1631 transitions. [2023-08-04 04:02:59,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:59,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1631 transitions. [2023-08-04 04:02:59,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 181.22222222222223) internal successors, (1631), 9 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:59,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 462.0) internal successors, (4620), 10 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:59,118 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 462.0) internal successors, (4620), 10 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:59,119 INFO L175 Difference]: Start difference. First operand has 150 places, 250 transitions, 2502 flow. Second operand 9 states and 1631 transitions. [2023-08-04 04:02:59,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 404 transitions, 4487 flow [2023-08-04 04:02:59,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 404 transitions, 4307 flow, removed 77 selfloop flow, removed 4 redundant places. [2023-08-04 04:02:59,391 INFO L231 Difference]: Finished difference. Result has 157 places, 259 transitions, 2568 flow [2023-08-04 04:02:59,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2568, PETRI_PLACES=157, PETRI_TRANSITIONS=259} [2023-08-04 04:02:59,392 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 90 predicate places. [2023-08-04 04:02:59,392 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 259 transitions, 2568 flow [2023-08-04 04:02:59,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.23076923076923) internal successors, (2161), 13 states have internal predecessors, (2161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:02:59,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:59,393 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:59,401 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-04 04:02:59,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:59,599 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:02:59,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1896164585, now seen corresponding path program 1 times [2023-08-04 04:02:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:59,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921544505] [2023-08-04 04:02:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:02:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921544505] [2023-08-04 04:02:59,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921544505] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:02:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342338894] [2023-08-04 04:02:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:59,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:59,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:59,861 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-04 04:02:59,889 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-04 04:02:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:59,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-04 04:02:59,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:03:00,041 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 116 [2023-08-04 04:03:00,061 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:03:00,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 118 [2023-08-04 04:03:00,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:03:00,112 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:03:00,154 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:03:00,187 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:03:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:03:00,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:03:00,245 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_509) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:03:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-04 04:03:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342338894] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:03:00,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:03:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-04 04:03:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975911098] [2023-08-04 04:03:00,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:03:00,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 04:03:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:00,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 04:03:00,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=100, Unknown=1, NotChecked=20, Total=156 [2023-08-04 04:03:00,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 462 [2023-08-04 04:03:00,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 259 transitions, 2568 flow. Second operand has 13 states, 13 states have (on average 166.46153846153845) internal successors, (2164), 13 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:00,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:00,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 462 [2023-08-04 04:03:00,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:01,946 INFO L124 PetriNetUnfolderBase]: 5020/11869 cut-off events. [2023-08-04 04:03:01,946 INFO L125 PetriNetUnfolderBase]: For 52101/52204 co-relation queries the response was YES. [2023-08-04 04:03:02,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49893 conditions, 11869 events. 5020/11869 cut-off events. For 52101/52204 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 111670 event pairs, 2515 based on Foata normal form. 82/11462 useless extension candidates. Maximal degree in co-relation 46960. Up to 7478 conditions per place. [2023-08-04 04:03:02,039 INFO L140 encePairwiseOnDemand]: 450/462 looper letters, 237 selfloop transitions, 34 changer transitions 136/424 dead transitions. [2023-08-04 04:03:02,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 424 transitions, 4642 flow [2023-08-04 04:03:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 04:03:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 04:03:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2310 transitions. [2023-08-04 04:03:02,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2023-08-04 04:03:02,045 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2310 transitions. [2023-08-04 04:03:02,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2310 transitions. [2023-08-04 04:03:02,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:03:02,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2310 transitions. [2023-08-04 04:03:02,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 177.69230769230768) internal successors, (2310), 13 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:02,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 462.0) internal successors, (6468), 14 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:02,056 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 462.0) internal successors, (6468), 14 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:02,056 INFO L175 Difference]: Start difference. First operand has 157 places, 259 transitions, 2568 flow. Second operand 13 states and 2310 transitions. [2023-08-04 04:03:02,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 424 transitions, 4642 flow [2023-08-04 04:03:02,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 424 transitions, 4585 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-04 04:03:02,222 INFO L231 Difference]: Finished difference. Result has 173 places, 239 transitions, 2396 flow [2023-08-04 04:03:02,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=2502, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2396, PETRI_PLACES=173, PETRI_TRANSITIONS=239} [2023-08-04 04:03:02,223 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 106 predicate places. [2023-08-04 04:03:02,223 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 239 transitions, 2396 flow [2023-08-04 04:03:02,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.46153846153845) internal successors, (2164), 13 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:02,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:02,224 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:03:02,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 04:03:02,428 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,SelfDestructingSolverStorable14 [2023-08-04 04:03:02,429 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:03:02,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:02,429 INFO L85 PathProgramCache]: Analyzing trace with hash -397158808, now seen corresponding path program 1 times [2023-08-04 04:03:02,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:02,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915232516] [2023-08-04 04:03:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:03:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:03,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915232516] [2023-08-04 04:03:03,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915232516] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:03:03,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135335130] [2023-08-04 04:03:03,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:03,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:03:03,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:03:03,097 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-04 04:03:03,117 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-04 04:03:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:03,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-04 04:03:03,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:03:03,309 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-04 04:03:03,310 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 132 [2023-08-04 04:03:03,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 102 [2023-08-04 04:03:03,385 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:03:03,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:03:03,702 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-04 04:03:03,801 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-04 04:03:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:03:03,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:03:04,262 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_581))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_580) |c_~#A~0.base|) |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-04 04:03:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-04 04:03:04,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135335130] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:03:04,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:03:04,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2023-08-04 04:03:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862860848] [2023-08-04 04:03:04,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:03:04,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 04:03:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:04,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 04:03:04,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=325, Unknown=11, NotChecked=38, Total=462 [2023-08-04 04:03:04,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 462 [2023-08-04 04:03:04,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 239 transitions, 2396 flow. Second operand has 22 states, 22 states have (on average 163.72727272727272) internal successors, (3602), 22 states have internal predecessors, (3602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:04,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:04,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 462 [2023-08-04 04:03:04,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:06,519 INFO L124 PetriNetUnfolderBase]: 4221/10373 cut-off events. [2023-08-04 04:03:06,519 INFO L125 PetriNetUnfolderBase]: For 48029/48116 co-relation queries the response was YES. [2023-08-04 04:03:06,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44320 conditions, 10373 events. 4221/10373 cut-off events. For 48029/48116 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 98504 event pairs, 2327 based on Foata normal form. 18/9888 useless extension candidates. Maximal degree in co-relation 42691. Up to 6600 conditions per place. [2023-08-04 04:03:06,588 INFO L140 encePairwiseOnDemand]: 449/462 looper letters, 298 selfloop transitions, 50 changer transitions 65/430 dead transitions. [2023-08-04 04:03:06,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 430 transitions, 4700 flow [2023-08-04 04:03:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-04 04:03:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-04 04:03:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3438 transitions. [2023-08-04 04:03:06,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37207792207792206 [2023-08-04 04:03:06,591 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3438 transitions. [2023-08-04 04:03:06,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3438 transitions. [2023-08-04 04:03:06,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:03:06,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3438 transitions. [2023-08-04 04:03:06,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 171.9) internal successors, (3438), 20 states have internal predecessors, (3438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:06,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 462.0) internal successors, (9702), 21 states have internal predecessors, (9702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:06,606 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 462.0) internal successors, (9702), 21 states have internal predecessors, (9702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:06,606 INFO L175 Difference]: Start difference. First operand has 173 places, 239 transitions, 2396 flow. Second operand 20 states and 3438 transitions. [2023-08-04 04:03:06,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 430 transitions, 4700 flow [2023-08-04 04:03:06,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 430 transitions, 4596 flow, removed 35 selfloop flow, removed 6 redundant places. [2023-08-04 04:03:06,845 INFO L231 Difference]: Finished difference. Result has 190 places, 270 transitions, 2805 flow [2023-08-04 04:03:06,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=2305, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2805, PETRI_PLACES=190, PETRI_TRANSITIONS=270} [2023-08-04 04:03:06,846 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 123 predicate places. [2023-08-04 04:03:06,846 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 270 transitions, 2805 flow [2023-08-04 04:03:06,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 163.72727272727272) internal successors, (3602), 22 states have internal predecessors, (3602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:06,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:06,847 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:03:06,854 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-04 04:03:07,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-04 04:03:07,051 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:03:07,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash -596250742, now seen corresponding path program 2 times [2023-08-04 04:03:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:07,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763840557] [2023-08-04 04:03:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:03:07,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:07,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763840557] [2023-08-04 04:03:07,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763840557] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:03:07,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668339841] [2023-08-04 04:03:07,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:03:07,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:03:07,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:03:07,817 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-04 04:03:07,850 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-04 04:03:07,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:03:07,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:03:07,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-04 04:03:07,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:03:08,016 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 116 [2023-08-04 04:03:08,050 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-04 04:03:08,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 121 treesize of output 130 [2023-08-04 04:03:08,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2023-08-04 04:03:08,332 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-04 04:03:08,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 43 [2023-08-04 04:03:08,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2023-08-04 04:03:08,574 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-04 04:03:08,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 43 [2023-08-04 04:03:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:03:08,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:03:08,816 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_655))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-04 04:03:08,849 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse2 |c_~#A~0.offset| (+ (select .cse2 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_655))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-04 04:03:08,876 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (v_ArrVal_652 (Array Int Int))) (= (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_652))) (store .cse2 |c_~#A~0.base| (let ((.cse3 (select .cse2 |c_~#A~0.base|))) (store .cse3 |c_~#A~0.offset| (+ (select .cse3 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_655))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-04 04:03:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-04 04:03:08,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668339841] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:03:08,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:03:08,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-08-04 04:03:08,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498773326] [2023-08-04 04:03:08,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:03:08,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 04:03:08,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:08,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 04:03:08,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=250, Unknown=7, NotChecked=102, Total=420 [2023-08-04 04:03:08,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 462 [2023-08-04 04:03:08,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 270 transitions, 2805 flow. Second operand has 21 states, 21 states have (on average 163.85714285714286) internal successors, (3441), 21 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:08,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:08,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 462 [2023-08-04 04:03:08,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:11,512 INFO L124 PetriNetUnfolderBase]: 4145/10189 cut-off events. [2023-08-04 04:03:11,513 INFO L125 PetriNetUnfolderBase]: For 50055/50152 co-relation queries the response was YES. [2023-08-04 04:03:11,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44925 conditions, 10189 events. 4145/10189 cut-off events. For 50055/50152 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 96529 event pairs, 2247 based on Foata normal form. 25/9719 useless extension candidates. Maximal degree in co-relation 43733. Up to 6568 conditions per place. [2023-08-04 04:03:11,574 INFO L140 encePairwiseOnDemand]: 449/462 looper letters, 272 selfloop transitions, 61 changer transitions 60/410 dead transitions. [2023-08-04 04:03:11,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 410 transitions, 4650 flow [2023-08-04 04:03:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-04 04:03:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-04 04:03:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3250 transitions. [2023-08-04 04:03:11,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3702437912964229 [2023-08-04 04:03:11,578 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3250 transitions. [2023-08-04 04:03:11,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3250 transitions. [2023-08-04 04:03:11,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:03:11,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3250 transitions. [2023-08-04 04:03:11,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 171.05263157894737) internal successors, (3250), 19 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:11,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 462.0) internal successors, (9240), 20 states have internal predecessors, (9240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:11,587 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 462.0) internal successors, (9240), 20 states have internal predecessors, (9240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:11,587 INFO L175 Difference]: Start difference. First operand has 190 places, 270 transitions, 2805 flow. Second operand 19 states and 3250 transitions. [2023-08-04 04:03:11,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 410 transitions, 4650 flow [2023-08-04 04:03:11,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 410 transitions, 4500 flow, removed 56 selfloop flow, removed 3 redundant places. [2023-08-04 04:03:11,774 INFO L231 Difference]: Finished difference. Result has 211 places, 280 transitions, 2965 flow [2023-08-04 04:03:11,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=2676, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2965, PETRI_PLACES=211, PETRI_TRANSITIONS=280} [2023-08-04 04:03:11,775 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 144 predicate places. [2023-08-04 04:03:11,775 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 280 transitions, 2965 flow [2023-08-04 04:03:11,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 163.85714285714286) internal successors, (3441), 21 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:11,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:11,776 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:03:11,781 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-04 04:03:11,980 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,SelfDestructingSolverStorable16 [2023-08-04 04:03:11,981 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:03:11,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash 94369079, now seen corresponding path program 1 times [2023-08-04 04:03:11,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:11,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291515811] [2023-08-04 04:03:11,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:03:12,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:12,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291515811] [2023-08-04 04:03:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291515811] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:03:12,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118286606] [2023-08-04 04:03:12,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:12,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:03:12,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:03:12,390 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-04 04:03:12,392 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-04 04:03:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:12,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-04 04:03:12,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:03:12,582 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 116 [2023-08-04 04:03:12,603 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:03:12,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 118 [2023-08-04 04:03:12,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:03:12,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:03:12,832 INFO L322 Elim1Store]: treesize reduction 26, result has 43.5 percent of original size [2023-08-04 04:03:12,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2023-08-04 04:03:12,996 INFO L322 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2023-08-04 04:03:12,996 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2023-08-04 04:03:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:03:13,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:03:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:03:13,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118286606] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:03:13,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:03:13,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 11 [2023-08-04 04:03:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138134363] [2023-08-04 04:03:13,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:03:13,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 04:03:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:13,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 04:03:13,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-08-04 04:03:13,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 462 [2023-08-04 04:03:13,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 280 transitions, 2965 flow. Second operand has 13 states, 13 states have (on average 202.92307692307693) internal successors, (2638), 13 states have internal predecessors, (2638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:13,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:13,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 462 [2023-08-04 04:03:13,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:15,608 INFO L124 PetriNetUnfolderBase]: 3947/9554 cut-off events. [2023-08-04 04:03:15,608 INFO L125 PetriNetUnfolderBase]: For 51126/51224 co-relation queries the response was YES. [2023-08-04 04:03:15,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42695 conditions, 9554 events. 3947/9554 cut-off events. For 51126/51224 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 88048 event pairs, 1920 based on Foata normal form. 52/9129 useless extension candidates. Maximal degree in co-relation 42200. Up to 5038 conditions per place. [2023-08-04 04:03:15,654 INFO L140 encePairwiseOnDemand]: 451/462 looper letters, 271 selfloop transitions, 41 changer transitions 32/361 dead transitions. [2023-08-04 04:03:15,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 361 transitions, 4218 flow [2023-08-04 04:03:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-04 04:03:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-04 04:03:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1944 transitions. [2023-08-04 04:03:15,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2023-08-04 04:03:15,657 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1944 transitions. [2023-08-04 04:03:15,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1944 transitions. [2023-08-04 04:03:15,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:03:15,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1944 transitions. [2023-08-04 04:03:15,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:15,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 462.0) internal successors, (4620), 10 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:15,661 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 462.0) internal successors, (4620), 10 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:15,661 INFO L175 Difference]: Start difference. First operand has 211 places, 280 transitions, 2965 flow. Second operand 9 states and 1944 transitions. [2023-08-04 04:03:15,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 361 transitions, 4218 flow [2023-08-04 04:03:15,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 361 transitions, 4061 flow, removed 37 selfloop flow, removed 7 redundant places. [2023-08-04 04:03:15,822 INFO L231 Difference]: Finished difference. Result has 216 places, 278 transitions, 2902 flow [2023-08-04 04:03:15,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=2794, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2902, PETRI_PLACES=216, PETRI_TRANSITIONS=278} [2023-08-04 04:03:15,823 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 149 predicate places. [2023-08-04 04:03:15,823 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 278 transitions, 2902 flow [2023-08-04 04:03:15,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 202.92307692307693) internal successors, (2638), 13 states have internal predecessors, (2638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:15,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:15,823 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:03:15,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-04 04:03:16,024 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,SelfDestructingSolverStorable17 [2023-08-04 04:03:16,024 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:03:16,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1463334745, now seen corresponding path program 1 times [2023-08-04 04:03:16,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:16,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662189266] [2023-08-04 04:03:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:16,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:03:16,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:16,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662189266] [2023-08-04 04:03:16,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662189266] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:03:16,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257508864] [2023-08-04 04:03:16,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:16,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:03:16,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:03:16,627 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-04 04:03:16,628 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-04 04:03:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:16,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-04 04:03:16,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:03:16,791 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 112 [2023-08-04 04:03:16,819 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-04 04:03:16,820 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 126 [2023-08-04 04:03:16,900 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:03:16,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:03:17,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-04 04:03:17,298 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-04 04:03:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:03:17,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:03:17,472 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_797) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|))) is different from false [2023-08-04 04:03:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-04 04:03:17,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257508864] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:03:17,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:03:17,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 17 [2023-08-04 04:03:17,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878264027] [2023-08-04 04:03:17,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:03:17,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 04:03:17,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:17,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 04:03:17,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=239, Unknown=1, NotChecked=32, Total=342 [2023-08-04 04:03:17,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 462 [2023-08-04 04:03:17,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 278 transitions, 2902 flow. Second operand has 19 states, 19 states have (on average 164.31578947368422) internal successors, (3122), 19 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:17,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:17,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 462 [2023-08-04 04:03:17,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:18,790 INFO L124 PetriNetUnfolderBase]: 3131/7316 cut-off events. [2023-08-04 04:03:18,790 INFO L125 PetriNetUnfolderBase]: For 36314/36397 co-relation queries the response was YES. [2023-08-04 04:03:18,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32595 conditions, 7316 events. 3131/7316 cut-off events. For 36314/36397 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 61852 event pairs, 1619 based on Foata normal form. 16/6934 useless extension candidates. Maximal degree in co-relation 32309. Up to 5382 conditions per place. [2023-08-04 04:03:18,850 INFO L140 encePairwiseOnDemand]: 449/462 looper letters, 259 selfloop transitions, 36 changer transitions 39/351 dead transitions. [2023-08-04 04:03:18,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 351 transitions, 3990 flow [2023-08-04 04:03:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-04 04:03:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-04 04:03:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1591 transitions. [2023-08-04 04:03:18,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38263588263588266 [2023-08-04 04:03:18,852 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1591 transitions. [2023-08-04 04:03:18,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1591 transitions. [2023-08-04 04:03:18,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:03:18,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1591 transitions. [2023-08-04 04:03:18,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 176.77777777777777) internal successors, (1591), 9 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:18,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 462.0) internal successors, (4620), 10 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:18,856 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 462.0) internal successors, (4620), 10 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:18,856 INFO L175 Difference]: Start difference. First operand has 216 places, 278 transitions, 2902 flow. Second operand 9 states and 1591 transitions. [2023-08-04 04:03:18,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 351 transitions, 3990 flow [2023-08-04 04:03:18,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 351 transitions, 3835 flow, removed 20 selfloop flow, removed 8 redundant places. [2023-08-04 04:03:18,997 INFO L231 Difference]: Finished difference. Result has 212 places, 270 transitions, 2741 flow [2023-08-04 04:03:18,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=2748, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2741, PETRI_PLACES=212, PETRI_TRANSITIONS=270} [2023-08-04 04:03:18,998 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 145 predicate places. [2023-08-04 04:03:18,998 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 270 transitions, 2741 flow [2023-08-04 04:03:18,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 164.31578947368422) internal successors, (3122), 19 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:18,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:18,999 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:03:19,005 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-04 04:03:19,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:03:19,203 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:03:19,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:19,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1871294106, now seen corresponding path program 2 times [2023-08-04 04:03:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:19,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700905447] [2023-08-04 04:03:19,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:19,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:03:19,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:19,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700905447] [2023-08-04 04:03:19,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700905447] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:03:19,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167174311] [2023-08-04 04:03:19,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:03:19,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:03:19,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:03:19,282 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-04 04:03:19,308 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-04 04:03:19,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:03:19,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:03:19,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 04:03:19,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:03:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:03:19,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:03:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:03:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167174311] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 04:03:19,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 04:03:19,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2023-08-04 04:03:19,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780057787] [2023-08-04 04:03:19,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:03:19,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:03:19,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:19,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:03:19,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 04:03:19,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 462 [2023-08-04 04:03:19,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 270 transitions, 2741 flow. Second operand has 5 states, 5 states have (on average 217.4) internal successors, (1087), 5 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:19,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:19,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 462 [2023-08-04 04:03:19,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:20,502 INFO L124 PetriNetUnfolderBase]: 2582/5780 cut-off events. [2023-08-04 04:03:20,502 INFO L125 PetriNetUnfolderBase]: For 24000/24068 co-relation queries the response was YES. [2023-08-04 04:03:20,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25035 conditions, 5780 events. 2582/5780 cut-off events. For 24000/24068 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 45164 event pairs, 1274 based on Foata normal form. 17/5489 useless extension candidates. Maximal degree in co-relation 24953. Up to 4893 conditions per place. [2023-08-04 04:03:20,539 INFO L140 encePairwiseOnDemand]: 459/462 looper letters, 295 selfloop transitions, 3 changer transitions 0/314 dead transitions. [2023-08-04 04:03:20,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 314 transitions, 3759 flow [2023-08-04 04:03:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 04:03:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 04:03:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1150 transitions. [2023-08-04 04:03:20,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49783549783549785 [2023-08-04 04:03:20,541 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1150 transitions. [2023-08-04 04:03:20,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1150 transitions. [2023-08-04 04:03:20,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:03:20,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1150 transitions. [2023-08-04 04:03:20,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:20,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 462.0) internal successors, (2772), 6 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:20,544 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 462.0) internal successors, (2772), 6 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:20,544 INFO L175 Difference]: Start difference. First operand has 212 places, 270 transitions, 2741 flow. Second operand 5 states and 1150 transitions. [2023-08-04 04:03:20,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 314 transitions, 3759 flow [2023-08-04 04:03:20,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 314 transitions, 3637 flow, removed 5 selfloop flow, removed 14 redundant places. [2023-08-04 04:03:20,615 INFO L231 Difference]: Finished difference. Result has 199 places, 264 transitions, 2577 flow [2023-08-04 04:03:20,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=2571, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2577, PETRI_PLACES=199, PETRI_TRANSITIONS=264} [2023-08-04 04:03:20,616 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 132 predicate places. [2023-08-04 04:03:20,616 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 264 transitions, 2577 flow [2023-08-04 04:03:20,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.4) internal successors, (1087), 5 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:20,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:20,616 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:03:20,621 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-04 04:03:20,817 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,SelfDestructingSolverStorable19 [2023-08-04 04:03:20,817 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:03:20,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1850561277, now seen corresponding path program 1 times [2023-08-04 04:03:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:20,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241133748] [2023-08-04 04:03:20,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 04:03:21,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:21,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241133748] [2023-08-04 04:03:21,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241133748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:03:21,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:03:21,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-04 04:03:21,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979592482] [2023-08-04 04:03:21,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:03:21,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 04:03:21,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:21,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 04:03:21,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-08-04 04:03:21,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 462 [2023-08-04 04:03:21,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 264 transitions, 2577 flow. Second operand has 7 states, 7 states have (on average 191.71428571428572) internal successors, (1342), 7 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:21,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:21,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 462 [2023-08-04 04:03:21,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:22,284 INFO L124 PetriNetUnfolderBase]: 2438/5445 cut-off events. [2023-08-04 04:03:22,284 INFO L125 PetriNetUnfolderBase]: For 20467/20525 co-relation queries the response was YES. [2023-08-04 04:03:22,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23380 conditions, 5445 events. 2438/5445 cut-off events. For 20467/20525 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 41276 event pairs, 334 based on Foata normal form. 178/5318 useless extension candidates. Maximal degree in co-relation 23105. Up to 2921 conditions per place. [2023-08-04 04:03:22,330 INFO L140 encePairwiseOnDemand]: 440/462 looper letters, 275 selfloop transitions, 147 changer transitions 9/439 dead transitions. [2023-08-04 04:03:22,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 439 transitions, 4906 flow [2023-08-04 04:03:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 04:03:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 04:03:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1672 transitions. [2023-08-04 04:03:22,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2023-08-04 04:03:22,332 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1672 transitions. [2023-08-04 04:03:22,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1672 transitions. [2023-08-04 04:03:22,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:03:22,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1672 transitions. [2023-08-04 04:03:22,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:22,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 462.0) internal successors, (4158), 9 states have internal predecessors, (4158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:22,336 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 462.0) internal successors, (4158), 9 states have internal predecessors, (4158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:22,336 INFO L175 Difference]: Start difference. First operand has 199 places, 264 transitions, 2577 flow. Second operand 8 states and 1672 transitions. [2023-08-04 04:03:22,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 439 transitions, 4906 flow [2023-08-04 04:03:22,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 439 transitions, 4880 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-04 04:03:22,416 INFO L231 Difference]: Finished difference. Result has 204 places, 317 transitions, 3487 flow [2023-08-04 04:03:22,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=2564, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3487, PETRI_PLACES=204, PETRI_TRANSITIONS=317} [2023-08-04 04:03:22,417 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 137 predicate places. [2023-08-04 04:03:22,417 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 317 transitions, 3487 flow [2023-08-04 04:03:22,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 191.71428571428572) internal successors, (1342), 7 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:22,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:22,417 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:03:22,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-04 04:03:22,417 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:03:22,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:22,418 INFO L85 PathProgramCache]: Analyzing trace with hash -459223798, now seen corresponding path program 1 times [2023-08-04 04:03:22,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:22,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811639373] [2023-08-04 04:03:22,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 04:03:22,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:22,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811639373] [2023-08-04 04:03:22,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811639373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:03:22,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:03:22,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 04:03:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597766339] [2023-08-04 04:03:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:03:22,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 04:03:22,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 04:03:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-04 04:03:22,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 462 [2023-08-04 04:03:22,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 317 transitions, 3487 flow. Second operand has 6 states, 6 states have (on average 199.83333333333334) internal successors, (1199), 6 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:22,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:22,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 462 [2023-08-04 04:03:22,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:23,934 INFO L124 PetriNetUnfolderBase]: 2689/6522 cut-off events. [2023-08-04 04:03:23,934 INFO L125 PetriNetUnfolderBase]: For 34737/34836 co-relation queries the response was YES. [2023-08-04 04:03:23,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29970 conditions, 6522 events. 2689/6522 cut-off events. For 34737/34836 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 54727 event pairs, 724 based on Foata normal form. 133/6243 useless extension candidates. Maximal degree in co-relation 29605. Up to 3185 conditions per place. [2023-08-04 04:03:23,987 INFO L140 encePairwiseOnDemand]: 455/462 looper letters, 366 selfloop transitions, 100 changer transitions 7/499 dead transitions. [2023-08-04 04:03:23,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 499 transitions, 6198 flow [2023-08-04 04:03:23,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 04:03:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 04:03:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1112 transitions. [2023-08-04 04:03:23,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48138528138528136 [2023-08-04 04:03:23,989 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1112 transitions. [2023-08-04 04:03:23,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1112 transitions. [2023-08-04 04:03:23,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:03:23,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1112 transitions. [2023-08-04 04:03:23,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:23,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 462.0) internal successors, (2772), 6 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:23,992 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 462.0) internal successors, (2772), 6 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:23,992 INFO L175 Difference]: Start difference. First operand has 204 places, 317 transitions, 3487 flow. Second operand 5 states and 1112 transitions. [2023-08-04 04:03:23,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 499 transitions, 6198 flow [2023-08-04 04:03:24,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 499 transitions, 6043 flow, removed 27 selfloop flow, removed 2 redundant places. [2023-08-04 04:03:24,080 INFO L231 Difference]: Finished difference. Result has 208 places, 330 transitions, 3852 flow [2023-08-04 04:03:24,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=3391, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3852, PETRI_PLACES=208, PETRI_TRANSITIONS=330} [2023-08-04 04:03:24,081 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 141 predicate places. [2023-08-04 04:03:24,081 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 330 transitions, 3852 flow [2023-08-04 04:03:24,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.83333333333334) internal successors, (1199), 6 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:24,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:24,081 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:03:24,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-04 04:03:24,082 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:03:24,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash 296150017, now seen corresponding path program 1 times [2023-08-04 04:03:24,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:24,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901707362] [2023-08-04 04:03:24,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:03:24,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901707362] [2023-08-04 04:03:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901707362] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:03:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391940866] [2023-08-04 04:03:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:24,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:03:24,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:03:24,986 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-04 04:03:24,990 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-04 04:03:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:25,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-04 04:03:25,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:03:25,152 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 116 [2023-08-04 04:03:25,173 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:03:25,173 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 118 [2023-08-04 04:03:25,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:03:25,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 14 treesize of output 16 [2023-08-04 04:03:25,417 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-04 04:03:25,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:03:25,503 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-04 04:03:25,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:03:25,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:03:25,640 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-04 04:03:25,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:03:25,654 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-04 04:03:25,728 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:03:25,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:03:25,754 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-04 04:03:25,823 INFO L322 Elim1Store]: treesize reduction 10, result has 28.6 percent of original size [2023-08-04 04:03:25,824 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 17 treesize of output 11 [2023-08-04 04:03:25,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:03:25,881 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:03:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:03:25,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:03:26,164 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:03:26,165 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 21 treesize of output 22 [2023-08-04 04:03:26,174 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:03:26,174 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 35 treesize of output 38 [2023-08-04 04:03:26,180 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 20 treesize of output 18 [2023-08-04 04:03:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:03:26,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391940866] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:03:26,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:03:26,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2023-08-04 04:03:26,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824155438] [2023-08-04 04:03:26,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:03:26,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-04 04:03:26,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:26,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-04 04:03:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=728, Unknown=5, NotChecked=0, Total=870 [2023-08-04 04:03:26,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 462 [2023-08-04 04:03:26,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 330 transitions, 3852 flow. Second operand has 30 states, 30 states have (on average 139.46666666666667) internal successors, (4184), 30 states have internal predecessors, (4184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:03:26,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:26,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 462 [2023-08-04 04:03:26,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:34,373 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 72 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:03:42,941 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 53 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:03:51,121 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 46 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:03:59,296 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 55 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:03:59,561 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse2 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse1 (forall ((v_ArrVal_1043 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) (and (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~mem6#1| 0)) .cse1) (or (and .cse0 (= .cse2 0)) .cse1) (or (and .cse0 (= .cse2 1)) .cse1))) is different from false [2023-08-04 04:04:08,093 WARN L233 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 59 DAG size of output: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:04:18,460 WARN L233 SmtUtils]: Spent 10.32s on a formula simplification. DAG size of input: 49 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:04:21,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:04:29,856 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 61 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:04:38,623 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 66 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:04:41,325 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-04 04:04:46,075 INFO L124 PetriNetUnfolderBase]: 3763/9370 cut-off events. [2023-08-04 04:04:46,076 INFO L125 PetriNetUnfolderBase]: For 55299/55347 co-relation queries the response was YES. [2023-08-04 04:04:46,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44119 conditions, 9370 events. 3763/9370 cut-off events. For 55299/55347 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 85113 event pairs, 1326 based on Foata normal form. 185/8934 useless extension candidates. Maximal degree in co-relation 43780. Up to 4148 conditions per place. [2023-08-04 04:04:46,188 INFO L140 encePairwiseOnDemand]: 419/462 looper letters, 424 selfloop transitions, 213 changer transitions 389/1034 dead transitions. [2023-08-04 04:04:46,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1034 transitions, 12023 flow [2023-08-04 04:04:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-08-04 04:04:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-08-04 04:04:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 10907 transitions. [2023-08-04 04:04:46,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31477633477633477 [2023-08-04 04:04:46,202 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 10907 transitions. [2023-08-04 04:04:46,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 10907 transitions. [2023-08-04 04:04:46,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:04:46,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 10907 transitions. [2023-08-04 04:04:46,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 145.42666666666668) internal successors, (10907), 75 states have internal predecessors, (10907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:46,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 462.0) internal successors, (35112), 76 states have internal predecessors, (35112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:46,246 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 462.0) internal successors, (35112), 76 states have internal predecessors, (35112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:46,246 INFO L175 Difference]: Start difference. First operand has 208 places, 330 transitions, 3852 flow. Second operand 75 states and 10907 transitions. [2023-08-04 04:04:46,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 1034 transitions, 12023 flow [2023-08-04 04:04:46,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 1034 transitions, 11637 flow, removed 12 selfloop flow, removed 8 redundant places. [2023-08-04 04:04:46,450 INFO L231 Difference]: Finished difference. Result has 312 places, 444 transitions, 5720 flow [2023-08-04 04:04:46,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=3437, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=5720, PETRI_PLACES=312, PETRI_TRANSITIONS=444} [2023-08-04 04:04:46,451 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 245 predicate places. [2023-08-04 04:04:46,451 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 444 transitions, 5720 flow [2023-08-04 04:04:46,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 139.46666666666667) internal successors, (4184), 30 states have internal predecessors, (4184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:46,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:04:46,452 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:04:46,457 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-04 04:04:46,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:04:46,656 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:04:46,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:04:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1065169353, now seen corresponding path program 2 times [2023-08-04 04:04:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:04:46,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392524882] [2023-08-04 04:04:46,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:04:46,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:04:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:04:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:04:47,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:04:47,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392524882] [2023-08-04 04:04:47,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392524882] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:04:47,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211988403] [2023-08-04 04:04:47,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:04:47,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:04:47,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:04:47,625 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-04 04:04:47,627 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-04 04:04:47,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:04:47,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:04:47,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-04 04:04:47,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:04:47,827 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:04:47,827 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 120 [2023-08-04 04:04:47,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 102 treesize of output 102 [2023-08-04 04:04:47,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:04:48,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:04:48,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:04:48,183 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:04:48,234 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 11 treesize of output 7 [2023-08-04 04:04:48,266 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:04:48,267 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 15 treesize of output 11 [2023-08-04 04:04:48,319 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:04:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:04:48,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:04:48,419 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 18 treesize of output 14 [2023-08-04 04:04:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:04:48,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211988403] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:04:48,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:04:48,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2023-08-04 04:04:48,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923491037] [2023-08-04 04:04:48,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:04:48,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-04 04:04:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:04:48,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-04 04:04:48,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=686, Unknown=8, NotChecked=0, Total=812 [2023-08-04 04:04:52,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 462 [2023-08-04 04:04:52,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 444 transitions, 5720 flow. Second operand has 29 states, 29 states have (on average 139.58620689655172) internal successors, (4048), 29 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:04:52,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:04:52,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 462 [2023-08-04 04:04:52,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:05:15,362 WARN L233 SmtUtils]: Spent 20.20s on a formula simplification. DAG size of input: 39 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:06:20,606 WARN L233 SmtUtils]: Spent 1.09m on a formula simplification. DAG size of input: 48 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:06:25,379 INFO L124 PetriNetUnfolderBase]: 3866/9222 cut-off events. [2023-08-04 04:06:25,380 INFO L125 PetriNetUnfolderBase]: For 69811/69892 co-relation queries the response was YES. [2023-08-04 04:06:25,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50274 conditions, 9222 events. 3866/9222 cut-off events. For 69811/69892 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 82562 event pairs, 858 based on Foata normal form. 72/8652 useless extension candidates. Maximal degree in co-relation 50179. Up to 4011 conditions per place. [2023-08-04 04:06:25,491 INFO L140 encePairwiseOnDemand]: 434/462 looper letters, 566 selfloop transitions, 331 changer transitions 146/1065 dead transitions. [2023-08-04 04:06:25,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 1065 transitions, 14645 flow [2023-08-04 04:06:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-08-04 04:06:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-08-04 04:06:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 8048 transitions. [2023-08-04 04:06:25,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3167256985438804 [2023-08-04 04:06:25,501 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 8048 transitions. [2023-08-04 04:06:25,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 8048 transitions. [2023-08-04 04:06:25,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:06:25,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 8048 transitions. [2023-08-04 04:06:25,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 146.3272727272727) internal successors, (8048), 55 states have internal predecessors, (8048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:06:25,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 462.0) internal successors, (25872), 56 states have internal predecessors, (25872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:06:25,537 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 462.0) internal successors, (25872), 56 states have internal predecessors, (25872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:06:25,537 INFO L175 Difference]: Start difference. First operand has 312 places, 444 transitions, 5720 flow. Second operand 55 states and 8048 transitions. [2023-08-04 04:06:25,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 1065 transitions, 14645 flow [2023-08-04 04:06:26,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 1065 transitions, 13771 flow, removed 380 selfloop flow, removed 32 redundant places. [2023-08-04 04:06:26,034 INFO L231 Difference]: Finished difference. Result has 316 places, 617 transitions, 8590 flow [2023-08-04 04:06:26,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=5281, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=8590, PETRI_PLACES=316, PETRI_TRANSITIONS=617} [2023-08-04 04:06:26,034 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 249 predicate places. [2023-08-04 04:06:26,035 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 617 transitions, 8590 flow [2023-08-04 04:06:26,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 139.58620689655172) internal successors, (4048), 29 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:06:26,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:06:26,035 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:06:26,044 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-04 04:06:26,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:06:26,241 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:06:26,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:06:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash -291462819, now seen corresponding path program 3 times [2023-08-04 04:06:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:06:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897392722] [2023-08-04 04:06:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:06:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:06:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:06:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:06:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:06:26,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897392722] [2023-08-04 04:06:26,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897392722] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:06:26,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615433457] [2023-08-04 04:06:26,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 04:06:26,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:06:26,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:06:26,925 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-04 04:06:26,928 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-04 04:06:27,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 04:06:27,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:06:27,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-04 04:06:27,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:06:27,162 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:06:27,162 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 124 [2023-08-04 04:06:27,171 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 106 treesize of output 106 [2023-08-04 04:06:27,264 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:06:27,354 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-04 04:06:27,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:06:27,525 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-04 04:06:27,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:06:27,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:06:27,665 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-04 04:06:27,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:06:27,699 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-04 04:06:27,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:06:27,845 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:06:27,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:06:27,889 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-04 04:06:27,986 INFO L322 Elim1Store]: treesize reduction 10, result has 28.6 percent of original size [2023-08-04 04:06:27,987 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 17 treesize of output 11 [2023-08-04 04:06:28,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:06:28,042 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:06:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:06:28,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:06:28,072 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1230) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:06:28,143 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1229 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1229) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1230 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1230) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-04 04:06:28,153 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1229 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1229) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1230 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1230) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-04 04:06:28,370 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:06:28,370 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 21 treesize of output 22 [2023-08-04 04:06:28,378 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:06:28,378 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 35 treesize of output 38 [2023-08-04 04:06:28,382 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 20 treesize of output 18 [2023-08-04 04:06:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:06:28,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615433457] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:06:28,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:06:28,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2023-08-04 04:06:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818942520] [2023-08-04 04:06:28,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:06:28,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-04 04:06:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:06:28,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-04 04:06:28,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=574, Unknown=9, NotChecked=156, Total=870 [2023-08-04 04:06:28,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 462 [2023-08-04 04:06:28,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 617 transitions, 8590 flow. Second operand has 30 states, 30 states have (on average 139.6) internal successors, (4188), 30 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:06:28,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:06:28,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 462 [2023-08-04 04:06:28,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:06:34,322 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse2 (select .cse1 |c_~#A~0.offset|)) (.cse0 (forall ((v_ArrVal_1229 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1229) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) (and (or .cse0 (forall ((v_ArrVal_1230 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse1 |c_~#A~0.offset| (+ .cse2 (- 1)))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1230) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or .cse0 (forall ((v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1230 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse1 |c_~#A~0.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1226))) (store .cse3 |c_~#A~0.base| (let ((.cse4 (select .cse3 |c_~#A~0.base|))) (store .cse4 |c_~#A~0.offset| (+ (- 1) (select .cse4 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1230) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= .cse2 0)) (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (<= (+ |c_~#A~0.offset| 12) |c_ULTIMATE.start_main_~m~0#1.offset|) (< |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 13)) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|))) (or .cse0 (forall ((v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1230 (Array Int Int))) (= (select (select (store (let ((.cse5 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse1 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1226))) (store .cse5 |c_~#A~0.base| (let ((.cse6 (select .cse5 |c_~#A~0.base|))) (store .cse6 |c_~#A~0.offset| (+ (- 1) (select .cse6 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1230) |c_~#A~0.base|) |c_~#A~0.offset|) 0)))))) is different from false [2023-08-04 04:06:45,430 INFO L124 PetriNetUnfolderBase]: 5418/12412 cut-off events. [2023-08-04 04:06:45,431 INFO L125 PetriNetUnfolderBase]: For 101045/101124 co-relation queries the response was YES. [2023-08-04 04:06:45,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71713 conditions, 12412 events. 5418/12412 cut-off events. For 101045/101124 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 114624 event pairs, 1689 based on Foata normal form. 58/11608 useless extension candidates. Maximal degree in co-relation 71622. Up to 5637 conditions per place. [2023-08-04 04:06:45,622 INFO L140 encePairwiseOnDemand]: 438/462 looper letters, 691 selfloop transitions, 387 changer transitions 164/1250 dead transitions. [2023-08-04 04:06:45,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1250 transitions, 18620 flow [2023-08-04 04:06:45,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-04 04:06:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-04 04:06:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6348 transitions. [2023-08-04 04:06:45,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31954092419208696 [2023-08-04 04:06:45,633 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6348 transitions. [2023-08-04 04:06:45,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6348 transitions. [2023-08-04 04:06:45,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:06:45,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6348 transitions. [2023-08-04 04:06:45,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 147.62790697674419) internal successors, (6348), 43 states have internal predecessors, (6348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:06:45,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 462.0) internal successors, (20328), 44 states have internal predecessors, (20328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:06:45,657 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 462.0) internal successors, (20328), 44 states have internal predecessors, (20328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:06:45,657 INFO L175 Difference]: Start difference. First operand has 316 places, 617 transitions, 8590 flow. Second operand 43 states and 6348 transitions. [2023-08-04 04:06:45,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 1250 transitions, 18620 flow [2023-08-04 04:06:46,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 1250 transitions, 17622 flow, removed 432 selfloop flow, removed 18 redundant places. [2023-08-04 04:06:46,707 INFO L231 Difference]: Finished difference. Result has 351 places, 828 transitions, 12677 flow [2023-08-04 04:06:46,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=8083, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=12677, PETRI_PLACES=351, PETRI_TRANSITIONS=828} [2023-08-04 04:06:46,708 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 284 predicate places. [2023-08-04 04:06:46,708 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 828 transitions, 12677 flow [2023-08-04 04:06:46,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 139.6) internal successors, (4188), 30 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:06:46,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:06:46,709 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:06:46,716 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-04 04:06:46,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-04 04:06:46,910 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:06:46,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:06:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash 319214719, now seen corresponding path program 4 times [2023-08-04 04:06:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:06:46,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920976250] [2023-08-04 04:06:46,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:06:46,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:06:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:06:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:06:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:06:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920976250] [2023-08-04 04:06:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920976250] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:06:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74383045] [2023-08-04 04:06:47,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 04:06:47,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:06:47,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:06:47,587 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-04 04:06:47,588 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-04 04:06:47,741 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 04:06:47,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:06:47,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-04 04:06:47,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:06:47,815 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:06:47,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 120 [2023-08-04 04:06:47,826 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 102 treesize of output 102 [2023-08-04 04:06:47,918 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:06:47,968 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 11 treesize of output 7 [2023-08-04 04:06:48,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:06:48,130 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:06:48,227 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:06:48,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:06:48,311 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:06:48,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:06:48,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:06:48,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:06:48,585 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:06:48,590 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:06:48,591 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 15 treesize of output 11 [2023-08-04 04:06:48,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:06:48,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:06:48,719 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:06:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:06:48,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:06:48,761 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1324) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:06:49,116 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:06:49,117 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 21 treesize of output 22 [2023-08-04 04:06:49,123 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:06:49,123 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 35 treesize of output 38 [2023-08-04 04:06:49,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 20 treesize of output 18 [2023-08-04 04:06:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:06:49,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74383045] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:06:49,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:06:49,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2023-08-04 04:06:49,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194887056] [2023-08-04 04:06:49,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:06:49,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-04 04:06:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:06:49,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-04 04:06:49,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=641, Unknown=3, NotChecked=52, Total=812 [2023-08-04 04:06:51,403 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-04 04:06:51,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 462 [2023-08-04 04:06:51,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 828 transitions, 12677 flow. Second operand has 29 states, 29 states have (on average 139.6551724137931) internal successors, (4050), 29 states have internal predecessors, (4050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:06:51,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:06:51,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 462 [2023-08-04 04:06:51,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:06:52,361 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse3 (forall ((v_ArrVal_1320 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1320) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse2 (select .cse4 |c_~#A~0.offset|)) (.cse0 (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (= |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 12)) (= (select (select |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1))) (.cse1 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)))) (and (or .cse0 (and .cse1 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= .cse2 1))) (or .cse3 (and .cse1 (forall ((v_ArrVal_1321 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1321) |c_~#A~0.base|) |c_~#A~0.offset|) 1)))) (or (and .cse1 (forall ((v_ArrVal_1321 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1321) |c_~#A~0.base|) |c_~#A~0.offset|) 1))) .cse3) (or .cse3 (and .cse1 (forall ((v_ArrVal_1321 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1321) |c_~#A~0.base|) |c_~#A~0.offset|) 1)))) (or .cse0 (and .cse1 (= |c_t_funThread1of2ForFork0_#t~post10#1| 1)))))) is different from false [2023-08-04 04:06:54,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:06:56,161 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse5 (forall ((v_ArrVal_1320 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1320) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse3 (select .cse4 |c_~#A~0.offset|)) (.cse0 (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|))) (.cse1 (= |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 12))) (.cse2 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)))) (and (or (and .cse0 .cse1 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) (= (select (select |c_#pthreadsMutex| |c_~#A~0.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1)) (and .cse2 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= .cse3 1))) (or (and .cse2 (forall ((v_ArrVal_1321 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1321) |c_~#A~0.base|) |c_~#A~0.offset|) 1))) .cse5) (or .cse5 (and .cse2 (forall ((v_ArrVal_1321 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ .cse3 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1321) |c_~#A~0.base|) |c_~#A~0.offset|) 1)))) (or (and .cse0 .cse1 (= (select (select |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1)) (and .cse2 (= |c_t_funThread1of2ForFork0_#t~post10#1| 1)))))) is different from false [2023-08-04 04:07:01,061 INFO L124 PetriNetUnfolderBase]: 5743/13140 cut-off events. [2023-08-04 04:07:01,062 INFO L125 PetriNetUnfolderBase]: For 116100/116188 co-relation queries the response was YES. [2023-08-04 04:07:01,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77720 conditions, 13140 events. 5743/13140 cut-off events. For 116100/116188 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 122619 event pairs, 1937 based on Foata normal form. 123/12326 useless extension candidates. Maximal degree in co-relation 77614. Up to 6736 conditions per place. [2023-08-04 04:07:01,198 INFO L140 encePairwiseOnDemand]: 435/462 looper letters, 669 selfloop transitions, 336 changer transitions 231/1244 dead transitions. [2023-08-04 04:07:01,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1244 transitions, 19822 flow [2023-08-04 04:07:01,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-04 04:07:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-04 04:07:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 6881 transitions. [2023-08-04 04:07:01,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3168923275306254 [2023-08-04 04:07:01,206 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 6881 transitions. [2023-08-04 04:07:01,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 6881 transitions. [2023-08-04 04:07:01,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:07:01,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 6881 transitions. [2023-08-04 04:07:01,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 146.40425531914894) internal successors, (6881), 47 states have internal predecessors, (6881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:07:01,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 462.0) internal successors, (22176), 48 states have internal predecessors, (22176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:07:01,233 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 462.0) internal successors, (22176), 48 states have internal predecessors, (22176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:07:01,233 INFO L175 Difference]: Start difference. First operand has 351 places, 828 transitions, 12677 flow. Second operand 47 states and 6881 transitions. [2023-08-04 04:07:01,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 1244 transitions, 19822 flow [2023-08-04 04:07:02,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 1244 transitions, 19415 flow, removed 179 selfloop flow, removed 9 redundant places. [2023-08-04 04:07:02,162 INFO L231 Difference]: Finished difference. Result has 408 places, 841 transitions, 13694 flow [2023-08-04 04:07:02,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=12228, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=13694, PETRI_PLACES=408, PETRI_TRANSITIONS=841} [2023-08-04 04:07:02,163 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 341 predicate places. [2023-08-04 04:07:02,163 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 841 transitions, 13694 flow [2023-08-04 04:07:02,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 139.6551724137931) internal successors, (4050), 29 states have internal predecessors, (4050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:07:02,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:07:02,163 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:07:02,169 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-04 04:07:02,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-04 04:07:02,364 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:07:02,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:07:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1474870675, now seen corresponding path program 5 times [2023-08-04 04:07:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:07:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119863619] [2023-08-04 04:07:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:07:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:07:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:07:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:07:03,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:07:03,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119863619] [2023-08-04 04:07:03,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119863619] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:07:03,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072223929] [2023-08-04 04:07:03,069 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-04 04:07:03,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:07:03,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:07:03,070 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-04 04:07:03,072 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-04 04:07:03,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-04 04:07:03,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:07:03,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-04 04:07:03,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:07:03,268 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 114 [2023-08-04 04:07:03,288 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:07:03,288 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 116 [2023-08-04 04:07:03,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:07:03,425 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 11 treesize of output 7 [2023-08-04 04:07:03,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:07:03,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:07:03,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:07:03,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:07:03,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:07:03,911 INFO L322 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-08-04 04:07:03,912 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 15 treesize of output 11 [2023-08-04 04:07:03,976 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:07:04,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:07:04,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:07:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:07:04,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:07:04,468 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:07:04,469 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 21 treesize of output 22 [2023-08-04 04:07:04,479 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:07:04,480 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 35 treesize of output 38 [2023-08-04 04:07:04,486 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 20 treesize of output 18 [2023-08-04 04:07:04,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:07:04,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072223929] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:07:04,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:07:04,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2023-08-04 04:07:04,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918933397] [2023-08-04 04:07:04,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:07:04,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-04 04:07:04,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:07:04,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-04 04:07:04,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=684, Unknown=2, NotChecked=0, Total=812 [2023-08-04 04:07:06,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 462 [2023-08-04 04:07:06,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 841 transitions, 13694 flow. Second operand has 29 states, 29 states have (on average 146.3448275862069) internal successors, (4244), 29 states have internal predecessors, (4244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:07:06,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:07:06,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 462 [2023-08-04 04:07:06,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:07:08,770 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse1 (= (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (and .cse0 (or (and .cse0 (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1415) |c_~#A~0.base|) |c_~#A~0.offset|) 1))) (forall ((v_ArrVal_1414 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (or (and .cse0 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) .cse1) (let ((.cse2 (select |c_#pthreadsMutex| |c_~#__global_lock~0.base|))) (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| .cse2) |c_~#A~0.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 12)) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) (= (select .cse2 |c_~#__global_lock~0.offset|) 1)))) .cse1)) is different from false [2023-08-04 04:07:14,807 INFO L124 PetriNetUnfolderBase]: 5753/12904 cut-off events. [2023-08-04 04:07:14,807 INFO L125 PetriNetUnfolderBase]: For 123699/123763 co-relation queries the response was YES. [2023-08-04 04:07:15,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79160 conditions, 12904 events. 5753/12904 cut-off events. For 123699/123763 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 117717 event pairs, 1952 based on Foata normal form. 126/12131 useless extension candidates. Maximal degree in co-relation 79032. Up to 7626 conditions per place. [2023-08-04 04:07:15,039 INFO L140 encePairwiseOnDemand]: 425/462 looper letters, 718 selfloop transitions, 353 changer transitions 237/1316 dead transitions. [2023-08-04 04:07:15,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 1316 transitions, 21879 flow [2023-08-04 04:07:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-08-04 04:07:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-08-04 04:07:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 7805 transitions. [2023-08-04 04:07:15,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3312537136066548 [2023-08-04 04:07:15,047 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 7805 transitions. [2023-08-04 04:07:15,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 7805 transitions. [2023-08-04 04:07:15,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:07:15,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 7805 transitions. [2023-08-04 04:07:15,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 153.0392156862745) internal successors, (7805), 51 states have internal predecessors, (7805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:07:15,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 462.0) internal successors, (24024), 52 states have internal predecessors, (24024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:07:15,076 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 462.0) internal successors, (24024), 52 states have internal predecessors, (24024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:07:15,076 INFO L175 Difference]: Start difference. First operand has 408 places, 841 transitions, 13694 flow. Second operand 51 states and 7805 transitions. [2023-08-04 04:07:15,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 1316 transitions, 21879 flow [2023-08-04 04:07:16,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 1316 transitions, 21172 flow, removed 183 selfloop flow, removed 29 redundant places. [2023-08-04 04:07:16,109 INFO L231 Difference]: Finished difference. Result has 457 places, 906 transitions, 15294 flow [2023-08-04 04:07:16,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=12851, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=15294, PETRI_PLACES=457, PETRI_TRANSITIONS=906} [2023-08-04 04:07:16,111 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 390 predicate places. [2023-08-04 04:07:16,111 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 906 transitions, 15294 flow [2023-08-04 04:07:16,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 146.3448275862069) internal successors, (4244), 29 states have internal predecessors, (4244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:07:16,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:07:16,113 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:07:16,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-08-04 04:07:16,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-04 04:07:16,314 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:07:16,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:07:16,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1161211909, now seen corresponding path program 6 times [2023-08-04 04:07:16,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:07:16,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134310821] [2023-08-04 04:07:16,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:07:16,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:07:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:07:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:07:17,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:07:17,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134310821] [2023-08-04 04:07:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134310821] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:07:17,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105604403] [2023-08-04 04:07:17,450 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-04 04:07:17,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:07:17,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:07:17,454 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-04 04:07:17,455 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-04 04:07:17,624 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-04 04:07:17,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:07:17,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-04 04:07:17,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:07:17,673 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 116 [2023-08-04 04:07:17,692 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:07:17,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 118 [2023-08-04 04:07:17,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:07:17,851 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:07:17,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 04:07:18,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:07:18,011 INFO L322 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-08-04 04:07:18,011 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 37 [2023-08-04 04:07:18,073 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-04 04:07:18,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-04 04:07:18,080 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 5 treesize of output 3 [2023-08-04 04:07:18,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:07:18,120 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-08-04 04:07:18,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:07:18,225 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:07:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:07:18,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:07:18,385 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1506 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1506) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_1505 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1505) |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)) 0)))) is different from false [2023-08-04 04:07:18,400 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:07:18,400 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 21 treesize of output 22 [2023-08-04 04:07:18,408 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:07:18,409 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 37 treesize of output 40 [2023-08-04 04:07:18,413 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-04 04:07:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:07:18,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105604403] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:07:18,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:07:18,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2023-08-04 04:07:18,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232418208] [2023-08-04 04:07:18,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:07:18,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-04 04:07:18,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:07:18,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-04 04:07:18,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=681, Unknown=2, NotChecked=54, Total=870 [2023-08-04 04:07:18,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 462 [2023-08-04 04:07:18,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 906 transitions, 15294 flow. Second operand has 30 states, 30 states have (on average 137.76666666666668) internal successors, (4133), 30 states have internal predecessors, (4133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:07:18,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:07:18,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 462 [2023-08-04 04:07:18,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:07:26,349 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 67 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:08:13,067 WARN L233 SmtUtils]: Spent 44.57s on a formula simplification. DAG size of input: 77 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:08:25,605 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 65 DAG size of output: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:08:47,984 WARN L233 SmtUtils]: Spent 22.30s on a formula simplification. DAG size of input: 60 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:09:04,554 WARN L233 SmtUtils]: Spent 14.32s on a formula simplification. DAG size of input: 66 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:09:06,596 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-04 04:09:14,842 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 56 DAG size of output: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:09:16,971 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-04 04:09:19,005 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-04 04:09:21,038 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-04 04:09:23,076 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-04 04:09:27,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:09:29,333 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-04 04:09:31,471 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-04 04:10:06,021 WARN L233 SmtUtils]: Spent 33.40s on a formula simplification. DAG size of input: 63 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:10:50,996 WARN L233 SmtUtils]: Spent 44.93s on a formula simplification. DAG size of input: 58 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:10:56,693 INFO L124 PetriNetUnfolderBase]: 6028/13092 cut-off events. [2023-08-04 04:10:56,694 INFO L125 PetriNetUnfolderBase]: For 145212/145243 co-relation queries the response was YES. [2023-08-04 04:10:56,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86539 conditions, 13092 events. 6028/13092 cut-off events. For 145212/145243 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 116746 event pairs, 1190 based on Foata normal form. 53/12211 useless extension candidates. Maximal degree in co-relation 86385. Up to 5932 conditions per place. [2023-08-04 04:10:56,868 INFO L140 encePairwiseOnDemand]: 435/462 looper letters, 743 selfloop transitions, 387 changer transitions 151/1289 dead transitions. [2023-08-04 04:10:56,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 1289 transitions, 22548 flow [2023-08-04 04:10:56,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-04 04:10:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-08-04 04:10:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6069 transitions. [2023-08-04 04:10:56,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31277056277056275 [2023-08-04 04:10:56,872 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 6069 transitions. [2023-08-04 04:10:56,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 6069 transitions. [2023-08-04 04:10:56,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:10:56,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 6069 transitions. [2023-08-04 04:10:56,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 144.5) internal successors, (6069), 42 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:10:56,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 462.0) internal successors, (19866), 43 states have internal predecessors, (19866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:10:56,890 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 462.0) internal successors, (19866), 43 states have internal predecessors, (19866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:10:56,890 INFO L175 Difference]: Start difference. First operand has 457 places, 906 transitions, 15294 flow. Second operand 42 states and 6069 transitions. [2023-08-04 04:10:56,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 1289 transitions, 22548 flow [2023-08-04 04:10:58,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 1289 transitions, 21962 flow, removed 230 selfloop flow, removed 32 redundant places. [2023-08-04 04:10:58,243 INFO L231 Difference]: Finished difference. Result has 458 places, 956 transitions, 16963 flow [2023-08-04 04:10:58,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=14839, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=905, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=16963, PETRI_PLACES=458, PETRI_TRANSITIONS=956} [2023-08-04 04:10:58,245 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 391 predicate places. [2023-08-04 04:10:58,245 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 956 transitions, 16963 flow [2023-08-04 04:10:58,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 137.76666666666668) internal successors, (4133), 30 states have internal predecessors, (4133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:10:58,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:10:58,246 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:10:58,251 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-04 04:10:58,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:10:58,446 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:10:58,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:10:58,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1389174800, now seen corresponding path program 1 times [2023-08-04 04:10:58,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:10:58,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196983390] [2023-08-04 04:10:58,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:10:58,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:10:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:10:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 04:10:58,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:10:58,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196983390] [2023-08-04 04:10:58,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196983390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:10:58,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:10:58,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 04:10:58,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91100427] [2023-08-04 04:10:58,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:10:58,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 04:10:58,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:10:58,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 04:10:58,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 04:10:59,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 462 [2023-08-04 04:10:59,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 956 transitions, 16963 flow. Second operand has 6 states, 6 states have (on average 199.66666666666666) internal successors, (1198), 6 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:10:59,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:10:59,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 462 [2023-08-04 04:10:59,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:11:01,318 INFO L124 PetriNetUnfolderBase]: 2110/6044 cut-off events. [2023-08-04 04:11:01,318 INFO L125 PetriNetUnfolderBase]: For 97773/97862 co-relation queries the response was YES. [2023-08-04 04:11:01,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39036 conditions, 6044 events. 2110/6044 cut-off events. For 97773/97862 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 56581 event pairs, 933 based on Foata normal form. 380/6065 useless extension candidates. Maximal degree in co-relation 38886. Up to 2931 conditions per place. [2023-08-04 04:11:01,407 INFO L140 encePairwiseOnDemand]: 455/462 looper letters, 618 selfloop transitions, 118 changer transitions 32/822 dead transitions. [2023-08-04 04:11:01,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 822 transitions, 14643 flow [2023-08-04 04:11:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:11:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:11:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1310 transitions. [2023-08-04 04:11:01,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725829725829726 [2023-08-04 04:11:01,409 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1310 transitions. [2023-08-04 04:11:01,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1310 transitions. [2023-08-04 04:11:01,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:11:01,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1310 transitions. [2023-08-04 04:11:01,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 218.33333333333334) internal successors, (1310), 6 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:01,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:01,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:01,412 INFO L175 Difference]: Start difference. First operand has 458 places, 956 transitions, 16963 flow. Second operand 6 states and 1310 transitions. [2023-08-04 04:11:01,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 822 transitions, 14643 flow [2023-08-04 04:11:02,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 822 transitions, 13640 flow, removed 168 selfloop flow, removed 33 redundant places. [2023-08-04 04:11:02,056 INFO L231 Difference]: Finished difference. Result has 419 places, 641 transitions, 10389 flow [2023-08-04 04:11:02,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=9933, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10389, PETRI_PLACES=419, PETRI_TRANSITIONS=641} [2023-08-04 04:11:02,057 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 352 predicate places. [2023-08-04 04:11:02,058 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 641 transitions, 10389 flow [2023-08-04 04:11:02,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.66666666666666) internal successors, (1198), 6 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:02,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:11:02,058 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:11:02,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-04 04:11:02,058 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:11:02,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:11:02,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1192427678, now seen corresponding path program 1 times [2023-08-04 04:11:02,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:11:02,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669321526] [2023-08-04 04:11:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:11:02,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:11:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:11:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:02,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:11:02,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669321526] [2023-08-04 04:11:02,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669321526] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:11:02,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762824278] [2023-08-04 04:11:02,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:11:02,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:02,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:11:02,470 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-04 04:11:02,471 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-04 04:11:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:11:02,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-04 04:11:02,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:11:02,662 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 116 [2023-08-04 04:11:02,689 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:11:02,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 118 [2023-08-04 04:11:02,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:02,818 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:02,903 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-04 04:11:02,979 INFO L322 Elim1Store]: treesize reduction 10, result has 28.6 percent of original size [2023-08-04 04:11:02,980 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 17 treesize of output 11 [2023-08-04 04:11:03,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:03,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:03,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:03,109 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:03,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:11:03,147 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1641 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1641) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:11:03,159 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1641 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1641) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:11:03,165 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1641 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1641) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:11:03,173 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1641 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread2of2ForFork0_#t~post7#1|)) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1641) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:11:03,223 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 18 treesize of output 14 [2023-08-04 04:11:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:03,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762824278] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:11:03,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:11:03,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 21 [2023-08-04 04:11:03,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040637963] [2023-08-04 04:11:03,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:11:03,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-04 04:11:03,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:11:03,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-04 04:11:03,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=271, Unknown=4, NotChecked=148, Total=506 [2023-08-04 04:11:03,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 462 [2023-08-04 04:11:03,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 641 transitions, 10389 flow. Second operand has 23 states, 23 states have (on average 141.0) internal successors, (3243), 23 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:03,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:11:03,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 462 [2023-08-04 04:11:03,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:11:06,615 INFO L124 PetriNetUnfolderBase]: 2711/7560 cut-off events. [2023-08-04 04:11:06,616 INFO L125 PetriNetUnfolderBase]: For 81959/82040 co-relation queries the response was YES. [2023-08-04 04:11:06,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46467 conditions, 7560 events. 2711/7560 cut-off events. For 81959/82040 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 72644 event pairs, 1429 based on Foata normal form. 94/7293 useless extension candidates. Maximal degree in co-relation 46331. Up to 4270 conditions per place. [2023-08-04 04:11:06,728 INFO L140 encePairwiseOnDemand]: 442/462 looper letters, 527 selfloop transitions, 96 changer transitions 304/935 dead transitions. [2023-08-04 04:11:06,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 935 transitions, 15646 flow [2023-08-04 04:11:06,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-04 04:11:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-04 04:11:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4338 transitions. [2023-08-04 04:11:06,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3237796686072548 [2023-08-04 04:11:06,732 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4338 transitions. [2023-08-04 04:11:06,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4338 transitions. [2023-08-04 04:11:06,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:11:06,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4338 transitions. [2023-08-04 04:11:06,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 149.58620689655172) internal successors, (4338), 29 states have internal predecessors, (4338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:06,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 462.0) internal successors, (13860), 30 states have internal predecessors, (13860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:06,744 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 462.0) internal successors, (13860), 30 states have internal predecessors, (13860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:06,744 INFO L175 Difference]: Start difference. First operand has 419 places, 641 transitions, 10389 flow. Second operand 29 states and 4338 transitions. [2023-08-04 04:11:06,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 935 transitions, 15646 flow [2023-08-04 04:11:07,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 935 transitions, 15281 flow, removed 39 selfloop flow, removed 8 redundant places. [2023-08-04 04:11:07,291 INFO L231 Difference]: Finished difference. Result has 449 places, 584 transitions, 9502 flow [2023-08-04 04:11:07,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=10112, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=9502, PETRI_PLACES=449, PETRI_TRANSITIONS=584} [2023-08-04 04:11:07,292 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 382 predicate places. [2023-08-04 04:11:07,292 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 584 transitions, 9502 flow [2023-08-04 04:11:07,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 141.0) internal successors, (3243), 23 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:07,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:11:07,293 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:11:07,304 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-04 04:11:07,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:07,500 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:11:07,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:11:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash 731143188, now seen corresponding path program 2 times [2023-08-04 04:11:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:11:07,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637299559] [2023-08-04 04:11:07,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:11:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:11:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:11:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:08,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:11:08,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637299559] [2023-08-04 04:11:08,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637299559] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:11:08,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612140543] [2023-08-04 04:11:08,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:11:08,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:08,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:11:08,062 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-04 04:11:08,084 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-04 04:11:08,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:11:08,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:11:08,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-04 04:11:08,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:11:08,311 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:11:08,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 124 [2023-08-04 04:11:08,325 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 106 treesize of output 106 [2023-08-04 04:11:08,400 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:08,490 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:08,621 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-04 04:11:08,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:08,710 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-04 04:11:08,808 INFO L322 Elim1Store]: treesize reduction 10, result has 28.6 percent of original size [2023-08-04 04:11:08,809 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 17 treesize of output 11 [2023-08-04 04:11:08,846 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:08,918 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:08,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:08,971 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:09,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:11:09,157 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:09,158 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 21 treesize of output 22 [2023-08-04 04:11:09,166 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:09,166 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 35 treesize of output 38 [2023-08-04 04:11:09,170 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 20 treesize of output 18 [2023-08-04 04:11:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:09,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612140543] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:11:09,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:11:09,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2023-08-04 04:11:09,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843008447] [2023-08-04 04:11:09,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:11:09,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-04 04:11:09,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:11:09,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-04 04:11:09,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2023-08-04 04:11:11,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 462 [2023-08-04 04:11:11,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 584 transitions, 9502 flow. Second operand has 25 states, 25 states have (on average 146.44) internal successors, (3661), 25 states have internal predecessors, (3661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:11,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:11:11,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 462 [2023-08-04 04:11:11,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:11:14,767 INFO L124 PetriNetUnfolderBase]: 2238/6262 cut-off events. [2023-08-04 04:11:14,767 INFO L125 PetriNetUnfolderBase]: For 76720/76769 co-relation queries the response was YES. [2023-08-04 04:11:14,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40982 conditions, 6262 events. 2238/6262 cut-off events. For 76720/76769 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 59006 event pairs, 1287 based on Foata normal form. 72/6041 useless extension candidates. Maximal degree in co-relation 40836. Up to 3967 conditions per place. [2023-08-04 04:11:14,857 INFO L140 encePairwiseOnDemand]: 445/462 looper letters, 475 selfloop transitions, 81 changer transitions 231/795 dead transitions. [2023-08-04 04:11:14,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 795 transitions, 13587 flow [2023-08-04 04:11:14,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-04 04:11:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-04 04:11:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4734 transitions. [2023-08-04 04:11:14,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33054042731462085 [2023-08-04 04:11:14,861 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 4734 transitions. [2023-08-04 04:11:14,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 4734 transitions. [2023-08-04 04:11:14,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:11:14,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 4734 transitions. [2023-08-04 04:11:14,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 152.70967741935485) internal successors, (4734), 31 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:14,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 462.0) internal successors, (14784), 32 states have internal predecessors, (14784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:14,873 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 462.0) internal successors, (14784), 32 states have internal predecessors, (14784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:14,873 INFO L175 Difference]: Start difference. First operand has 449 places, 584 transitions, 9502 flow. Second operand 31 states and 4734 transitions. [2023-08-04 04:11:14,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 795 transitions, 13587 flow [2023-08-04 04:11:15,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 795 transitions, 13250 flow, removed 122 selfloop flow, removed 31 redundant places. [2023-08-04 04:11:15,297 INFO L231 Difference]: Finished difference. Result has 436 places, 525 transitions, 8516 flow [2023-08-04 04:11:15,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=9339, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=8516, PETRI_PLACES=436, PETRI_TRANSITIONS=525} [2023-08-04 04:11:15,299 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 369 predicate places. [2023-08-04 04:11:15,299 INFO L495 AbstractCegarLoop]: Abstraction has has 436 places, 525 transitions, 8516 flow [2023-08-04 04:11:15,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 146.44) internal successors, (3661), 25 states have internal predecessors, (3661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:15,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:11:15,300 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:11:15,310 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-04 04:11:15,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:15,507 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:11:15,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:11:15,507 INFO L85 PathProgramCache]: Analyzing trace with hash -870741036, now seen corresponding path program 3 times [2023-08-04 04:11:15,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:11:15,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601576168] [2023-08-04 04:11:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:11:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:11:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:11:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:16,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:11:16,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601576168] [2023-08-04 04:11:16,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601576168] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:11:16,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970799321] [2023-08-04 04:11:16,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 04:11:16,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:16,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:11:16,165 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-04 04:11:16,181 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-04 04:11:16,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 04:11:16,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:11:16,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 50 conjunts are in the unsatisfiable core [2023-08-04 04:11:16,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:11:16,408 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 112 [2023-08-04 04:11:16,434 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:11:16,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 114 [2023-08-04 04:11:16,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:16,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:16,737 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 11 treesize of output 7 [2023-08-04 04:11:16,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:16,845 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:16,937 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:16,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:16,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:17,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:17,027 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:17,125 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:17,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:17,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:17,203 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:11:17,208 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:11:17,208 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 15 treesize of output 11 [2023-08-04 04:11:17,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:17,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:17,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:11:17,322 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1828) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:11:17,407 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1827 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1827) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1828 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1828) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-04 04:11:17,420 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1827 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1827) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1828 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1828) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-04 04:11:17,484 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1827 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1827) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1828 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (select .cse0 |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1828) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-04 04:11:17,508 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:17,508 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 21 treesize of output 22 [2023-08-04 04:11:17,516 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:17,516 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 35 treesize of output 38 [2023-08-04 04:11:17,531 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 20 treesize of output 18 [2023-08-04 04:11:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:17,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970799321] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:11:17,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:11:17,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2023-08-04 04:11:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948850300] [2023-08-04 04:11:17,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:11:17,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-04 04:11:17,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:11:17,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-04 04:11:17,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=398, Unknown=14, NotChecked=180, Total=702 [2023-08-04 04:11:17,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 462 [2023-08-04 04:11:17,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 525 transitions, 8516 flow. Second operand has 27 states, 27 states have (on average 139.62962962962962) internal successors, (3770), 27 states have internal predecessors, (3770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:17,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:11:17,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 462 [2023-08-04 04:11:17,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:11:18,884 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1827 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1827) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse1 (select |c_#memory_int| |c_~#A~0.base|))) (and (or .cse0 (forall ((v_ArrVal_1828 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse1 |c_~#A~0.offset| |c_t_funThread2of2ForFork0_#t~post7#1|)) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1828) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (= 1 (select (select |c_#pthreadsMutex| 4) 12)) (or .cse0 (forall ((v_ArrVal_1828 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1828) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (= (select .cse1 |c_~#A~0.offset|) 0)) (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (<= (+ |c_~#A~0.offset| 12) |c_ULTIMATE.start_main_~m~0#1.offset|) (< |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 13)) (= (select (select |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1))) (= |c_~#A~0.offset| 0) (= (select (select |c_#memory_int| 4) 0) 1) (<= |c_~#__global_lock~0.base| 3) (= |c_~#A~0.base| 4) (let ((.cse2 (= |c_ULTIMATE.start_main_~m~0#1.offset| 12))) (or (and (<= 5 |c_ULTIMATE.start_main_~d~0#1.base|) .cse2 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~d~0#1.base|)) (and (= |c_ULTIMATE.start_main_~m~0#1.base| 4) .cse2 (= |c_ULTIMATE.start_main_~d~0#1.base| 4)))))) is different from false [2023-08-04 04:11:19,053 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1827 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1827) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse1 (select |c_#memory_int| |c_~#A~0.base|))) (and (or .cse0 (forall ((v_ArrVal_1828 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse1 |c_~#A~0.offset| |c_t_funThread2of2ForFork0_#t~post7#1|)) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1828) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (= |c_t_funThread2of2ForFork0_#t~post10#1| 1) (= 1 (select (select |c_#pthreadsMutex| 4) 12)) (or .cse0 (forall ((v_ArrVal_1828 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1828) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (= (select .cse1 |c_~#A~0.offset|) 0)) (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (<= (+ |c_~#A~0.offset| 12) |c_ULTIMATE.start_main_~m~0#1.offset|) (< |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 13)) (= (select (select |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1))) (= |c_~#A~0.offset| 0) (= (select (select |c_#memory_int| 4) 0) 1) (<= |c_~#__global_lock~0.base| 3) (= |c_~#A~0.base| 4) (let ((.cse2 (= |c_ULTIMATE.start_main_~m~0#1.offset| 12))) (or (and (<= 5 |c_ULTIMATE.start_main_~d~0#1.base|) .cse2 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~d~0#1.base|)) (and (= |c_ULTIMATE.start_main_~m~0#1.base| 4) .cse2 (= |c_ULTIMATE.start_main_~d~0#1.base| 4)))))) is different from false [2023-08-04 04:11:19,565 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (and (or (forall ((v_ArrVal_1827 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1827) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1828 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse0 |c_~#A~0.offset| |c_t_funThread2of2ForFork0_#t~post7#1|)) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1828) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (<= (+ |c_~#A~0.offset| 12) |c_ULTIMATE.start_main_~m~0#1.offset|) (< |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 13)) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) (= (select (select |c_#pthreadsMutex| |c_~#A~0.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1)) (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (= (select .cse0 |c_~#A~0.offset|) 0))) (= (select (select |c_#memory_int| 4) 0) 0) (= |c_~#A~0.offset| 0) (<= |c_~#__global_lock~0.base| 3) (= |c_~#A~0.base| 4) (let ((.cse1 (= |c_ULTIMATE.start_main_~m~0#1.offset| 12))) (or (and (<= 5 |c_ULTIMATE.start_main_~d~0#1.base|) .cse1 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~d~0#1.base|)) (and (= |c_ULTIMATE.start_main_~m~0#1.base| 4) .cse1 (= |c_ULTIMATE.start_main_~d~0#1.base| 4)))))) is different from false [2023-08-04 04:11:22,096 INFO L124 PetriNetUnfolderBase]: 2009/5718 cut-off events. [2023-08-04 04:11:22,096 INFO L125 PetriNetUnfolderBase]: For 60147/60178 co-relation queries the response was YES. [2023-08-04 04:11:22,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35049 conditions, 5718 events. 2009/5718 cut-off events. For 60147/60178 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 53460 event pairs, 1128 based on Foata normal form. 41/5487 useless extension candidates. Maximal degree in co-relation 34912. Up to 3578 conditions per place. [2023-08-04 04:11:22,170 INFO L140 encePairwiseOnDemand]: 440/462 looper letters, 532 selfloop transitions, 121 changer transitions 131/792 dead transitions. [2023-08-04 04:11:22,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 792 transitions, 13133 flow [2023-08-04 04:11:22,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-04 04:11:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-04 04:11:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 5253 transitions. [2023-08-04 04:11:22,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31583694083694086 [2023-08-04 04:11:22,175 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 5253 transitions. [2023-08-04 04:11:22,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 5253 transitions. [2023-08-04 04:11:22,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:11:22,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 5253 transitions. [2023-08-04 04:11:22,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 145.91666666666666) internal successors, (5253), 36 states have internal predecessors, (5253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:22,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 462.0) internal successors, (17094), 37 states have internal predecessors, (17094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:22,187 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 462.0) internal successors, (17094), 37 states have internal predecessors, (17094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:22,187 INFO L175 Difference]: Start difference. First operand has 436 places, 525 transitions, 8516 flow. Second operand 36 states and 5253 transitions. [2023-08-04 04:11:22,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 792 transitions, 13133 flow [2023-08-04 04:11:22,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 792 transitions, 12443 flow, removed 145 selfloop flow, removed 36 redundant places. [2023-08-04 04:11:22,527 INFO L231 Difference]: Finished difference. Result has 430 places, 561 transitions, 9035 flow [2023-08-04 04:11:22,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=8088, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=9035, PETRI_PLACES=430, PETRI_TRANSITIONS=561} [2023-08-04 04:11:22,528 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 363 predicate places. [2023-08-04 04:11:22,528 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 561 transitions, 9035 flow [2023-08-04 04:11:22,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 139.62962962962962) internal successors, (3770), 27 states have internal predecessors, (3770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:22,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:11:22,529 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:11:22,536 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-04 04:11:22,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:22,736 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:11:22,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:11:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash 162249650, now seen corresponding path program 4 times [2023-08-04 04:11:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:11:22,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77376697] [2023-08-04 04:11:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:11:22,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:11:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:11:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:23,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:11:23,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77376697] [2023-08-04 04:11:23,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77376697] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:11:23,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289837008] [2023-08-04 04:11:23,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 04:11:23,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:23,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:11:23,147 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-04 04:11:23,148 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-04 04:11:23,314 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 04:11:23,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:11:23,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-04 04:11:23,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:11:23,362 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 114 [2023-08-04 04:11:23,381 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:11:23,381 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 116 [2023-08-04 04:11:23,482 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:23,558 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:23,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:23,858 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:23,930 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 11 treesize of output 7 [2023-08-04 04:11:23,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:23,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-04 04:11:24,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:24,042 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:24,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:11:24,075 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1919 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1919) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:11:24,119 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 20 treesize of output 14 [2023-08-04 04:11:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:24,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289837008] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:11:24,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:11:24,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-08-04 04:11:24,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742558210] [2023-08-04 04:11:24,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:11:24,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-04 04:11:24,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:11:24,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-04 04:11:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=274, Unknown=1, NotChecked=34, Total=380 [2023-08-04 04:11:24,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 462 [2023-08-04 04:11:24,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 561 transitions, 9035 flow. Second operand has 20 states, 20 states have (on average 141.15) internal successors, (2823), 20 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:24,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:11:24,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 462 [2023-08-04 04:11:24,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:11:27,326 INFO L124 PetriNetUnfolderBase]: 1843/5164 cut-off events. [2023-08-04 04:11:27,326 INFO L125 PetriNetUnfolderBase]: For 47261/47265 co-relation queries the response was YES. [2023-08-04 04:11:27,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30387 conditions, 5164 events. 1843/5164 cut-off events. For 47261/47265 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 47420 event pairs, 526 based on Foata normal form. 36/4972 useless extension candidates. Maximal degree in co-relation 30255. Up to 2289 conditions per place. [2023-08-04 04:11:27,373 INFO L140 encePairwiseOnDemand]: 445/462 looper letters, 475 selfloop transitions, 178 changer transitions 65/726 dead transitions. [2023-08-04 04:11:27,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 726 transitions, 12042 flow [2023-08-04 04:11:27,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-04 04:11:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-04 04:11:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4299 transitions. [2023-08-04 04:11:27,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3208687863860278 [2023-08-04 04:11:27,376 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4299 transitions. [2023-08-04 04:11:27,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4299 transitions. [2023-08-04 04:11:27,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:11:27,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4299 transitions. [2023-08-04 04:11:27,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 148.24137931034483) internal successors, (4299), 29 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:27,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 462.0) internal successors, (13860), 30 states have internal predecessors, (13860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:27,386 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 462.0) internal successors, (13860), 30 states have internal predecessors, (13860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:27,386 INFO L175 Difference]: Start difference. First operand has 430 places, 561 transitions, 9035 flow. Second operand 29 states and 4299 transitions. [2023-08-04 04:11:27,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 726 transitions, 12042 flow [2023-08-04 04:11:27,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 726 transitions, 11751 flow, removed 74 selfloop flow, removed 20 redundant places. [2023-08-04 04:11:27,650 INFO L231 Difference]: Finished difference. Result has 437 places, 561 transitions, 9080 flow [2023-08-04 04:11:27,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=8765, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=9080, PETRI_PLACES=437, PETRI_TRANSITIONS=561} [2023-08-04 04:11:27,650 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 370 predicate places. [2023-08-04 04:11:27,651 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 561 transitions, 9080 flow [2023-08-04 04:11:27,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 141.15) internal successors, (2823), 20 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:27,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:11:27,651 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:11:27,659 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-04 04:11:27,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:27,856 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:11:27,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:11:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1147575076, now seen corresponding path program 5 times [2023-08-04 04:11:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:11:27,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630601537] [2023-08-04 04:11:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:11:27,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:11:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:11:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:28,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:11:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630601537] [2023-08-04 04:11:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630601537] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:11:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794105539] [2023-08-04 04:11:28,638 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-04 04:11:28,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:28,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:11:28,642 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-04 04:11:28,650 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-04 04:11:28,838 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-04 04:11:28,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:11:28,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-04 04:11:28,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:11:28,899 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:11:28,900 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 124 [2023-08-04 04:11:28,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 106 treesize of output 106 [2023-08-04 04:11:29,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 14 treesize of output 16 [2023-08-04 04:11:29,093 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:29,320 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:29,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:29,549 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 11 treesize of output 7 [2023-08-04 04:11:29,636 INFO L322 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-08-04 04:11:29,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 37 [2023-08-04 04:11:29,677 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-04 04:11:29,678 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-04 04:11:29,682 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 5 treesize of output 3 [2023-08-04 04:11:29,739 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-04 04:11:29,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44 [2023-08-04 04:11:29,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:29,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-08-04 04:11:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:29,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:11:29,909 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:29,909 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-08-04 04:11:29,917 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2011 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2011) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((|~#__global_lock~0.offset| Int) (v_arrayElimArr_49 (Array Int Int))) (or (not (= (select v_arrayElimArr_49 |~#__global_lock~0.offset|) 0)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_arrayElimArr_49) |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)) 0))))) is different from false [2023-08-04 04:11:29,939 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:29,939 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 21 treesize of output 22 [2023-08-04 04:11:29,946 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:29,946 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 37 treesize of output 40 [2023-08-04 04:11:29,962 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:29,962 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 29 treesize of output 33 [2023-08-04 04:11:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:30,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794105539] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:11:30,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:11:30,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 27 [2023-08-04 04:11:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059587914] [2023-08-04 04:11:30,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:11:30,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-04 04:11:30,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:11:30,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-04 04:11:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=630, Unknown=9, NotChecked=52, Total=812 [2023-08-04 04:11:30,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 462 [2023-08-04 04:11:30,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 561 transitions, 9080 flow. Second operand has 29 states, 29 states have (on average 139.79310344827587) internal successors, (4054), 29 states have internal predecessors, (4054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:30,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:11:30,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 462 [2023-08-04 04:11:30,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:11:35,398 INFO L124 PetriNetUnfolderBase]: 1779/4981 cut-off events. [2023-08-04 04:11:35,398 INFO L125 PetriNetUnfolderBase]: For 47438/47440 co-relation queries the response was YES. [2023-08-04 04:11:35,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29496 conditions, 4981 events. 1779/4981 cut-off events. For 47438/47440 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 45619 event pairs, 281 based on Foata normal form. 17/4776 useless extension candidates. Maximal degree in co-relation 29366. Up to 2218 conditions per place. [2023-08-04 04:11:35,459 INFO L140 encePairwiseOnDemand]: 437/462 looper letters, 437 selfloop transitions, 262 changer transitions 61/768 dead transitions. [2023-08-04 04:11:35,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 768 transitions, 12540 flow [2023-08-04 04:11:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-04 04:11:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-04 04:11:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 6780 transitions. [2023-08-04 04:11:35,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3122409505388229 [2023-08-04 04:11:35,464 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 6780 transitions. [2023-08-04 04:11:35,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 6780 transitions. [2023-08-04 04:11:35,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:11:35,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 6780 transitions. [2023-08-04 04:11:35,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 144.25531914893617) internal successors, (6780), 47 states have internal predecessors, (6780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:35,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 462.0) internal successors, (22176), 48 states have internal predecessors, (22176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:35,479 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 462.0) internal successors, (22176), 48 states have internal predecessors, (22176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:35,479 INFO L175 Difference]: Start difference. First operand has 437 places, 561 transitions, 9080 flow. Second operand 47 states and 6780 transitions. [2023-08-04 04:11:35,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 768 transitions, 12540 flow [2023-08-04 04:11:35,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 768 transitions, 12292 flow, removed 46 selfloop flow, removed 19 redundant places. [2023-08-04 04:11:35,734 INFO L231 Difference]: Finished difference. Result has 468 places, 601 transitions, 10059 flow [2023-08-04 04:11:35,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=8858, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=10059, PETRI_PLACES=468, PETRI_TRANSITIONS=601} [2023-08-04 04:11:35,735 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 401 predicate places. [2023-08-04 04:11:35,735 INFO L495 AbstractCegarLoop]: Abstraction has has 468 places, 601 transitions, 10059 flow [2023-08-04 04:11:35,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 139.79310344827587) internal successors, (4054), 29 states have internal predecessors, (4054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:35,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:11:35,736 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:11:35,741 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-04 04:11:35,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:35,937 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:11:35,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:11:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash -674860800, now seen corresponding path program 6 times [2023-08-04 04:11:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:11:35,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071144743] [2023-08-04 04:11:35,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:11:35,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:11:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:11:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:36,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:11:36,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071144743] [2023-08-04 04:11:36,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071144743] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:11:36,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863062079] [2023-08-04 04:11:36,839 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-04 04:11:36,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:36,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:11:36,841 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-04 04:11:36,850 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-04 04:11:37,066 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-04 04:11:37,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:11:37,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-04 04:11:37,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:11:37,119 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 112 [2023-08-04 04:11:37,172 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-04 04:11:37,173 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 127 treesize of output 150 [2023-08-04 04:11:37,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:37,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:37,402 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 11 treesize of output 7 [2023-08-04 04:11:37,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:37,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:37,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:37,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:37,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:37,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:37,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:37,649 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:11:37,650 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 15 treesize of output 11 [2023-08-04 04:11:37,696 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:37,807 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:37,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:11:37,869 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 8 treesize of output 4 [2023-08-04 04:11:38,066 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:38,066 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 21 treesize of output 22 [2023-08-04 04:11:38,076 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:38,077 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 35 treesize of output 38 [2023-08-04 04:11:38,081 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 20 treesize of output 18 [2023-08-04 04:11:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:38,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863062079] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:11:38,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:11:38,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 29 [2023-08-04 04:11:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371116908] [2023-08-04 04:11:38,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:11:38,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-04 04:11:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:11:38,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-04 04:11:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=783, Unknown=5, NotChecked=0, Total=930 [2023-08-04 04:11:41,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 462 [2023-08-04 04:11:41,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 601 transitions, 10059 flow. Second operand has 31 states, 31 states have (on average 142.32258064516128) internal successors, (4412), 31 states have internal predecessors, (4412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:41,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:11:41,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 462 [2023-08-04 04:11:41,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:11:46,140 INFO L124 PetriNetUnfolderBase]: 2024/5683 cut-off events. [2023-08-04 04:11:46,140 INFO L125 PetriNetUnfolderBase]: For 62295/62330 co-relation queries the response was YES. [2023-08-04 04:11:46,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34555 conditions, 5683 events. 2024/5683 cut-off events. For 62295/62330 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 52899 event pairs, 1055 based on Foata normal form. 69/5513 useless extension candidates. Maximal degree in co-relation 34420. Up to 2976 conditions per place. [2023-08-04 04:11:46,220 INFO L140 encePairwiseOnDemand]: 438/462 looper letters, 501 selfloop transitions, 192 changer transitions 128/829 dead transitions. [2023-08-04 04:11:46,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 829 transitions, 14304 flow [2023-08-04 04:11:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-04 04:11:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-08-04 04:11:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6214 transitions. [2023-08-04 04:11:46,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32024324881467736 [2023-08-04 04:11:46,225 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 6214 transitions. [2023-08-04 04:11:46,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 6214 transitions. [2023-08-04 04:11:46,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:11:46,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 6214 transitions. [2023-08-04 04:11:46,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 147.95238095238096) internal successors, (6214), 42 states have internal predecessors, (6214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:46,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 462.0) internal successors, (19866), 43 states have internal predecessors, (19866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:46,246 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 462.0) internal successors, (19866), 43 states have internal predecessors, (19866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:46,246 INFO L175 Difference]: Start difference. First operand has 468 places, 601 transitions, 10059 flow. Second operand 42 states and 6214 transitions. [2023-08-04 04:11:46,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 829 transitions, 14304 flow [2023-08-04 04:11:46,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 829 transitions, 13531 flow, removed 159 selfloop flow, removed 27 redundant places. [2023-08-04 04:11:46,777 INFO L231 Difference]: Finished difference. Result has 490 places, 609 transitions, 10119 flow [2023-08-04 04:11:46,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=9453, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=10119, PETRI_PLACES=490, PETRI_TRANSITIONS=609} [2023-08-04 04:11:46,778 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 423 predicate places. [2023-08-04 04:11:46,778 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 609 transitions, 10119 flow [2023-08-04 04:11:46,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 142.32258064516128) internal successors, (4412), 31 states have internal predecessors, (4412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:46,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:11:46,779 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:11:46,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-04 04:11:46,979 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,SelfDestructingSolverStorable34 [2023-08-04 04:11:46,979 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:11:46,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:11:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash 804808022, now seen corresponding path program 7 times [2023-08-04 04:11:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:11:46,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223640943] [2023-08-04 04:11:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:11:46,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:11:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:11:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:47,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:11:47,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223640943] [2023-08-04 04:11:47,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223640943] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:11:47,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960861458] [2023-08-04 04:11:47,566 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-04 04:11:47,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:47,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:11:47,567 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-04 04:11:47,569 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-04 04:11:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:11:47,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-04 04:11:47,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:11:47,785 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 114 [2023-08-04 04:11:47,804 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:11:47,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 116 [2023-08-04 04:11:47,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:47,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:48,065 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 11 treesize of output 7 [2023-08-04 04:11:48,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:48,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:48,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:48,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:48,282 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:48,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:48,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:48,370 INFO L322 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-08-04 04:11:48,370 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 15 treesize of output 11 [2023-08-04 04:11:48,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:11:48,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:11:48,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:48,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:11:48,557 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2200 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2200) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:11:48,579 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2200 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2200) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-04 04:11:48,740 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:48,740 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 21 treesize of output 22 [2023-08-04 04:11:48,750 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:11:48,750 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 35 treesize of output 38 [2023-08-04 04:11:48,771 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 20 treesize of output 18 [2023-08-04 04:11:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:48,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960861458] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:11:48,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:11:48,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-08-04 04:11:48,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024573589] [2023-08-04 04:11:48,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:11:48,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-04 04:11:48,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:11:48,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-04 04:11:48,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=538, Unknown=2, NotChecked=98, Total=756 [2023-08-04 04:11:49,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 462 [2023-08-04 04:11:49,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 609 transitions, 10119 flow. Second operand has 28 states, 28 states have (on average 139.60714285714286) internal successors, (3909), 28 states have internal predecessors, (3909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:49,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:11:49,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 462 [2023-08-04 04:11:49,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:11:53,296 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse0 (forall ((v_ArrVal_2197 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2197) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse1 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)))) (and (or .cse0 (and .cse1 (= .cse2 0))) (or (and .cse1 (= .cse2 1)) .cse0) (or .cse0 (and .cse1 (= |c_t_funThread2of2ForFork0_#t~post7#1| 0))))) is different from false [2023-08-04 04:11:54,669 INFO L124 PetriNetUnfolderBase]: 1741/4895 cut-off events. [2023-08-04 04:11:54,669 INFO L125 PetriNetUnfolderBase]: For 52677/52709 co-relation queries the response was YES. [2023-08-04 04:11:54,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29344 conditions, 4895 events. 1741/4895 cut-off events. For 52677/52709 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 44049 event pairs, 964 based on Foata normal form. 61/4727 useless extension candidates. Maximal degree in co-relation 29204. Up to 3063 conditions per place. [2023-08-04 04:11:54,734 INFO L140 encePairwiseOnDemand]: 442/462 looper letters, 441 selfloop transitions, 89 changer transitions 167/705 dead transitions. [2023-08-04 04:11:54,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 705 transitions, 12309 flow [2023-08-04 04:11:54,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-04 04:11:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-04 04:11:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 5182 transitions. [2023-08-04 04:11:54,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31156806156806155 [2023-08-04 04:11:54,738 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 5182 transitions. [2023-08-04 04:11:54,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 5182 transitions. [2023-08-04 04:11:54,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:11:54,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 5182 transitions. [2023-08-04 04:11:54,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 143.94444444444446) internal successors, (5182), 36 states have internal predecessors, (5182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:54,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 462.0) internal successors, (17094), 37 states have internal predecessors, (17094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:54,756 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 462.0) internal successors, (17094), 37 states have internal predecessors, (17094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:54,756 INFO L175 Difference]: Start difference. First operand has 490 places, 609 transitions, 10119 flow. Second operand 36 states and 5182 transitions. [2023-08-04 04:11:54,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 705 transitions, 12309 flow [2023-08-04 04:11:55,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 705 transitions, 11878 flow, removed 86 selfloop flow, removed 31 redundant places. [2023-08-04 04:11:55,138 INFO L231 Difference]: Finished difference. Result has 492 places, 507 transitions, 8264 flow [2023-08-04 04:11:55,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=9544, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=8264, PETRI_PLACES=492, PETRI_TRANSITIONS=507} [2023-08-04 04:11:55,139 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 425 predicate places. [2023-08-04 04:11:55,139 INFO L495 AbstractCegarLoop]: Abstraction has has 492 places, 507 transitions, 8264 flow [2023-08-04 04:11:55,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 139.60714285714286) internal successors, (3909), 28 states have internal predecessors, (3909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:55,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:11:55,140 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:11:55,149 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-04 04:11:55,346 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,SelfDestructingSolverStorable35 [2023-08-04 04:11:55,347 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:11:55,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:11:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash 133935768, now seen corresponding path program 1 times [2023-08-04 04:11:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:11:55,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834834665] [2023-08-04 04:11:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:11:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:11:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:11:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:56,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:11:56,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834834665] [2023-08-04 04:11:56,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834834665] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:11:56,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910538703] [2023-08-04 04:11:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:11:56,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:11:56,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:11:56,093 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-04 04:11:56,096 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-04 04:11:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:11:56,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-04 04:11:56,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:11:56,375 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:11:56,375 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 124 [2023-08-04 04:11:56,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 106 treesize of output 106 [2023-08-04 04:11:56,442 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:56,495 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:11:56,664 INFO L322 Elim1Store]: treesize reduction 26, result has 43.5 percent of original size [2023-08-04 04:11:56,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2023-08-04 04:11:56,873 INFO L322 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2023-08-04 04:11:56,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 44 [2023-08-04 04:11:57,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2023-08-04 04:11:57,285 INFO L322 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2023-08-04 04:11:57,286 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2023-08-04 04:11:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:57,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:11:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:11:57,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910538703] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:11:57,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:11:57,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 17 [2023-08-04 04:11:57,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206447177] [2023-08-04 04:11:57,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:11:57,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 04:11:57,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:11:57,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 04:11:57,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-08-04 04:11:59,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 462 [2023-08-04 04:11:59,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 507 transitions, 8264 flow. Second operand has 19 states, 19 states have (on average 198.94736842105263) internal successors, (3780), 19 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:11:59,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:11:59,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 462 [2023-08-04 04:11:59,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:12:01,022 INFO L124 PetriNetUnfolderBase]: 1237/3659 cut-off events. [2023-08-04 04:12:01,022 INFO L125 PetriNetUnfolderBase]: For 39334/39467 co-relation queries the response was YES. [2023-08-04 04:12:01,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21485 conditions, 3659 events. 1237/3659 cut-off events. For 39334/39467 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 32368 event pairs, 755 based on Foata normal form. 86/3500 useless extension candidates. Maximal degree in co-relation 21346. Up to 2048 conditions per place. [2023-08-04 04:12:01,067 INFO L140 encePairwiseOnDemand]: 450/462 looper letters, 364 selfloop transitions, 43 changer transitions 84/533 dead transitions. [2023-08-04 04:12:01,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 533 transitions, 9503 flow [2023-08-04 04:12:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 04:12:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 04:12:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2268 transitions. [2023-08-04 04:12:01,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4462809917355372 [2023-08-04 04:12:01,069 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2268 transitions. [2023-08-04 04:12:01,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2268 transitions. [2023-08-04 04:12:01,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:12:01,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2268 transitions. [2023-08-04 04:12:01,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 206.1818181818182) internal successors, (2268), 11 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:12:01,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 462.0) internal successors, (5544), 12 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:12:01,073 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 462.0) internal successors, (5544), 12 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:12:01,073 INFO L175 Difference]: Start difference. First operand has 492 places, 507 transitions, 8264 flow. Second operand 11 states and 2268 transitions. [2023-08-04 04:12:01,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 533 transitions, 9503 flow [2023-08-04 04:12:01,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 533 transitions, 8930 flow, removed 44 selfloop flow, removed 57 redundant places. [2023-08-04 04:12:01,242 INFO L231 Difference]: Finished difference. Result has 425 places, 436 transitions, 6658 flow [2023-08-04 04:12:01,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=7452, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6658, PETRI_PLACES=425, PETRI_TRANSITIONS=436} [2023-08-04 04:12:01,243 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 358 predicate places. [2023-08-04 04:12:01,243 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 436 transitions, 6658 flow [2023-08-04 04:12:01,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 198.94736842105263) internal successors, (3780), 19 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:12:01,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:12:01,243 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:12:01,249 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-04 04:12:01,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-08-04 04:12:01,444 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:12:01,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:12:01,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1463495152, now seen corresponding path program 2 times [2023-08-04 04:12:01,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:12:01,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544508923] [2023-08-04 04:12:01,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:12:01,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:12:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:12:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:12:01,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:12:01,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544508923] [2023-08-04 04:12:01,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544508923] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:12:01,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026958052] [2023-08-04 04:12:01,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:12:01,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:12:01,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:12:01,952 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-04 04:12:01,954 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-04 04:12:02,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:12:02,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:12:02,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-04 04:12:02,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:12:02,243 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 116 [2023-08-04 04:12:02,261 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 04:12:02,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 118 [2023-08-04 04:12:02,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:12:02,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:12:02,497 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 11 treesize of output 7 [2023-08-04 04:12:02,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:12:02,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:12:02,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2023-08-04 04:12:02,615 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-04 04:12:02,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-04 04:12:02,619 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 5 treesize of output 3 [2023-08-04 04:12:02,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:12:02,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:12:02,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2023-08-04 04:12:02,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:12:02,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:12:02,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2023-08-04 04:12:02,756 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-08-04 04:12:02,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 14 treesize of output 16 [2023-08-04 04:12:02,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:12:02,879 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:12:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:12:02,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:12:02,986 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2407 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2407) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_2406 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2406) |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)) 0)))) is different from false [2023-08-04 04:12:03,013 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:12:03,013 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 21 treesize of output 22 [2023-08-04 04:12:03,019 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:12:03,020 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 37 treesize of output 40 [2023-08-04 04:12:03,023 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-04 04:12:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:12:03,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026958052] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:12:03,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:12:03,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 23 [2023-08-04 04:12:03,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514072982] [2023-08-04 04:12:03,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:12:03,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-04 04:12:03,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:12:03,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-04 04:12:03,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=464, Unknown=7, NotChecked=44, Total=600 [2023-08-04 04:12:03,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 462 [2023-08-04 04:12:03,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 436 transitions, 6658 flow. Second operand has 25 states, 25 states have (on average 136.28) internal successors, (3407), 25 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:12:03,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:12:03,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 462 [2023-08-04 04:12:03,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:12:12,243 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-04 04:12:14,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:12:16,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:12:18,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:12:22,474 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-04 04:12:24,501 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-04 04:12:26,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:12:28,546 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-04 04:12:30,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:13:55,964 WARN L233 SmtUtils]: Spent 1.25m on a formula simplification. DAG size of input: 67 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:13:58,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:13:59,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:14:02,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:14:04,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 [0, 1] [2023-08-04 04:15:03,791 WARN L233 SmtUtils]: Spent 53.24s on a formula simplification. DAG size of input: 72 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:15:05,850 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-04 04:15:05,873 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#A~0.offset| 12))) (and (= (select (select |c_#memory_int| 4) |c_~#A~0.offset|) 0) (or (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse0) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|)) (forall ((v_ArrVal_2407 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2407) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (<= |c_~#__global_lock~0.base| 3) (= |c_~#A~0.base| 4) (or (and (exists ((|ULTIMATE.start_main_~m~0#1.offset| Int)) (= (select (select |c_#pthreadsMutex| 5) |ULTIMATE.start_main_~m~0#1.offset|) 1)) (= |c_ULTIMATE.start_main_~d~0#1.base| 5)) (and (= (select (select |c_#pthreadsMutex| 4) .cse0) 1) (= |c_ULTIMATE.start_main_~d~0#1.base| 4))))) is different from false [2023-08-04 04:15:07,898 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-04 04:15:09,921 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-04 04:15:16,220 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-04 04:15:20,368 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-04 04:15:22,397 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-04 04:15:24,485 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-04 04:15:32,819 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-04 04:15:35,678 INFO L124 PetriNetUnfolderBase]: 1154/3246 cut-off events. [2023-08-04 04:15:35,679 INFO L125 PetriNetUnfolderBase]: For 29809/29809 co-relation queries the response was YES. [2023-08-04 04:15:35,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18487 conditions, 3246 events. 1154/3246 cut-off events. For 29809/29809 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 26929 event pairs, 223 based on Foata normal form. 99/3185 useless extension candidates. Maximal degree in co-relation 18368. Up to 1457 conditions per place. [2023-08-04 04:15:35,715 INFO L140 encePairwiseOnDemand]: 442/462 looper letters, 221 selfloop transitions, 72 changer transitions 279/580 dead transitions. [2023-08-04 04:15:35,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 580 transitions, 9058 flow [2023-08-04 04:15:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-04 04:15:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-04 04:15:35,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4769 transitions. [2023-08-04 04:15:35,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30360325948561245 [2023-08-04 04:15:35,719 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4769 transitions. [2023-08-04 04:15:35,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4769 transitions. [2023-08-04 04:15:35,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:15:35,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4769 transitions. [2023-08-04 04:15:35,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 140.26470588235293) internal successors, (4769), 34 states have internal predecessors, (4769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:15:35,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 462.0) internal successors, (16170), 35 states have internal predecessors, (16170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:15:35,737 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 462.0) internal successors, (16170), 35 states have internal predecessors, (16170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:15:35,737 INFO L175 Difference]: Start difference. First operand has 425 places, 436 transitions, 6658 flow. Second operand 34 states and 4769 transitions. [2023-08-04 04:15:35,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 580 transitions, 9058 flow [2023-08-04 04:15:35,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 580 transitions, 8688 flow, removed 29 selfloop flow, removed 20 redundant places. [2023-08-04 04:15:35,909 INFO L231 Difference]: Finished difference. Result has 443 places, 256 transitions, 3458 flow [2023-08-04 04:15:35,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=6218, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=3458, PETRI_PLACES=443, PETRI_TRANSITIONS=256} [2023-08-04 04:15:35,910 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 376 predicate places. [2023-08-04 04:15:35,910 INFO L495 AbstractCegarLoop]: Abstraction has has 443 places, 256 transitions, 3458 flow [2023-08-04 04:15:35,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 136.28) internal successors, (3407), 25 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:15:35,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:15:35,911 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:15:35,917 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-04 04:15:36,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:15:36,111 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:15:36,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:15:36,112 INFO L85 PathProgramCache]: Analyzing trace with hash -157393078, now seen corresponding path program 3 times [2023-08-04 04:15:36,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:15:36,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630847168] [2023-08-04 04:15:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:15:36,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:15:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:15:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:15:36,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:15:36,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630847168] [2023-08-04 04:15:36,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630847168] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:15:36,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390924454] [2023-08-04 04:15:36,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 04:15:36,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:15:36,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:15:36,676 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:15:36,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-04 04:15:36,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 04:15:36,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:15:36,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-04 04:15:36,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:15:36,963 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 112 [2023-08-04 04:15:37,015 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-04 04:15:37,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 127 treesize of output 150 [2023-08-04 04:15:37,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:15:37,388 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:15:37,562 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 11 treesize of output 7 [2023-08-04 04:15:37,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:15:37,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:15:37,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2023-08-04 04:15:37,763 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:15:37,786 INFO L322 Elim1Store]: treesize reduction 41, result has 38.8 percent of original size [2023-08-04 04:15:37,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 41 [2023-08-04 04:15:37,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:15:37,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:15:37,872 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2023-08-04 04:15:38,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-04 04:15:38,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-04 04:15:38,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 04:15:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:15:38,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:15:38,304 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2516 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2516) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) is different from false [2023-08-04 04:15:38,474 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2516 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset| (+ |c_ULTIMATE.start_main_#t~mem22#1| 1))))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2516) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) (forall ((v_ArrVal_2513 (Array Int Int))) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2513) |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)))))) is different from false [2023-08-04 04:15:38,611 INFO L322 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-08-04 04:15:38,612 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2023-08-04 04:15:38,635 INFO L322 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2023-08-04 04:15:38,635 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 54 [2023-08-04 04:15:38,641 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-04 04:15:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:15:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390924454] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:15:40,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:15:40,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2023-08-04 04:15:40,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319212842] [2023-08-04 04:15:40,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:15:40,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-04 04:15:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:15:40,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-04 04:15:40,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=845, Unknown=13, NotChecked=122, Total=1122 [2023-08-04 04:15:40,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 462 [2023-08-04 04:15:40,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 256 transitions, 3458 flow. Second operand has 34 states, 34 states have (on average 135.52941176470588) internal successors, (4608), 34 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:15:40,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:15:40,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 462 [2023-08-04 04:15:40,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:15:46,918 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-04 04:15:48,966 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-04 04:15:51,024 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-04 04:15:56,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-04 04:15:57,510 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-04 04:15:57,512 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 04:15:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-04 04:15:58,229 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 04:15:58,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-08-04 04:15:58,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-04 04:15:58,429 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. [2023-08-04 04:15:58,429 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 04:15:58,429 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 04:15:58,430 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 04:15:58,430 INFO L445 BasicCegarLoop]: Path program histogram: [7, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:15:58,430 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-04 04:15:58,430 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 04:15:58,430 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 04:15:58,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 04:15:58 BasicIcfg [2023-08-04 04:15:58,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 04:15:58,433 INFO L158 Benchmark]: Toolchain (without parser) took 826423.05ms. Allocated memory was 522.2MB in the beginning and 3.9GB in the end (delta: 3.4GB). Free memory was 472.9MB in the beginning and 3.0GB in the end (delta: -2.6GB). Peak memory consumption was 823.8MB. Max. memory is 16.0GB. [2023-08-04 04:15:58,434 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 367.0MB. Free memory is still 320.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 04:15:58,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.15ms. Allocated memory is still 522.2MB. Free memory was 472.9MB in the beginning and 443.7MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-04 04:15:58,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.87ms. Allocated memory is still 522.2MB. Free memory was 443.4MB in the beginning and 489.2MB in the end (delta: -45.8MB). Peak memory consumption was 9.8MB. Max. memory is 16.0GB. [2023-08-04 04:15:58,434 INFO L158 Benchmark]: Boogie Preprocessor took 29.15ms. Allocated memory is still 522.2MB. Free memory was 489.2MB in the beginning and 486.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:15:58,434 INFO L158 Benchmark]: RCFGBuilder took 402.30ms. Allocated memory is still 522.2MB. Free memory was 486.9MB in the beginning and 468.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-04 04:15:58,434 INFO L158 Benchmark]: TraceAbstraction took 825292.89ms. Allocated memory was 522.2MB in the beginning and 3.9GB in the end (delta: 3.4GB). Free memory was 467.3MB in the beginning and 3.0GB in the end (delta: -2.6GB). Peak memory consumption was 816.0MB. Max. memory is 16.0GB. [2023-08-04 04:15:58,435 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 367.0MB. Free memory is still 320.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 622.15ms. Allocated memory is still 522.2MB. Free memory was 472.9MB in the beginning and 443.7MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.87ms. Allocated memory is still 522.2MB. Free memory was 443.4MB in the beginning and 489.2MB in the end (delta: -45.8MB). Peak memory consumption was 9.8MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.15ms. Allocated memory is still 522.2MB. Free memory was 489.2MB in the beginning and 486.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 402.30ms. Allocated memory is still 522.2MB. Free memory was 486.9MB in the beginning and 468.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 825292.89ms. Allocated memory was 522.2MB in the beginning and 3.9GB in the end (delta: 3.4GB). Free memory was 467.3MB in the beginning and 3.0GB in the end (delta: -2.6GB). Peak memory consumption was 816.0MB. 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 170 PlacesBefore, 44 PlacesAfterwards, 194 TransitionsBefore, 64 TransitionsAfterwards, 8664 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 166 TotalNumberOfCompositions, 18412 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7930, independent: 7563, independent conditional: 0, independent unconditional: 7563, dependent: 367, dependent conditional: 0, dependent unconditional: 367, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4262, independent: 4204, independent conditional: 0, independent unconditional: 4204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7930, independent: 3359, independent conditional: 0, independent unconditional: 3359, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 4262, unknown conditional: 0, unknown unconditional: 4262] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 194, Positive conditional cache size: 0, Positive unconditional cache size: 194, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 170 PlacesBefore, 44 PlacesAfterwards, 194 TransitionsBefore, 65 TransitionsAfterwards, 8664 CoEnabledTransitionPairs, 8 FixpointIterations, 55 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 161 TotalNumberOfCompositions, 17867 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7425, independent: 7078, independent conditional: 0, independent unconditional: 7078, dependent: 347, dependent conditional: 0, dependent unconditional: 347, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4215, independent: 4152, independent conditional: 0, independent unconditional: 4152, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7425, independent: 2926, independent conditional: 0, independent unconditional: 2926, dependent: 284, dependent conditional: 0, dependent unconditional: 284, unknown: 4215, unknown conditional: 0, unknown unconditional: 4215] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 174, Positive conditional cache size: 0, Positive unconditional cache size: 174, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 222 PlacesBefore, 67 PlacesAfterwards, 258 TransitionsBefore, 98 TransitionsAfterwards, 25080 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 115 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 20 ConcurrentYvCompositions, 5 ChoiceCompositions, 202 TotalNumberOfCompositions, 52594 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20140, independent: 19636, independent conditional: 0, independent unconditional: 19636, dependent: 504, dependent conditional: 0, dependent unconditional: 504, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11819, independent: 11720, independent conditional: 0, independent unconditional: 11720, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 20140, independent: 7916, independent conditional: 0, independent unconditional: 7916, dependent: 405, dependent conditional: 0, dependent unconditional: 405, unknown: 11819, unknown conditional: 0, unknown unconditional: 11819] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 358, Positive conditional cache size: 0, Positive unconditional cache size: 358, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 219 locations, 4 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: 9.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 415 IncrementalHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1 mSDtfsCounter, 415 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=0, InterpolantAutomatonStates: 11, 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.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 98 SizeOfPredicates, 22 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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, 265 locations, 5 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: 810.3s, OverallIterations: 35, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 749.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 1323 mSolverCounterUnknown, 18392 SdHoareTripleChecker+Valid, 127.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16999 mSDsluCounter, 7998 SdHoareTripleChecker+Invalid, 121.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9972 IncrementalHoareTripleChecker+Unchecked, 7822 mSDsCounter, 3846 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69832 IncrementalHoareTripleChecker+Invalid, 84973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3846 mSolverCounterUnsat, 176 mSDtfsCounter, 69832 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 1323 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2418 GetRequests, 1232 SyntacticMatches, 119 SemanticMatches, 1066 ConstructedPredicates, 39 IntricatePredicates, 3 DeprecatedPredicates, 15591 ImplicationChecksByTransitivity, 568.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16963occurred in iteration=24, InterpolantAutomatonStates: 778, 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.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 44.4s InterpolantComputationTime, 1742 NumberOfCodeBlocks, 1742 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 2433 ConstructedInterpolants, 402 QuantifiedInterpolants, 56573 SizeOfPredicates, 564 NumberOfNonLiveVariables, 6661 ConjunctsInSsa, 1098 ConjunctsInUnsatCore, 90 InterpolantComputations, 9 PerfectInterpolantSequences, 90/473 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, 219 locations, 4 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: 5.2s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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