/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_75-tricky_address2_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 03:51:50,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 03:51:50,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 03:51:50,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 03:51:50,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 03:51:50,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 03:51:50,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 03:51:50,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 03:51:50,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 03:51:50,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 03:51:50,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 03:51:50,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 03:51:50,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 03:51:50,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 03:51:50,635 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 03:51:50,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 03:51:50,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 03:51:50,636 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 03:51:50,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 03:51:50,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 03:51:50,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 03:51:50,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 03:51:50,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 03:51:50,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 03:51:50,643 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 03:51:50,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 03:51:50,643 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 03:51:50,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 03:51:50,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 03:51:50,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 03:51:50,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:51:50,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 03:51:50,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 03:51:50,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 03:51:50,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 03:51:50,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 03:51:50,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 03:51:50,646 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 03:51:50,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 03:51:50,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 03:51:50,647 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 03:51:50,651 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 03:51:50,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 03:51:50,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 03:51:50,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 03:51:50,917 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 03:51:50,917 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 03:51:50,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_75-tricky_address2_racefree_bound2.i [2023-08-04 03:51:52,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 03:51:52,843 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 03:51:52,843 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_75-tricky_address2_racefree_bound2.i [2023-08-04 03:51:52,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7139e3eac/89fd7db8f17f4ff3a1c4b4a1c4249f3f/FLAGbc44ac5e2 [2023-08-04 03:51:53,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7139e3eac/89fd7db8f17f4ff3a1c4b4a1c4249f3f [2023-08-04 03:51:53,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 03:51:53,172 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 03:51:53,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 03:51:53,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 03:51:53,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 03:51:53,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@629ca5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53, skipping insertion in model container [2023-08-04 03:51:53,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 03:51:53,659 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_75-tricky_address2_racefree_bound2.i[41323,41336] [2023-08-04 03:51:53,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:51:53,717 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 03:51:53,743 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:51:53,745 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:51:53,751 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-04 03:51:53,765 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_75-tricky_address2_racefree_bound2.i[41323,41336] [2023-08-04 03:51:53,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:51:53,852 INFO L206 MainTranslator]: Completed translation [2023-08-04 03:51:53,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53 WrapperNode [2023-08-04 03:51:53,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 03:51:53,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 03:51:53,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 03:51:53,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 03:51:53,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,921 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 190 [2023-08-04 03:51:53,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 03:51:53,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 03:51:53,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 03:51:53,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 03:51:53,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 03:51:53,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 03:51:53,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 03:51:53,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 03:51:53,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (1/1) ... [2023-08-04 03:51:53,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:51:53,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:53,999 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 03:51:54,000 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 03:51:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 03:51:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 03:51:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 03:51:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 03:51:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 03:51:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 03:51:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-04 03:51:54,025 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-04 03:51:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 03:51:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 03:51:54,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 03:51:54,027 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 03:51:54,146 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 03:51:54,148 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 03:51:54,410 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 03:51:54,418 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 03:51:54,418 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-04 03:51:54,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:51:54 BoogieIcfgContainer [2023-08-04 03:51:54,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 03:51:54,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 03:51:54,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 03:51:54,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 03:51:54,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 03:51:53" (1/3) ... [2023-08-04 03:51:54,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fef14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:51:54, skipping insertion in model container [2023-08-04 03:51:54,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:51:53" (2/3) ... [2023-08-04 03:51:54,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fef14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:51:54, skipping insertion in model container [2023-08-04 03:51:54,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:51:54" (3/3) ... [2023-08-04 03:51:54,427 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_75-tricky_address2_racefree_bound2.i [2023-08-04 03:51:54,456 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 03:51:54,464 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 03:51:54,464 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 03:51:54,464 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 03:51:54,555 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-04 03:51:54,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-08-04 03:51:54,655 INFO L124 PetriNetUnfolderBase]: 45/260 cut-off events. [2023-08-04 03:51:54,655 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-04 03:51:54,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-04 03:51:54,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-08-04 03:51:54,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:54,671 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:51:54,679 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:54,681 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:54,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-08-04 03:51:54,719 INFO L124 PetriNetUnfolderBase]: 44/255 cut-off events. [2023-08-04 03:51:54,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:54,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-04 03:51:54,726 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-08-04 03:51:57,396 INFO L134 LiptonReduction]: Checked pairs total: 15158 [2023-08-04 03:51:57,397 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-04 03:51:57,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:51:57,415 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;@739bfaa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:51:57,416 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 03:51:57,420 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:51:57,421 INFO L124 PetriNetUnfolderBase]: 5/25 cut-off events. [2023-08-04 03:51:57,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:57,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:57,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 03:51:57,422 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 03:51:57,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash 826457834, now seen corresponding path program 1 times [2023-08-04 03:51:57,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:57,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952003241] [2023-08-04 03:51:57,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:57,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:57,662 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 03:51:57,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:57,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952003241] [2023-08-04 03:51:57,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952003241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:57,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:51:57,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:51:57,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231305756] [2023-08-04 03:51:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:57,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:51:57,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:57,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:51:57,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:51:57,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-04 03:51:57,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 65 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 03:51:57,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:57,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-04 03:51:57,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:57,906 INFO L124 PetriNetUnfolderBase]: 301/651 cut-off events. [2023-08-04 03:51:57,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:57,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 651 events. 301/651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3189 event pairs, 266 based on Foata normal form. 107/643 useless extension candidates. Maximal degree in co-relation 1189. Up to 588 conditions per place. [2023-08-04 03:51:57,911 INFO L140 encePairwiseOnDemand]: 318/341 looper letters, 36 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-04 03:51:57,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-04 03:51:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:51:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:51:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-08-04 03:51:57,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512218963831867 [2023-08-04 03:51:57,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-08-04 03:51:57,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-08-04 03:51:57,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:57,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-08-04 03:51:57,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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 03:51:57,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 03:51:57,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 03:51:57,942 INFO L175 Difference]: Start difference. First operand has 45 places, 65 transitions, 135 flow. Second operand 3 states and 524 transitions. [2023-08-04 03:51:57,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-04 03:51:57,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:51:57,947 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 107 flow [2023-08-04 03:51:57,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-08-04 03:51:57,951 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-04 03:51:57,951 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 107 flow [2023-08-04 03:51:57,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 03:51:57,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:57,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:57,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 03:51:57,953 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:51:57,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash -669135341, now seen corresponding path program 1 times [2023-08-04 03:51:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:57,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501168849] [2023-08-04 03:51:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:57,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:58,022 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 03:51:58,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:58,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501168849] [2023-08-04 03:51:58,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501168849] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:58,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489371715] [2023-08-04 03:51:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:58,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:58,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:58,041 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 03:51:58,065 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 03:51:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:58,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:51:58,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:51:58,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:51:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489371715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:58,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:51:58,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:51:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319157280] [2023-08-04 03:51:58,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:58,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:51:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:58,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:51:58,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:51:58,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-04 03:51:58,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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 03:51:58,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:58,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-04 03:51:58,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:58,335 INFO L124 PetriNetUnfolderBase]: 283/635 cut-off events. [2023-08-04 03:51:58,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:51:58,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 635 events. 283/635 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3546 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1221. Up to 555 conditions per place. [2023-08-04 03:51:58,340 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 51 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-04 03:51:58,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 243 flow [2023-08-04 03:51:58,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:51:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:51:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-08-04 03:51:58,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063538611925709 [2023-08-04 03:51:58,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-08-04 03:51:58,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-08-04 03:51:58,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:58,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-08-04 03:51:58,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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 03:51:58,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 03:51:58,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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 03:51:58,352 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 107 flow. Second operand 3 states and 518 transitions. [2023-08-04 03:51:58,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 243 flow [2023-08-04 03:51:58,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 239 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:58,354 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 111 flow [2023-08-04 03:51:58,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-04 03:51:58,355 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-08-04 03:51:58,355 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 111 flow [2023-08-04 03:51:58,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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 03:51:58,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:58,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:58,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 03:51:58,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:58,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:51:58,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:58,563 INFO L85 PathProgramCache]: Analyzing trace with hash 735439460, now seen corresponding path program 1 times [2023-08-04 03:51:58,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:58,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663823665] [2023-08-04 03:51:58,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:58,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:51:58,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:58,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663823665] [2023-08-04 03:51:58,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663823665] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365437023] [2023-08-04 03:51:58,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:58,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:58,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:58,655 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 03:51:58,656 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 03:51:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:58,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:51:58,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:58,753 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 03:51:58,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:51:58,769 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 03:51:58,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365437023] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:51:58,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:51:58,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:51:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512287226] [2023-08-04 03:51:58,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:51:58,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:51:58,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:58,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:51:58,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:51:58,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 341 [2023-08-04 03:51:58,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 03:51:58,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:58,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 341 [2023-08-04 03:51:58,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:58,939 INFO L124 PetriNetUnfolderBase]: 301/637 cut-off events. [2023-08-04 03:51:58,939 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-04 03:51:58,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 637 events. 301/637 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3076 event pairs, 266 based on Foata normal form. 3/547 useless extension candidates. Maximal degree in co-relation 1245. Up to 571 conditions per place. [2023-08-04 03:51:58,943 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 36 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-08-04 03:51:58,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 205 flow [2023-08-04 03:51:58,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:51:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:51:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2023-08-04 03:51:58,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2023-08-04 03:51:58,946 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 968 transitions. [2023-08-04 03:51:58,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 968 transitions. [2023-08-04 03:51:58,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:58,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 968 transitions. [2023-08-04 03:51:58,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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 03:51:58,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states 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 03:51:58,953 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states 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 03:51:58,953 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 111 flow. Second operand 6 states and 968 transitions. [2023-08-04 03:51:58,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 205 flow [2023-08-04 03:51:58,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:51:58,956 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 143 flow [2023-08-04 03:51:58,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-08-04 03:51:58,957 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2023-08-04 03:51:58,957 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 143 flow [2023-08-04 03:51:58,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 03:51:58,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:58,958 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:58,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 03:51:59,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 03:51:59,164 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:51:59,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:51:59,165 INFO L85 PathProgramCache]: Analyzing trace with hash 967406523, now seen corresponding path program 2 times [2023-08-04 03:51:59,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:51:59,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334461582] [2023-08-04 03:51:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:51:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:51:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:51:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:51:59,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:51:59,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334461582] [2023-08-04 03:51:59,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334461582] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:51:59,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890494253] [2023-08-04 03:51:59,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:51:59,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:51:59,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:51:59,257 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 03:51:59,260 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 03:51:59,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 03:51:59,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:51:59,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-04 03:51:59,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:51:59,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:51:59,416 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:51:59,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:51:59,437 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:51:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:51:59,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:51:59,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890494253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:51:59,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:51:59,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 03:51:59,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116300143] [2023-08-04 03:51:59,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:51:59,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 03:51:59,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:51:59,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 03:51:59,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:51:59,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 341 [2023-08-04 03:51:59,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 149.33333333333334) internal successors, (896), 6 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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 03:51:59,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:51:59,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 341 [2023-08-04 03:51:59,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:51:59,846 INFO L124 PetriNetUnfolderBase]: 298/678 cut-off events. [2023-08-04 03:51:59,846 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-04 03:51:59,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 678 events. 298/678 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3515 event pairs, 49 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 1314. Up to 416 conditions per place. [2023-08-04 03:51:59,849 INFO L140 encePairwiseOnDemand]: 333/341 looper letters, 44 selfloop transitions, 6 changer transitions 34/91 dead transitions. [2023-08-04 03:51:59,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 399 flow [2023-08-04 03:51:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:51:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:51:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 971 transitions. [2023-08-04 03:51:59,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47458455522971654 [2023-08-04 03:51:59,852 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 971 transitions. [2023-08-04 03:51:59,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 971 transitions. [2023-08-04 03:51:59,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:51:59,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 971 transitions. [2023-08-04 03:51:59,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states 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 03:51:59,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states 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 03:51:59,859 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states 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 03:51:59,859 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 143 flow. Second operand 6 states and 971 transitions. [2023-08-04 03:51:59,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 399 flow [2023-08-04 03:51:59,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 385 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:51:59,862 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 157 flow [2023-08-04 03:51:59,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-08-04 03:51:59,863 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2023-08-04 03:51:59,863 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 157 flow [2023-08-04 03:51:59,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.33333333333334) internal successors, (896), 6 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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 03:51:59,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:51:59,864 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:51:59,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-04 03:52:00,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:00,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:52:00,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1432371976, now seen corresponding path program 1 times [2023-08-04 03:52:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:00,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957917399] [2023-08-04 03:52:00,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:00,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:52:00,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:00,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957917399] [2023-08-04 03:52:00,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957917399] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:00,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921433762] [2023-08-04 03:52:00,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:00,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:00,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:00,163 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 03:52:00,166 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 03:52:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:00,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:52:00,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:52:00,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:52:00,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921433762] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:00,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:00,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-04 03:52:00,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359865044] [2023-08-04 03:52:00,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:00,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 03:52:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:00,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 03:52:00,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-04 03:52:00,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 341 [2023-08-04 03:52:00,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 157 flow. Second operand has 14 states, 14 states have (on average 152.07142857142858) internal successors, (2129), 14 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states 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 03:52:00,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:00,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 341 [2023-08-04 03:52:00,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:00,451 INFO L124 PetriNetUnfolderBase]: 23/80 cut-off events. [2023-08-04 03:52:00,451 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-08-04 03:52:00,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 80 events. 23/80 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 8 based on Foata normal form. 18/95 useless extension candidates. Maximal degree in co-relation 204. Up to 46 conditions per place. [2023-08-04 03:52:00,452 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-08-04 03:52:00,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 236 flow [2023-08-04 03:52:00,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 03:52:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 03:52:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2146 transitions. [2023-08-04 03:52:00,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4495182237117721 [2023-08-04 03:52:00,458 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2146 transitions. [2023-08-04 03:52:00,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2146 transitions. [2023-08-04 03:52:00,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:00,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2146 transitions. [2023-08-04 03:52:00,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 153.28571428571428) internal successors, (2146), 14 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states 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 03:52:00,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states 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 03:52:00,475 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states 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 03:52:00,475 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 157 flow. Second operand 14 states and 2146 transitions. [2023-08-04 03:52:00,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 236 flow [2023-08-04 03:52:00,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-04 03:52:00,505 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2023-08-04 03:52:00,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=46, PETRI_TRANSITIONS=0} [2023-08-04 03:52:00,506 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-08-04 03:52:00,506 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2023-08-04 03:52:00,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 152.07142857142858) internal successors, (2129), 14 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states 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 03:52:00,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 03:52:00,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 03:52:00,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 03:52:00,516 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 03:52:00,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:00,711 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-08-04 03:52:00,713 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 03:52:00,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-08-04 03:52:00,739 INFO L124 PetriNetUnfolderBase]: 45/260 cut-off events. [2023-08-04 03:52:00,739 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-04 03:52:00,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-04 03:52:00,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-08-04 03:52:00,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-08-04 03:52:00,742 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:52:00,742 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-04 03:52:00,742 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-04 03:52:00,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-08-04 03:52:00,762 INFO L124 PetriNetUnfolderBase]: 44/255 cut-off events. [2023-08-04 03:52:00,762 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:00,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-04 03:52:00,768 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-08-04 03:52:03,131 INFO L134 LiptonReduction]: Checked pairs total: 16649 [2023-08-04 03:52:03,131 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-08-04 03:52:03,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:52:03,134 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;@739bfaa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:52:03,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:52:03,137 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:52:03,137 INFO L124 PetriNetUnfolderBase]: 11/41 cut-off events. [2023-08-04 03:52:03,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:03,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:03,138 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-04 03:52:03,138 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:52:03,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1785070566, now seen corresponding path program 1 times [2023-08-04 03:52:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054517190] [2023-08-04 03:52:03,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:03,158 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 03:52:03,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:03,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054517190] [2023-08-04 03:52:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054517190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:03,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:52:03,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:52:03,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846064280] [2023-08-04 03:52:03,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:03,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:52:03,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:03,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:52:03,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:52:03,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 340 [2023-08-04 03:52:03,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states 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 03:52:03,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:03,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 340 [2023-08-04 03:52:03,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:03,265 INFO L124 PetriNetUnfolderBase]: 300/656 cut-off events. [2023-08-04 03:52:03,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:03,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 656 events. 300/656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3223 event pairs, 266 based on Foata normal form. 108/654 useless extension candidates. Maximal degree in co-relation 1194. Up to 588 conditions per place. [2023-08-04 03:52:03,267 INFO L140 encePairwiseOnDemand]: 316/340 looper letters, 20 selfloop transitions, 2 changer transitions 19/46 dead transitions. [2023-08-04 03:52:03,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-04 03:52:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:52:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:52:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-04 03:52:03,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2023-08-04 03:52:03,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-04 03:52:03,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-04 03:52:03,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:03,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-04 03:52:03,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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 03:52:03,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states 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 03:52:03,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states 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 03:52:03,273 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 525 transitions. [2023-08-04 03:52:03,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-04 03:52:03,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:52:03,274 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 69 flow [2023-08-04 03:52:03,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-04 03:52:03,276 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-04 03:52:03,276 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 69 flow [2023-08-04 03:52:03,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states 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 03:52:03,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:03,277 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:03,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 03:52:03,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:52:03,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash -523375806, now seen corresponding path program 1 times [2023-08-04 03:52:03,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:03,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836801210] [2023-08-04 03:52:03,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:03,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:03,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:03,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836801210] [2023-08-04 03:52:03,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836801210] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:03,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878660312] [2023-08-04 03:52:03,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:03,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:03,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:03,321 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 03:52:03,348 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 03:52:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:03,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:52:03,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:03,402 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878660312] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:03,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:03,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:52:03,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175405610] [2023-08-04 03:52:03,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:03,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:52:03,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:03,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:52:03,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:52:03,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 340 [2023-08-04 03:52:03,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 69 flow. Second operand has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states 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 03:52:03,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:03,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 340 [2023-08-04 03:52:03,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:03,472 INFO L124 PetriNetUnfolderBase]: 47/128 cut-off events. [2023-08-04 03:52:03,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:03,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 128 events. 47/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 358 event pairs, 42 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 243. Up to 108 conditions per place. [2023-08-04 03:52:03,473 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-04 03:52:03,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-04 03:52:03,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:52:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:52:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 952 transitions. [2023-08-04 03:52:03,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-04 03:52:03,476 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 952 transitions. [2023-08-04 03:52:03,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 952 transitions. [2023-08-04 03:52:03,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:03,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 952 transitions. [2023-08-04 03:52:03,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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 03:52:03,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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 03:52:03,482 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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 03:52:03,482 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 69 flow. Second operand 6 states and 952 transitions. [2023-08-04 03:52:03,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-04 03:52:03,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:03,484 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-04 03:52:03,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-04 03:52:03,484 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-04 03:52:03,484 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-04 03:52:03,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states 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 03:52:03,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:03,485 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-04 03:52:03,494 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 03:52:03,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:03,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:52:03,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1162836454, now seen corresponding path program 2 times [2023-08-04 03:52:03,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:03,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034278778] [2023-08-04 03:52:03,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:03,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:03,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:03,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034278778] [2023-08-04 03:52:03,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034278778] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:03,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989463768] [2023-08-04 03:52:03,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:52:03,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:03,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:03,761 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 03:52:03,761 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 03:52:03,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:52:03,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:52:03,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:52:03,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:03,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 03:52:03,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989463768] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:03,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:03,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-04 03:52:03,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061915511] [2023-08-04 03:52:03,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:03,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 03:52:03,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:03,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 03:52:03,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-04 03:52:03,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 340 [2023-08-04 03:52:03,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states 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 03:52:03,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:03,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 340 [2023-08-04 03:52:03,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:03,995 INFO L124 PetriNetUnfolderBase]: 47/134 cut-off events. [2023-08-04 03:52:03,995 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 03:52:03,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 134 events. 47/134 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 358 event pairs, 42 based on Foata normal form. 6/116 useless extension candidates. Maximal degree in co-relation 234. Up to 108 conditions per place. [2023-08-04 03:52:03,996 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-04 03:52:03,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-04 03:52:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 03:52:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 03:52:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1885 transitions. [2023-08-04 03:52:04,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46200980392156865 [2023-08-04 03:52:04,001 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1885 transitions. [2023-08-04 03:52:04,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1885 transitions. [2023-08-04 03:52:04,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:04,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1885 transitions. [2023-08-04 03:52:04,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 157.08333333333334) internal successors, (1885), 12 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states 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 03:52:04,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 340.0) internal successors, (4420), 13 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states 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 03:52:04,012 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 340.0) internal successors, (4420), 13 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states 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 03:52:04,012 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1885 transitions. [2023-08-04 03:52:04,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-04 03:52:04,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:04,013 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-04 03:52:04,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-04 03:52:04,014 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-04 03:52:04,014 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-04 03:52:04,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states 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 03:52:04,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:04,015 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-04 03:52:04,023 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 03:52:04,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:04,221 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:52:04,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:04,221 INFO L85 PathProgramCache]: Analyzing trace with hash -834996966, now seen corresponding path program 3 times [2023-08-04 03:52:04,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:04,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838272648] [2023-08-04 03:52:04,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:52:04,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:52:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:52:04,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:52:04,273 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:52:04,274 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 03:52:04,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 03:52:04,274 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-04 03:52:04,274 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 03:52:04,275 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 03:52:04,275 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 03:52:04,298 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-04 03:52:04,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-04 03:52:04,341 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-04 03:52:04,341 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-04 03:52:04,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-04 03:52:04,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-08-04 03:52:04,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-08-04 03:52:04,348 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:52:04,348 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-04 03:52:04,348 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-04 03:52:04,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-04 03:52:04,403 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-04 03:52:04,403 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-04 03:52:04,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-04 03:52:04,422 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-08-04 03:52:07,193 INFO L134 LiptonReduction]: Checked pairs total: 49651 [2023-08-04 03:52:07,193 INFO L136 LiptonReduction]: Total number of compositions: 216 [2023-08-04 03:52:07,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:52:07,195 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;@739bfaa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:52:07,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 03:52:07,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:52:07,197 INFO L124 PetriNetUnfolderBase]: 8/28 cut-off events. [2023-08-04 03:52:07,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:52:07,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:07,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 03:52:07,197 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 03:52:07,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:07,198 INFO L85 PathProgramCache]: Analyzing trace with hash -200231614, now seen corresponding path program 1 times [2023-08-04 03:52:07,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:07,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898092058] [2023-08-04 03:52:07,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:07,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:07,220 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 03:52:07,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:07,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898092058] [2023-08-04 03:52:07,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898092058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:07,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:52:07,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:52:07,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390194831] [2023-08-04 03:52:07,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:07,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:52:07,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:07,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:52:07,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:52:07,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 476 [2023-08-04 03:52:07,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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 03:52:07,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:07,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 476 [2023-08-04 03:52:07,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:08,494 INFO L124 PetriNetUnfolderBase]: 9872/15757 cut-off events. [2023-08-04 03:52:08,494 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-04 03:52:08,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30205 conditions, 15757 events. 9872/15757 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 104375 event pairs, 9112 based on Foata normal form. 2730/16056 useless extension candidates. Maximal degree in co-relation 12164. Up to 14349 conditions per place. [2023-08-04 03:52:08,571 INFO L140 encePairwiseOnDemand]: 441/476 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-04 03:52:08,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-08-04 03:52:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:52:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:52:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2023-08-04 03:52:08,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2023-08-04 03:52:08,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2023-08-04 03:52:08,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2023-08-04 03:52:08,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:08,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2023-08-04 03:52:08,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states 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 03:52:08,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states 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 03:52:08,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states 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 03:52:08,579 INFO L175 Difference]: Start difference. First operand has 68 places, 101 transitions, 220 flow. Second operand 3 states and 720 transitions. [2023-08-04 03:52:08,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-08-04 03:52:08,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:52:08,583 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-04 03:52:08,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-08-04 03:52:08,584 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-04 03:52:08,584 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-04 03:52:08,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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 03:52:08,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:08,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:08,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 03:52:08,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:52:08,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:08,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1798379354, now seen corresponding path program 1 times [2023-08-04 03:52:08,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:08,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194314189] [2023-08-04 03:52:08,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:08,621 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 03:52:08,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:08,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194314189] [2023-08-04 03:52:08,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194314189] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:08,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408195566] [2023-08-04 03:52:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:08,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:08,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:08,623 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 03:52:08,647 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 03:52:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:08,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:52:08,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:52:08,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:52:08,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408195566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:08,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:52:08,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:52:08,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403248496] [2023-08-04 03:52:08,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:08,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:52:08,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:08,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:52:08,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:52:08,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 476 [2023-08-04 03:52:08,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:08,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:08,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 476 [2023-08-04 03:52:08,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:09,732 INFO L124 PetriNetUnfolderBase]: 9675/15570 cut-off events. [2023-08-04 03:52:09,732 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-04 03:52:09,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30030 conditions, 15570 events. 9675/15570 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 105458 event pairs, 4312 based on Foata normal form. 0/13126 useless extension candidates. Maximal degree in co-relation 30017. Up to 14317 conditions per place. [2023-08-04 03:52:09,880 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 72 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-04 03:52:09,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 350 flow [2023-08-04 03:52:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:52:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:52:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2023-08-04 03:52:09,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49299719887955185 [2023-08-04 03:52:09,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2023-08-04 03:52:09,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2023-08-04 03:52:09,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:09,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2023-08-04 03:52:09,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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 03:52:09,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states 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 03:52:09,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states 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 03:52:09,888 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 704 transitions. [2023-08-04 03:52:09,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 350 flow [2023-08-04 03:52:09,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:09,893 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-04 03:52:09,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2023-08-04 03:52:09,895 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-04 03:52:09,895 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-04 03:52:09,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:52:09,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:09,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:09,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:10,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:10,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:52:10,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:10,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1146753669, now seen corresponding path program 1 times [2023-08-04 03:52:10,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:10,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256742434] [2023-08-04 03:52:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:10,141 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 03:52:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256742434] [2023-08-04 03:52:10,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256742434] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854909504] [2023-08-04 03:52:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:10,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:10,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:10,143 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 03:52:10,169 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 03:52:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:10,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:52:10,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:10,242 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 03:52:10,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:10,255 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 03:52:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854909504] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:10,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:10,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 03:52:10,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887536535] [2023-08-04 03:52:10,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:10,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 03:52:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:10,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 03:52:10,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 03:52:10,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 476 [2023-08-04 03:52:10,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states 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 03:52:10,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:10,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 476 [2023-08-04 03:52:10,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:11,226 INFO L124 PetriNetUnfolderBase]: 9912/15619 cut-off events. [2023-08-04 03:52:11,226 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2023-08-04 03:52:11,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30593 conditions, 15619 events. 9912/15619 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 101714 event pairs, 9112 based on Foata normal form. 3/13422 useless extension candidates. Maximal degree in co-relation 30565. Up to 14334 conditions per place. [2023-08-04 03:52:11,276 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 56 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-04 03:52:11,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 310 flow [2023-08-04 03:52:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:52:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:52:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1317 transitions. [2023-08-04 03:52:11,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46113445378151263 [2023-08-04 03:52:11,280 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1317 transitions. [2023-08-04 03:52:11,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1317 transitions. [2023-08-04 03:52:11,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:11,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1317 transitions. [2023-08-04 03:52:11,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.5) internal successors, (1317), 6 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states 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 03:52:11,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states 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 03:52:11,287 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states 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 03:52:11,287 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1317 transitions. [2023-08-04 03:52:11,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 310 flow [2023-08-04 03:52:11,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:11,290 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-04 03:52:11,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-08-04 03:52:11,290 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-04 03:52:11,290 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-04 03:52:11,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states 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 03:52:11,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:11,291 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:11,299 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 03:52:11,499 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,SelfDestructingSolverStorable11 [2023-08-04 03:52:11,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:52:11,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash -737928083, now seen corresponding path program 2 times [2023-08-04 03:52:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239550060] [2023-08-04 03:52:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:52:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239550060] [2023-08-04 03:52:11,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239550060] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487075635] [2023-08-04 03:52:11,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:52:11,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:11,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:11,569 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 03:52:11,572 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 03:52:11,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 03:52:11,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:52:11,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-04 03:52:11,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:11,659 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:52:11,706 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:52:11,706 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:52:11,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:52:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:52:11,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:52:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487075635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:11,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:52:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-04 03:52:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955991048] [2023-08-04 03:52:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:11,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 03:52:11,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:11,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 03:52:11,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-04 03:52:11,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 476 [2023-08-04 03:52:11,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states 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 03:52:11,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:11,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 476 [2023-08-04 03:52:11,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:13,028 INFO L124 PetriNetUnfolderBase]: 9983/16224 cut-off events. [2023-08-04 03:52:13,028 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2023-08-04 03:52:13,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31924 conditions, 16224 events. 9983/16224 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 113021 event pairs, 2197 based on Foata normal form. 0/14287 useless extension candidates. Maximal degree in co-relation 31888. Up to 11885 conditions per place. [2023-08-04 03:52:13,080 INFO L140 encePairwiseOnDemand]: 466/476 looper letters, 122 selfloop transitions, 14 changer transitions 14/163 dead transitions. [2023-08-04 03:52:13,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 163 transitions, 719 flow [2023-08-04 03:52:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 03:52:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 03:52:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1357 transitions. [2023-08-04 03:52:13,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47514005602240894 [2023-08-04 03:52:13,084 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1357 transitions. [2023-08-04 03:52:13,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1357 transitions. [2023-08-04 03:52:13,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:13,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1357 transitions. [2023-08-04 03:52:13,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 226.16666666666666) internal successors, (1357), 6 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states 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 03:52:13,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states 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 03:52:13,092 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states 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 03:52:13,092 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1357 transitions. [2023-08-04 03:52:13,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 163 transitions, 719 flow [2023-08-04 03:52:13,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 163 transitions, 705 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:13,096 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 293 flow [2023-08-04 03:52:13,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-08-04 03:52:13,097 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 20 predicate places. [2023-08-04 03:52:13,097 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 293 flow [2023-08-04 03:52:13,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states 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 03:52:13,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:13,098 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:13,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:13,302 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,SelfDestructingSolverStorable12 [2023-08-04 03:52:13,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:52:13,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash -261072776, now seen corresponding path program 1 times [2023-08-04 03:52:13,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:13,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889180473] [2023-08-04 03:52:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:13,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:52:13,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:13,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889180473] [2023-08-04 03:52:13,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889180473] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:13,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920258019] [2023-08-04 03:52:13,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:13,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:13,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:13,369 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 03:52:13,379 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 03:52:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:13,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:52:13,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:52:13,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:52:13,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920258019] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:13,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:13,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-04 03:52:13,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860141405] [2023-08-04 03:52:13,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:13,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 03:52:13,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:13,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 03:52:13,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-04 03:52:13,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 476 [2023-08-04 03:52:13,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 293 flow. Second operand has 14 states, 14 states have (on average 207.35714285714286) internal successors, (2903), 14 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states 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 03:52:13,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:13,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 476 [2023-08-04 03:52:13,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:14,888 INFO L124 PetriNetUnfolderBase]: 9760/15747 cut-off events. [2023-08-04 03:52:14,889 INFO L125 PetriNetUnfolderBase]: For 4683/4683 co-relation queries the response was YES. [2023-08-04 03:52:14,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35028 conditions, 15747 events. 9760/15747 cut-off events. For 4683/4683 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 109567 event pairs, 391 based on Foata normal form. 22/14854 useless extension candidates. Maximal degree in co-relation 34969. Up to 13559 conditions per place. [2023-08-04 03:52:14,946 INFO L140 encePairwiseOnDemand]: 470/476 looper letters, 113 selfloop transitions, 15 changer transitions 0/141 dead transitions. [2023-08-04 03:52:14,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 141 transitions, 721 flow [2023-08-04 03:52:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 03:52:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 03:52:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2989 transitions. [2023-08-04 03:52:14,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4485294117647059 [2023-08-04 03:52:14,953 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2989 transitions. [2023-08-04 03:52:14,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2989 transitions. [2023-08-04 03:52:14,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:14,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2989 transitions. [2023-08-04 03:52:14,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 213.5) internal successors, (2989), 14 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states 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 03:52:14,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 0 states 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 03:52:14,967 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 0 states 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 03:52:14,967 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 293 flow. Second operand 14 states and 2989 transitions. [2023-08-04 03:52:14,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 141 transitions, 721 flow [2023-08-04 03:52:14,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 141 transitions, 721 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:52:14,979 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 375 flow [2023-08-04 03:52:14,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=375, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2023-08-04 03:52:14,979 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 35 predicate places. [2023-08-04 03:52:14,980 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 375 flow [2023-08-04 03:52:14,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 207.35714285714286) internal successors, (2903), 14 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states 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 03:52:14,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:14,981 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:14,988 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 03:52:15,186 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,SelfDestructingSolverStorable13 [2023-08-04 03:52:15,186 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 03:52:15,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:15,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1144227296, now seen corresponding path program 1 times [2023-08-04 03:52:15,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:15,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776801527] [2023-08-04 03:52:15,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:15,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:52:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776801527] [2023-08-04 03:52:15,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776801527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:52:15,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:52:15,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 03:52:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160066911] [2023-08-04 03:52:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:52:15,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:52:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:15,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:52:15,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:52:15,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 476 [2023-08-04 03:52:15,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 375 flow. Second operand has 5 states, 5 states have (on average 193.4) internal successors, (967), 5 states have internal predecessors, (967), 0 states have call successors, (0), 0 states 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 03:52:15,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:15,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 476 [2023-08-04 03:52:15,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:16,359 INFO L124 PetriNetUnfolderBase]: 5583/10256 cut-off events. [2023-08-04 03:52:16,359 INFO L125 PetriNetUnfolderBase]: For 5262/5262 co-relation queries the response was YES. [2023-08-04 03:52:16,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24366 conditions, 10256 events. 5583/10256 cut-off events. For 5262/5262 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 76138 event pairs, 2154 based on Foata normal form. 1470/10825 useless extension candidates. Maximal degree in co-relation 24292. Up to 5369 conditions per place. [2023-08-04 03:52:16,395 INFO L140 encePairwiseOnDemand]: 455/476 looper letters, 118 selfloop transitions, 21 changer transitions 2/151 dead transitions. [2023-08-04 03:52:16,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 151 transitions, 865 flow [2023-08-04 03:52:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:52:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:52:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 874 transitions. [2023-08-04 03:52:16,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45903361344537813 [2023-08-04 03:52:16,400 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 874 transitions. [2023-08-04 03:52:16,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 874 transitions. [2023-08-04 03:52:16,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:16,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 874 transitions. [2023-08-04 03:52:16,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 218.5) internal successors, (874), 4 states have internal predecessors, (874), 0 states have call successors, (0), 0 states 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 03:52:16,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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 03:52:16,408 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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 03:52:16,409 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 375 flow. Second operand 4 states and 874 transitions. [2023-08-04 03:52:16,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 151 transitions, 865 flow [2023-08-04 03:52:16,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 151 transitions, 792 flow, removed 26 selfloop flow, removed 10 redundant places. [2023-08-04 03:52:16,422 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 411 flow [2023-08-04 03:52:16,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=97, PETRI_TRANSITIONS=104} [2023-08-04 03:52:16,424 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 29 predicate places. [2023-08-04 03:52:16,424 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 411 flow [2023-08-04 03:52:16,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.4) internal successors, (967), 5 states have internal predecessors, (967), 0 states have call successors, (0), 0 states 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 03:52:16,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:16,424 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:16,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 03:52:16,424 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 03:52:16,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash 239282032, now seen corresponding path program 1 times [2023-08-04 03:52:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:16,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003722714] [2023-08-04 03:52:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:52:17,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:17,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003722714] [2023-08-04 03:52:17,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003722714] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:17,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906720599] [2023-08-04 03:52:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:17,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:17,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:17,221 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 03:52:17,224 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 03:52:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:17,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-04 03:52:17,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:17,345 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:52:17,434 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:52:17,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:52:17,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:52:17,485 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:52: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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-04 03:52:17,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:52:17,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 03:52:17,567 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 22 treesize of output 17 [2023-08-04 03:52:17,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:52:17,612 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 03:52:17,665 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:52:17,666 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 25 treesize of output 11 [2023-08-04 03:52:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:52:17,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:17,824 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 Int) (|v_t_funThread2of2ForFork0_~i~0#1_55| Int) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_55| 28))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_55|) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_463) (+ |c_~#a~0.offset| .cse0)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_55| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_464) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2023-08-04 03:52:17,884 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:52:17,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-04 03:52:17,894 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:52:17,894 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 48 treesize of output 38 [2023-08-04 03:52:17,900 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 25 treesize of output 18 [2023-08-04 03:52:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:52:31,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906720599] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:31,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:31,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-08-04 03:52:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475874699] [2023-08-04 03:52:31,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:31,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 03:52:31,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:31,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 03:52:31,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=294, Unknown=7, NotChecked=38, Total=462 [2023-08-04 03:52:32,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 476 [2023-08-04 03:52:32,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 411 flow. Second operand has 22 states, 22 states have (on average 147.3181818181818) internal successors, (3241), 22 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states 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 03:52:32,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:32,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 476 [2023-08-04 03:52:32,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:52:37,289 INFO L124 PetriNetUnfolderBase]: 8366/15308 cut-off events. [2023-08-04 03:52:37,289 INFO L125 PetriNetUnfolderBase]: For 9536/9585 co-relation queries the response was YES. [2023-08-04 03:52:37,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42561 conditions, 15308 events. 8366/15308 cut-off events. For 9536/9585 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 120942 event pairs, 948 based on Foata normal form. 13/14030 useless extension candidates. Maximal degree in co-relation 41396. Up to 7378 conditions per place. [2023-08-04 03:52:37,343 INFO L140 encePairwiseOnDemand]: 458/476 looper letters, 323 selfloop transitions, 100 changer transitions 142/574 dead transitions. [2023-08-04 03:52:37,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 574 transitions, 3342 flow [2023-08-04 03:52:37,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-04 03:52:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-04 03:52:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3678 transitions. [2023-08-04 03:52:37,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35122230710466007 [2023-08-04 03:52:37,354 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3678 transitions. [2023-08-04 03:52:37,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3678 transitions. [2023-08-04 03:52:37,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:52:37,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3678 transitions. [2023-08-04 03:52:37,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 167.1818181818182) internal successors, (3678), 22 states have internal predecessors, (3678), 0 states have call successors, (0), 0 states 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 03:52:37,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 476.0) internal successors, (10948), 23 states have internal predecessors, (10948), 0 states have call successors, (0), 0 states 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 03:52:37,376 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 476.0) internal successors, (10948), 23 states have internal predecessors, (10948), 0 states have call successors, (0), 0 states 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 03:52:37,376 INFO L175 Difference]: Start difference. First operand has 97 places, 104 transitions, 411 flow. Second operand 22 states and 3678 transitions. [2023-08-04 03:52:37,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 574 transitions, 3342 flow [2023-08-04 03:52:37,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 574 transitions, 3341 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:52:37,406 INFO L231 Difference]: Finished difference. Result has 131 places, 193 transitions, 1212 flow [2023-08-04 03:52:37,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1212, PETRI_PLACES=131, PETRI_TRANSITIONS=193} [2023-08-04 03:52:37,407 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 63 predicate places. [2023-08-04 03:52:37,407 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 193 transitions, 1212 flow [2023-08-04 03:52:37,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 147.3181818181818) internal successors, (3241), 22 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states 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 03:52:37,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:52:37,408 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:52:37,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 03:52:37,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-04 03:52:37,614 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 03:52:37,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:52:37,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1186553578, now seen corresponding path program 2 times [2023-08-04 03:52:37,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:52:37,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985461181] [2023-08-04 03:52:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:52:37,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:52:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:52:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:52:38,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:52:38,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985461181] [2023-08-04 03:52:38,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985461181] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:52:38,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812009622] [2023-08-04 03:52:38,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:52:38,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:52:38,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:52:38,241 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 03:52:38,246 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 03:52:38,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:52:38,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:52:38,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-04 03:52:38,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:52:38,395 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:52:38,494 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:52:38,494 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:52:38,519 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:52:38,550 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:52:38,595 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 16 treesize of output 12 [2023-08-04 03:52:38,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:52:38,657 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 03:52:38,709 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:52:38,710 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 25 treesize of output 11 [2023-08-04 03:52:38,751 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 22 treesize of output 17 [2023-08-04 03:52:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:52:38,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:52:38,894 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_548 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_57| Int)) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_57| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_548) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0)))) (forall ((v_ArrVal_548 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_548) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset| 4)) 0)))) is different from false [2023-08-04 03:52:38,931 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:52:38,932 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 71 treesize of output 59 [2023-08-04 03:52:38,940 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:52:38,940 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 94 treesize of output 75 [2023-08-04 03:52:38,946 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 54 treesize of output 47 [2023-08-04 03:52:38,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-04 03:52:49,015 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_545 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_57| Int) (|~#a~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_545) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_57| 28))) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-04 03:52:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:52:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812009622] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:52:51,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:52:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-04 03:52:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801691726] [2023-08-04 03:52:51,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:52:51,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 03:52:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:52:51,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 03:52:51,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=261, Unknown=2, NotChecked=70, Total=420 [2023-08-04 03:52:53,135 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 03:52:55,223 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 03:52:57,234 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 03:52:59,289 WARN L539 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 03:52:59,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-04 03:52:59,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 193 transitions, 1212 flow. Second operand has 21 states, 21 states have (on average 149.33333333333334) internal successors, (3136), 21 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states 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 03:52:59,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:52:59,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-04 03:52:59,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:53:02,896 INFO L124 PetriNetUnfolderBase]: 11511/21416 cut-off events. [2023-08-04 03:53:02,896 INFO L125 PetriNetUnfolderBase]: For 55067/55113 co-relation queries the response was YES. [2023-08-04 03:53:02,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75596 conditions, 21416 events. 11511/21416 cut-off events. For 55067/55113 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 183042 event pairs, 2444 based on Foata normal form. 56/19543 useless extension candidates. Maximal degree in co-relation 74018. Up to 8478 conditions per place. [2023-08-04 03:53:02,999 INFO L140 encePairwiseOnDemand]: 457/476 looper letters, 341 selfloop transitions, 115 changer transitions 132/597 dead transitions. [2023-08-04 03:53:02,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 597 transitions, 4512 flow [2023-08-04 03:53:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-04 03:53:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-04 03:53:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2772 transitions. [2023-08-04 03:53:03,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3639705882352941 [2023-08-04 03:53:03,004 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2772 transitions. [2023-08-04 03:53:03,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2772 transitions. [2023-08-04 03:53:03,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:53:03,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2772 transitions. [2023-08-04 03:53:03,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 173.25) internal successors, (2772), 16 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 03:53:03,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 476.0) internal successors, (8092), 17 states have internal predecessors, (8092), 0 states have call successors, (0), 0 states 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 03:53:03,017 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 476.0) internal successors, (8092), 17 states have internal predecessors, (8092), 0 states have call successors, (0), 0 states 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 03:53:03,017 INFO L175 Difference]: Start difference. First operand has 131 places, 193 transitions, 1212 flow. Second operand 16 states and 2772 transitions. [2023-08-04 03:53:03,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 597 transitions, 4512 flow [2023-08-04 03:53:03,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 597 transitions, 4508 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 03:53:03,377 INFO L231 Difference]: Finished difference. Result has 153 places, 243 transitions, 2011 flow [2023-08-04 03:53:03,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2011, PETRI_PLACES=153, PETRI_TRANSITIONS=243} [2023-08-04 03:53:03,378 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 85 predicate places. [2023-08-04 03:53:03,378 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 243 transitions, 2011 flow [2023-08-04 03:53:03,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 149.33333333333334) internal successors, (3136), 21 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states 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 03:53:03,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:53:03,379 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:53:03,387 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 03:53:03,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-04 03:53:03,584 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:53:03,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:53:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1783488006, now seen corresponding path program 1 times [2023-08-04 03:53:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:53:03,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550540484] [2023-08-04 03:53:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:53:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:53:04,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:53:04,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550540484] [2023-08-04 03:53:04,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550540484] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:53:04,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850817518] [2023-08-04 03:53:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:04,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:04,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:53:04,069 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 03:53:04,071 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 03:53:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:04,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-04 03:53:04,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:53:04,197 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:53:04,254 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:04,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:53:04,269 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:53:04,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:53:04,306 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-04 03:53:04,336 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:04,337 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 25 treesize of output 11 [2023-08-04 03:53:04,385 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 22 treesize of output 17 [2023-08-04 03:53:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:53:04,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:53:04,527 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 21 treesize of output 19 [2023-08-04 03:53:04,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 15 treesize of output 8 [2023-08-04 03:53:12,556 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_69| Int) (|~#a~0.offset| Int) (v_ArrVal_631 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_631) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_69| 28) |~#a~0.offset|)) 0)) is different from false [2023-08-04 03:53:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:53:12,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850817518] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:53:12,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:53:12,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-04 03:53:12,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884797484] [2023-08-04 03:53:12,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:53:12,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-04 03:53:12,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:53:12,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-04 03:53:12,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=194, Unknown=3, NotChecked=30, Total=306 [2023-08-04 03:53:12,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-04 03:53:12,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 243 transitions, 2011 flow. Second operand has 18 states, 18 states have (on average 149.61111111111111) internal successors, (2693), 18 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states 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 03:53:12,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:53:12,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-04 03:53:12,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:53:15,698 INFO L124 PetriNetUnfolderBase]: 14082/26326 cut-off events. [2023-08-04 03:53:15,698 INFO L125 PetriNetUnfolderBase]: For 96150/96195 co-relation queries the response was YES. [2023-08-04 03:53:15,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100422 conditions, 26326 events. 14082/26326 cut-off events. For 96150/96195 co-relation queries the response was YES. Maximal size of possible extension queue 1010. Compared 234070 event pairs, 3837 based on Foata normal form. 53/24068 useless extension candidates. Maximal degree in co-relation 98231. Up to 13177 conditions per place. [2023-08-04 03:53:15,901 INFO L140 encePairwiseOnDemand]: 456/476 looper letters, 363 selfloop transitions, 103 changer transitions 139/614 dead transitions. [2023-08-04 03:53:15,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 614 transitions, 5421 flow [2023-08-04 03:53:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 03:53:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 03:53:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2437 transitions. [2023-08-04 03:53:15,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36569627851140457 [2023-08-04 03:53:15,905 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2437 transitions. [2023-08-04 03:53:15,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2437 transitions. [2023-08-04 03:53:15,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:53:15,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2437 transitions. [2023-08-04 03:53:15,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 174.07142857142858) internal successors, (2437), 14 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states 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 03:53:15,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 0 states 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 03:53:15,914 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 0 states 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 03:53:15,914 INFO L175 Difference]: Start difference. First operand has 153 places, 243 transitions, 2011 flow. Second operand 14 states and 2437 transitions. [2023-08-04 03:53:15,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 614 transitions, 5421 flow [2023-08-04 03:53:16,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 614 transitions, 5417 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 03:53:16,719 INFO L231 Difference]: Finished difference. Result has 175 places, 284 transitions, 2795 flow [2023-08-04 03:53:16,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2795, PETRI_PLACES=175, PETRI_TRANSITIONS=284} [2023-08-04 03:53:16,720 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 107 predicate places. [2023-08-04 03:53:16,720 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 284 transitions, 2795 flow [2023-08-04 03:53:16,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 149.61111111111111) internal successors, (2693), 18 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states 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 03:53:16,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:53:16,721 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:53:16,725 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 03:53:16,921 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,SelfDestructingSolverStorable17 [2023-08-04 03:53:16,921 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 03:53:16,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:53:16,921 INFO L85 PathProgramCache]: Analyzing trace with hash -567793192, now seen corresponding path program 3 times [2023-08-04 03:53:16,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:53:16,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84388943] [2023-08-04 03:53:16,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:16,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:53:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:53:21,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:53:21,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84388943] [2023-08-04 03:53:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84388943] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:53:21,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743704778] [2023-08-04 03:53:21,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 03:53:21,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:21,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:53:21,165 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 03:53:21,171 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 03:53:21,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-04 03:53:21,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:53:21,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-04 03:53:21,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:53:21,291 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:53:21,354 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:21,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:53:21,384 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:53:21,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:53:21,446 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 16 treesize of output 12 [2023-08-04 03:53:21,497 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:21,497 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 25 treesize of output 11 [2023-08-04 03:53:21,570 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 22 treesize of output 17 [2023-08-04 03:53:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:53:21,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:53:21,744 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 21 treesize of output 19 [2023-08-04 03:53:21,749 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 15 treesize of output 8 [2023-08-04 03:53:33,841 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_61| Int) (v_ArrVal_719 Int) (v_ArrVal_716 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_71| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_61|) (< |v_t_funThread2of2ForFork0_~i~0#1_61| 0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_716) |c_~#a~0.base|) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_71| 28)) v_ArrVal_719) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_61| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_61| |v_t_funThread1of2ForFork0_~i~0#1_71|))) is different from false [2023-08-04 03:53:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:53:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743704778] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:53:34,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:53:34,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 28 [2023-08-04 03:53:34,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809528151] [2023-08-04 03:53:34,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:53:34,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-04 03:53:34,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:53:34,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-04 03:53:34,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=631, Unknown=3, NotChecked=54, Total=870 [2023-08-04 03:53:34,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 476 [2023-08-04 03:53:34,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 284 transitions, 2795 flow. Second operand has 30 states, 30 states have (on average 144.06666666666666) internal successors, (4322), 30 states have internal predecessors, (4322), 0 states have call successors, (0), 0 states 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 03:53:34,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:53:34,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 476 [2023-08-04 03:53:34,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:53:39,176 INFO L124 PetriNetUnfolderBase]: 15080/28587 cut-off events. [2023-08-04 03:53:39,176 INFO L125 PetriNetUnfolderBase]: For 148674/148766 co-relation queries the response was YES. [2023-08-04 03:53:39,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118046 conditions, 28587 events. 15080/28587 cut-off events. For 148674/148766 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 260889 event pairs, 2615 based on Foata normal form. 56/26173 useless extension candidates. Maximal degree in co-relation 115731. Up to 13284 conditions per place. [2023-08-04 03:53:39,403 INFO L140 encePairwiseOnDemand]: 457/476 looper letters, 370 selfloop transitions, 141 changer transitions 172/692 dead transitions. [2023-08-04 03:53:39,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 692 transitions, 6990 flow [2023-08-04 03:53:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-04 03:53:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-04 03:53:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4267 transitions. [2023-08-04 03:53:39,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33201058201058203 [2023-08-04 03:53:39,408 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4267 transitions. [2023-08-04 03:53:39,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4267 transitions. [2023-08-04 03:53:39,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:53:39,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4267 transitions. [2023-08-04 03:53:39,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 158.03703703703704) internal successors, (4267), 27 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states 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 03:53:39,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 476.0) internal successors, (13328), 28 states have internal predecessors, (13328), 0 states have call successors, (0), 0 states 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 03:53:39,424 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 476.0) internal successors, (13328), 28 states have internal predecessors, (13328), 0 states have call successors, (0), 0 states 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 03:53:39,424 INFO L175 Difference]: Start difference. First operand has 175 places, 284 transitions, 2795 flow. Second operand 27 states and 4267 transitions. [2023-08-04 03:53:39,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 692 transitions, 6990 flow [2023-08-04 03:53:41,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 692 transitions, 6769 flow, removed 85 selfloop flow, removed 4 redundant places. [2023-08-04 03:53:41,141 INFO L231 Difference]: Finished difference. Result has 200 places, 304 transitions, 3417 flow [2023-08-04 03:53:41,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=2673, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3417, PETRI_PLACES=200, PETRI_TRANSITIONS=304} [2023-08-04 03:53:41,142 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 132 predicate places. [2023-08-04 03:53:41,142 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 304 transitions, 3417 flow [2023-08-04 03:53:41,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 144.06666666666666) internal successors, (4322), 30 states have internal predecessors, (4322), 0 states have call successors, (0), 0 states 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 03:53:41,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:53:41,143 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:53:41,147 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 03:53:41,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:41,343 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 03:53:41,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:53:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2039347774, now seen corresponding path program 2 times [2023-08-04 03:53:41,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:53:41,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940605448] [2023-08-04 03:53:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:41,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:53:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:53:41,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:53:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940605448] [2023-08-04 03:53:41,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940605448] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:53:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57129700] [2023-08-04 03:53:41,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:53:41,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:41,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:53:41,832 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 03:53:41,835 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 03:53:41,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:53:41,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:53:41,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-04 03:53:41,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:53:41,986 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:53:42,064 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:42,064 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:53:42,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:53:42,102 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:53:42,132 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 16 treesize of output 12 [2023-08-04 03:53:42,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:53:42,186 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 03:53:42,229 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:42,230 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 25 treesize of output 11 [2023-08-04 03:53:42,269 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 22 treesize of output 17 [2023-08-04 03:53:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:53:42,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:53:42,380 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_804 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_73| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_73| 28))) (or (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_804) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)))) (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) (forall ((v_ArrVal_804 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_804) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 4)) 0)))) is different from false [2023-08-04 03:53:42,406 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:53:42,406 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 71 treesize of output 59 [2023-08-04 03:53:42,413 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:53:42,413 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 94 treesize of output 75 [2023-08-04 03:53:42,424 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 54 treesize of output 47 [2023-08-04 03:53:42,427 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-04 03:53:48,482 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_801 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_73| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_801) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_73| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-04 03:53:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:53:50,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57129700] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:53:50,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:53:50,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-04 03:53:50,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490625612] [2023-08-04 03:53:50,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:53:50,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 03:53:50,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:53:50,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 03:53:50,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=254, Unknown=4, NotChecked=70, Total=420 [2023-08-04 03:53:50,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-04 03:53:50,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 304 transitions, 3417 flow. Second operand has 21 states, 21 states have (on average 149.33333333333334) internal successors, (3136), 21 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states 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 03:53:50,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:53:50,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-04 03:53:50,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:53:55,914 INFO L124 PetriNetUnfolderBase]: 16373/31449 cut-off events. [2023-08-04 03:53:55,914 INFO L125 PetriNetUnfolderBase]: For 180917/181026 co-relation queries the response was YES. [2023-08-04 03:53:56,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130932 conditions, 31449 events. 16373/31449 cut-off events. For 180917/181026 co-relation queries the response was YES. Maximal size of possible extension queue 1273. Compared 295920 event pairs, 3723 based on Foata normal form. 63/28850 useless extension candidates. Maximal degree in co-relation 128843. Up to 16379 conditions per place. [2023-08-04 03:53:56,114 INFO L140 encePairwiseOnDemand]: 457/476 looper letters, 397 selfloop transitions, 123 changer transitions 130/659 dead transitions. [2023-08-04 03:53:56,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 659 transitions, 6897 flow [2023-08-04 03:53:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-04 03:53:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-04 03:53:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2763 transitions. [2023-08-04 03:53:56,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3627888655462185 [2023-08-04 03:53:56,117 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2763 transitions. [2023-08-04 03:53:56,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2763 transitions. [2023-08-04 03:53:56,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:53:56,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2763 transitions. [2023-08-04 03:53:56,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 172.6875) internal successors, (2763), 16 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states 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 03:53:56,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 476.0) internal successors, (8092), 17 states have internal predecessors, (8092), 0 states have call successors, (0), 0 states 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 03:53:56,126 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 476.0) internal successors, (8092), 17 states have internal predecessors, (8092), 0 states have call successors, (0), 0 states 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 03:53:56,126 INFO L175 Difference]: Start difference. First operand has 200 places, 304 transitions, 3417 flow. Second operand 16 states and 2763 transitions. [2023-08-04 03:53:56,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 659 transitions, 6897 flow [2023-08-04 03:53:57,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 659 transitions, 6749 flow, removed 22 selfloop flow, removed 14 redundant places. [2023-08-04 03:53:57,369 INFO L231 Difference]: Finished difference. Result has 208 places, 324 transitions, 3975 flow [2023-08-04 03:53:57,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=3269, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3975, PETRI_PLACES=208, PETRI_TRANSITIONS=324} [2023-08-04 03:53:57,370 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 140 predicate places. [2023-08-04 03:53:57,370 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 324 transitions, 3975 flow [2023-08-04 03:53:57,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 149.33333333333334) internal successors, (3136), 21 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states 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 03:53:57,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:53:57,371 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:53:57,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-04 03:53:57,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:57,571 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:53:57,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:53:57,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1898646590, now seen corresponding path program 3 times [2023-08-04 03:53:57,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:53:57,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82389947] [2023-08-04 03:53:57,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:53:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:53:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:53:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:53:58,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:53:58,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82389947] [2023-08-04 03:53:58,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82389947] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:53:58,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981083416] [2023-08-04 03:53:58,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 03:53:58,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:53:58,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:53:58,229 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 03:53:58,257 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 03:53:58,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-04 03:53:58,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:53:58,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-04 03:53:58,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:53:58,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:53:58,460 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:58,461 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:53:58,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:53:58,514 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:53:58,547 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 16 treesize of output 12 [2023-08-04 03:53:58,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:53:58,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 03:53:58,633 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 22 treesize of output 17 [2023-08-04 03:53:58,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:53:58,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 03:53:58,716 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:53:58,716 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 25 treesize of output 11 [2023-08-04 03:53:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:53:58,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:53:58,815 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_893 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_75| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_75| 28))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_893) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2023-08-04 03:53:58,823 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_892 Int) (v_ArrVal_893 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_75| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_75| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_892) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_893) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2023-08-04 03:53:58,860 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:53:58,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-04 03:53:58,872 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:53:58,873 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 48 treesize of output 38 [2023-08-04 03:53:58,878 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 25 treesize of output 18 [2023-08-04 03:54:11,040 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_887 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_65| Int)) (or (forall ((v_ArrVal_892 Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_75| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_65| |v_t_funThread1of2ForFork0_~i~0#1_75|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_887) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_65| 28) |~#a~0.offset|) v_ArrVal_892) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_75| 28) |~#a~0.offset|)) 0))) (< |v_t_funThread2of2ForFork0_~i~0#1_65| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_65|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-04 03:54:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-04 03:54:14,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981083416] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:54:14,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:54:14,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-08-04 03:54:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366888892] [2023-08-04 03:54:14,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:54:14,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-04 03:54:14,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:54:14,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-04 03:54:14,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=282, Unknown=7, NotChecked=114, Total=506 [2023-08-04 03:54:15,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-04 03:54:15,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 324 transitions, 3975 flow. Second operand has 23 states, 23 states have (on average 149.30434782608697) internal successors, (3434), 23 states have internal predecessors, (3434), 0 states have call successors, (0), 0 states 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 03:54:15,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:54:15,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-04 03:54:15,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:54:20,927 INFO L124 PetriNetUnfolderBase]: 16586/32000 cut-off events. [2023-08-04 03:54:20,927 INFO L125 PetriNetUnfolderBase]: For 210193/210310 co-relation queries the response was YES. [2023-08-04 03:54:21,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138764 conditions, 32000 events. 16586/32000 cut-off events. For 210193/210310 co-relation queries the response was YES. Maximal size of possible extension queue 1338. Compared 303509 event pairs, 3739 based on Foata normal form. 13/29354 useless extension candidates. Maximal degree in co-relation 136671. Up to 17438 conditions per place. [2023-08-04 03:54:21,137 INFO L140 encePairwiseOnDemand]: 460/476 looper letters, 356 selfloop transitions, 158 changer transitions 94/617 dead transitions. [2023-08-04 03:54:21,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 617 transitions, 7154 flow [2023-08-04 03:54:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 03:54:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 03:54:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2106 transitions. [2023-08-04 03:54:21,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36869747899159666 [2023-08-04 03:54:21,139 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2106 transitions. [2023-08-04 03:54:21,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2106 transitions. [2023-08-04 03:54:21,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:54:21,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2106 transitions. [2023-08-04 03:54:21,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 175.5) internal successors, (2106), 12 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states 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 03:54:21,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 0 states have call successors, (0), 0 states 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 03:54:21,146 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 0 states have call successors, (0), 0 states 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 03:54:21,147 INFO L175 Difference]: Start difference. First operand has 208 places, 324 transitions, 3975 flow. Second operand 12 states and 2106 transitions. [2023-08-04 03:54:21,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 617 transitions, 7154 flow [2023-08-04 03:54:23,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 617 transitions, 6778 flow, removed 143 selfloop flow, removed 6 redundant places. [2023-08-04 03:54:23,721 INFO L231 Difference]: Finished difference. Result has 213 places, 354 transitions, 4563 flow [2023-08-04 03:54:23,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=3683, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4563, PETRI_PLACES=213, PETRI_TRANSITIONS=354} [2023-08-04 03:54:23,722 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 145 predicate places. [2023-08-04 03:54:23,722 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 354 transitions, 4563 flow [2023-08-04 03:54:23,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.30434782608697) internal successors, (3434), 23 states have internal predecessors, (3434), 0 states have call successors, (0), 0 states 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 03:54:23,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:54:23,723 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:54:23,729 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 03:54:23,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:54:23,928 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:54:23,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:54:23,929 INFO L85 PathProgramCache]: Analyzing trace with hash -849158552, now seen corresponding path program 4 times [2023-08-04 03:54:23,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:54:23,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92485281] [2023-08-04 03:54:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:54:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:54:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:54:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:54:56,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:54:56,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92485281] [2023-08-04 03:54:56,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92485281] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:54:56,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640888347] [2023-08-04 03:54:56,185 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 03:54:56,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:54:56,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:54:56,189 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 03:54:56,193 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 03:54:56,306 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 03:54:56,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:54:56,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-04 03:54:56,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:54:56,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:54:56,405 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:54:56,405 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:54:56,433 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:54:56,454 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 16 treesize of output 12 [2023-08-04 03:54:56,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:54:56,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 03:54:56,545 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 22 treesize of output 17 [2023-08-04 03:54:56,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:54:56,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 19 treesize of output 21 [2023-08-04 03:54:56,636 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 20 treesize of output 22 [2023-08-04 03:54:56,698 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:54:56,698 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 25 treesize of output 11 [2023-08-04 03:54:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 03:54:56,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:54:56,877 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_67| Int)) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_979) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_980) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|)))) is different from false [2023-08-04 03:54:56,890 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_67| Int) (v_ArrVal_977 Int)) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_977)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_980) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_979) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0)) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|)))) is different from false [2023-08-04 03:54:56,962 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:54:56,963 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-04 03:54:56,974 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:54:56,974 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 48 treesize of output 38 [2023-08-04 03:54:56,980 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-04 03:54:59,026 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_77| Int) (|~#a~0.offset| Int) (v_ArrVal_980 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_67| Int) (v_ArrVal_977 Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_977)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_980) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|)))) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_67| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_77| Int) (|~#a~0.offset| Int) (v_ArrVal_980 (Array Int Int)) (v_ArrVal_977 Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_67| |v_t_funThread1of2ForFork0_~i~0#1_77|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_977)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_980) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28) |~#a~0.offset|)) 0))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|))))) is different from false [2023-08-04 03:55:01,090 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_67| Int) (v_ArrVal_973 (Array Int Int))) (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_77| Int) (|~#a~0.offset| Int) (v_ArrVal_980 (Array Int Int)) (v_ArrVal_977 Int)) (or (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_973))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_977))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_980) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28) |~#a~0.offset|))) (= |v_t_funThread2of2ForFork0_~i~0#1_67| |v_t_funThread1of2ForFork0_~i~0#1_77|))) (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|))) (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_77| Int) (|~#a~0.offset| Int) (v_ArrVal_980 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_67| Int) (v_ArrVal_977 Int) (v_ArrVal_973 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_67| 0) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_973))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|) v_ArrVal_977))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_980) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_67| 28) |~#a~0.offset|))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_67|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-04 03:55:07,640 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:55:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-04 03:55:07,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640888347] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:55:07,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:55:07,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 32 [2023-08-04 03:55:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417908054] [2023-08-04 03:55:07,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:55:07,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-04 03:55:07,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:55:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-04 03:55:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=695, Unknown=5, NotChecked=236, Total=1122 [2023-08-04 03:55:08,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 476 [2023-08-04 03:55:08,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 354 transitions, 4563 flow. Second operand has 34 states, 34 states have (on average 141.76470588235293) internal successors, (4820), 34 states have internal predecessors, (4820), 0 states have call successors, (0), 0 states 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 03:55:08,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:55:08,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 476 [2023-08-04 03:55:08,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:55:16,272 INFO L124 PetriNetUnfolderBase]: 16755/32329 cut-off events. [2023-08-04 03:55:16,273 INFO L125 PetriNetUnfolderBase]: For 234687/234797 co-relation queries the response was YES. [2023-08-04 03:55:16,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145365 conditions, 32329 events. 16755/32329 cut-off events. For 234687/234797 co-relation queries the response was YES. Maximal size of possible extension queue 1384. Compared 306978 event pairs, 3151 based on Foata normal form. 10/29652 useless extension candidates. Maximal degree in co-relation 143266. Up to 17236 conditions per place. [2023-08-04 03:55:16,523 INFO L140 encePairwiseOnDemand]: 456/476 looper letters, 407 selfloop transitions, 185 changer transitions 231/832 dead transitions. [2023-08-04 03:55:16,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 832 transitions, 9427 flow [2023-08-04 03:55:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-04 03:55:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-04 03:55:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5422 transitions. [2023-08-04 03:55:16,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3254501800720288 [2023-08-04 03:55:16,530 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 5422 transitions. [2023-08-04 03:55:16,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 5422 transitions. [2023-08-04 03:55:16,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:55:16,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 5422 transitions. [2023-08-04 03:55:16,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 154.9142857142857) internal successors, (5422), 35 states have internal predecessors, (5422), 0 states have call successors, (0), 0 states 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 03:55:16,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 476.0) internal successors, (17136), 36 states have internal predecessors, (17136), 0 states have call successors, (0), 0 states 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 03:55:16,550 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 476.0) internal successors, (17136), 36 states have internal predecessors, (17136), 0 states have call successors, (0), 0 states 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 03:55:16,550 INFO L175 Difference]: Start difference. First operand has 213 places, 354 transitions, 4563 flow. Second operand 35 states and 5422 transitions. [2023-08-04 03:55:16,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 832 transitions, 9427 flow [2023-08-04 03:55:19,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 832 transitions, 9215 flow, removed 56 selfloop flow, removed 5 redundant places. [2023-08-04 03:55:19,213 INFO L231 Difference]: Finished difference. Result has 250 places, 373 transitions, 5130 flow [2023-08-04 03:55:19,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=4351, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=5130, PETRI_PLACES=250, PETRI_TRANSITIONS=373} [2023-08-04 03:55:19,214 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 182 predicate places. [2023-08-04 03:55:19,214 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 373 transitions, 5130 flow [2023-08-04 03:55:19,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 141.76470588235293) internal successors, (4820), 34 states have internal predecessors, (4820), 0 states have call successors, (0), 0 states 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 03:55:19,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:55:19,215 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:55:19,219 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 03:55:19,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:55:19,415 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:55:19,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:55:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash -649754148, now seen corresponding path program 1 times [2023-08-04 03:55:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:55:19,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771494891] [2023-08-04 03:55:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:55:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:55:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:55:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:55:24,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:55:24,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771494891] [2023-08-04 03:55:24,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771494891] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:55:24,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730750085] [2023-08-04 03:55:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:55:24,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:55:24,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:55:24,502 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 03:55:24,504 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 03:55:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:55:24,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-04 03:55:24,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:55:24,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:55:24,710 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:55:24,710 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:55:24,741 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:55:24,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:55:24,804 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 16 treesize of output 12 [2023-08-04 03:55:24,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:55:24,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 03:55:24,924 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:55:24,925 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 25 treesize of output 11 [2023-08-04 03:55:24,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 22 treesize of output 17 [2023-08-04 03:55:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:55:25,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:55:25,362 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:55:25,362 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-04 03:55:25,373 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:55:25,373 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 48 treesize of output 38 [2023-08-04 03:55:25,378 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 25 treesize of output 18 [2023-08-04 03:55:43,588 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_79| Int) (v_ArrVal_1061 (Array Int Int))) (or (forall ((v_ArrVal_1065 Int) (|~#a~0.offset| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1061) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_79| 28) |~#a~0.offset|) v_ArrVal_1065) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0) (= |ULTIMATE.start_main_~i~2#1| |v_t_funThread1of2ForFork0_~i~0#1_79|))) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_79|) (< |v_t_funThread1of2ForFork0_~i~0#1_79| 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-04 03:55:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-04 03:55:47,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730750085] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:55:47,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:55:47,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 31 [2023-08-04 03:55:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615648900] [2023-08-04 03:55:47,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:55:47,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-04 03:55:47,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:55:47,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-04 03:55:47,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=833, Unknown=6, NotChecked=60, Total=1056 [2023-08-04 03:55:47,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 476 [2023-08-04 03:55:47,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 373 transitions, 5130 flow. Second operand has 33 states, 33 states have (on average 144.0) internal successors, (4752), 33 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states 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 03:55:47,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:55:47,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 476 [2023-08-04 03:55:47,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:55:58,391 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 03:56:03,295 WARN L539 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 03:56:05,351 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 03:56:08,606 WARN L539 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 03:56:13,467 WARN L539 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 03:56:21,395 WARN L539 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 03:56:26,437 WARN L539 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 03:56:28,481 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 03:56:30,732 WARN L539 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 03:56:37,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 03:56:47,796 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 03:56:54,089 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 03:56:56,334 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 03:56:59,351 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 03:57:01,479 WARN L539 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 03:57:03,493 WARN L539 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 03:57:05,512 WARN L539 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 03:57:07,569 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 03:57:16,728 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 03:57:18,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:57:26,090 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 03:57:28,599 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 03:57:30,738 WARN L539 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 03:57:34,514 INFO L124 PetriNetUnfolderBase]: 30265/59591 cut-off events. [2023-08-04 03:57:34,515 INFO L125 PetriNetUnfolderBase]: For 492345/492447 co-relation queries the response was YES. [2023-08-04 03:57:35,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279917 conditions, 59591 events. 30265/59591 cut-off events. For 492345/492447 co-relation queries the response was YES. Maximal size of possible extension queue 2445. Compared 626842 event pairs, 7639 based on Foata normal form. 281/55074 useless extension candidates. Maximal degree in co-relation 274656. Up to 21385 conditions per place. [2023-08-04 03:57:35,175 INFO L140 encePairwiseOnDemand]: 435/476 looper letters, 625 selfloop transitions, 392 changer transitions 602/1628 dead transitions. [2023-08-04 03:57:35,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 1628 transitions, 21066 flow [2023-08-04 03:57:35,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-04 03:57:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-04 03:57:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 8519 transitions. [2023-08-04 03:57:35,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3314270152505447 [2023-08-04 03:57:35,184 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 8519 transitions. [2023-08-04 03:57:35,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 8519 transitions. [2023-08-04 03:57:35,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:57:35,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 8519 transitions. [2023-08-04 03:57:35,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 157.75925925925927) internal successors, (8519), 54 states have internal predecessors, (8519), 0 states have call successors, (0), 0 states 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 03:57:35,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 476.0) internal successors, (26180), 55 states have internal predecessors, (26180), 0 states have call successors, (0), 0 states 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 03:57:35,219 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 476.0) internal successors, (26180), 55 states have internal predecessors, (26180), 0 states have call successors, (0), 0 states 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 03:57:35,219 INFO L175 Difference]: Start difference. First operand has 250 places, 373 transitions, 5130 flow. Second operand 54 states and 8519 transitions. [2023-08-04 03:57:35,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 1628 transitions, 21066 flow [2023-08-04 03:57:43,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 1628 transitions, 20489 flow, removed 144 selfloop flow, removed 23 redundant places. [2023-08-04 03:57:43,014 INFO L231 Difference]: Finished difference. Result has 310 places, 637 transitions, 10555 flow [2023-08-04 03:57:43,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=4907, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=10555, PETRI_PLACES=310, PETRI_TRANSITIONS=637} [2023-08-04 03:57:43,015 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 242 predicate places. [2023-08-04 03:57:43,015 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 637 transitions, 10555 flow [2023-08-04 03:57:43,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 144.0) internal successors, (4752), 33 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states 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 03:57:43,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:57:43,016 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:57:43,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-04 03:57:43,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:43,221 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 03:57:43,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:57:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2133459604, now seen corresponding path program 1 times [2023-08-04 03:57:43,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:57:43,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18360538] [2023-08-04 03:57:43,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:43,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:57:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:57:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:57:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18360538] [2023-08-04 03:57:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18360538] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:57:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839866332] [2023-08-04 03:57:47,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:57:47,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:57:47,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:57:47,998 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 03:57:48,000 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 03:57:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:57:48,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-04 03:57:48,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:57:48,130 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 03:57:48,219 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:57:48,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:57:48,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:57:48,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 03:57:48,311 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 16 treesize of output 12 [2023-08-04 03:57:48,383 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:57:48,384 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 25 treesize of output 11 [2023-08-04 03:57:48,453 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 22 treesize of output 17 [2023-08-04 03:57:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 03:57:48,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:57:48,671 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 21 treesize of output 19 [2023-08-04 03:57:48,677 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 15 treesize of output 8 [2023-08-04 03:57:52,795 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1150 Int) (v_ArrVal_1147 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_81| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (= |ULTIMATE.start_main_~i~2#1| |v_t_funThread1of2ForFork0_~i~0#1_81|) (< |v_t_funThread1of2ForFork0_~i~0#1_81| 0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1147) |c_~#a~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|) v_ArrVal_1150) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_81| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_81|))) is different from false [2023-08-04 03:57:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-04 03:57:53,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839866332] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:57:53,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:57:53,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 28 [2023-08-04 03:57:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200788555] [2023-08-04 03:57:53,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:57:53,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-04 03:57:53,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:57:53,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-04 03:57:53,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=659, Unknown=3, NotChecked=54, Total=870 [2023-08-04 03:57:53,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 476 [2023-08-04 03:57:53,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 637 transitions, 10555 flow. Second operand has 30 states, 30 states have (on average 139.1) internal successors, (4173), 30 states have internal predecessors, (4173), 0 states have call successors, (0), 0 states 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 03:57:53,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:57:53,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 476 [2023-08-04 03:57:53,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:58:55,780 WARN L233 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 51 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 03:58:57,861 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 03:58:59,888 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 03:59:01,965 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 03:59:04,039 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 03:59:07,929 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:00:06,270 WARN L233 SmtUtils]: Spent 58.30s on a formula simplification. DAG size of input: 60 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:00:08,397 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:00:10,483 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:00:12,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:00:14,524 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:00:16,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:00:18,168 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:00:20,173 WARN L539 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:00:22,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:00:50,705 WARN L233 SmtUtils]: Spent 28.49s on a formula simplification. DAG size of input: 43 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:00:52,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:00:54,734 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:00:56,805 WARN L539 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:00:58,813 WARN L539 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:01:00,840 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:01:02,875 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:01:04,891 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:01:06,985 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:01:09,027 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:01:11,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:01:13,022 WARN L539 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:01:15,044 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:01:17,066 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:01:19,094 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:01:21,118 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:01:41,441 INFO L124 PetriNetUnfolderBase]: 31507/62336 cut-off events. [2023-08-04 04:01:41,441 INFO L125 PetriNetUnfolderBase]: For 1073838/1074188 co-relation queries the response was YES. [2023-08-04 04:01:42,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429205 conditions, 62336 events. 31507/62336 cut-off events. For 1073838/1074188 co-relation queries the response was YES. Maximal size of possible extension queue 2420. Compared 660651 event pairs, 10083 based on Foata normal form. 72/56945 useless extension candidates. Maximal degree in co-relation 422163. Up to 36643 conditions per place. [2023-08-04 04:01:42,556 INFO L140 encePairwiseOnDemand]: 452/476 looper letters, 808 selfloop transitions, 286 changer transitions 228/1331 dead transitions. [2023-08-04 04:01:42,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1331 transitions, 21733 flow [2023-08-04 04:01:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-04 04:01:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-04 04:01:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6558 transitions. [2023-08-04 04:01:42,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32040257963650576 [2023-08-04 04:01:42,562 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6558 transitions. [2023-08-04 04:01:42,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6558 transitions. [2023-08-04 04:01:42,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:01:42,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6558 transitions. [2023-08-04 04:01:42,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 152.51162790697674) internal successors, (6558), 43 states have internal predecessors, (6558), 0 states have call successors, (0), 0 states 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:01:42,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 476.0) internal successors, (20944), 44 states have internal predecessors, (20944), 0 states have call successors, (0), 0 states 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:01:42,588 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 476.0) internal successors, (20944), 44 states have internal predecessors, (20944), 0 states have call successors, (0), 0 states 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:01:42,588 INFO L175 Difference]: Start difference. First operand has 310 places, 637 transitions, 10555 flow. Second operand 43 states and 6558 transitions. [2023-08-04 04:01:42,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 1331 transitions, 21733 flow [2023-08-04 04:02:03,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 1331 transitions, 20857 flow, removed 381 selfloop flow, removed 17 redundant places. [2023-08-04 04:02:03,754 INFO L231 Difference]: Finished difference. Result has 340 places, 741 transitions, 13021 flow [2023-08-04 04:02:03,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=9927, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=13021, PETRI_PLACES=340, PETRI_TRANSITIONS=741} [2023-08-04 04:02:03,755 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 272 predicate places. [2023-08-04 04:02:03,755 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 741 transitions, 13021 flow [2023-08-04 04:02:03,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 139.1) internal successors, (4173), 30 states have internal predecessors, (4173), 0 states have call successors, (0), 0 states 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:03,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:02:03,756 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:02:03,767 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:02:03,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:03,962 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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:03,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:02:03,962 INFO L85 PathProgramCache]: Analyzing trace with hash -559621462, now seen corresponding path program 2 times [2023-08-04 04:02:03,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:02:03,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091651677] [2023-08-04 04:02:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:02:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:02:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:02:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 04:02:04,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:02:04,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091651677] [2023-08-04 04:02:04,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091651677] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:02:04,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46000258] [2023-08-04 04:02:04,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:02:04,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:02:04,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:02:04,538 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:02:04,541 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:02:04,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 04:02:04,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:02:04,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-04 04:02:04,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:02:04,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 04:02:04,754 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:02:04,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 04:02:04,775 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:02:04,797 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 16 treesize of output 12 [2023-08-04 04:02:04,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:02:04,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 04:02:04,905 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 22 treesize of output 17 [2023-08-04 04:02:04,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:02:04,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 04:02:04,985 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 20 treesize of output 22 [2023-08-04 04:02:05,048 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:02:05,049 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 25 treesize of output 11 [2023-08-04 04:02:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-04 04:02:05,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:02:05,172 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1238) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1237) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0))))) is different from false [2023-08-04 04:02:05,272 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:02:05,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-04 04:02:05,285 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:02:05,286 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 48 treesize of output 38 [2023-08-04 04:02:05,293 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 25 treesize of output 18 [2023-08-04 04:02:07,348 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1235 Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_83| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_83|) (< |v_t_funThread1of2ForFork0_~i~0#1_83| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|) v_ArrVal_1235)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1238) |c_~#a~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_83| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_83|) (< |v_t_funThread1of2ForFork0_~i~0#1_83| 0) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1235 Int) (|~#a~0.offset| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (= |ULTIMATE.start_main_~i~2#1| |v_t_funThread1of2ForFork0_~i~0#1_83|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|) v_ArrVal_1235)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1238) |c_~#a~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0))))))) is different from false [2023-08-04 04:02:09,392 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1235 Int) (|~#a~0.offset| Int) (v_ArrVal_1231 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_83| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_83|) (< |v_t_funThread1of2ForFork0_~i~0#1_83| 0) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1231))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|) v_ArrVal_1235))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1238) |c_~#a~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1231 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_83| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_83|) (< |v_t_funThread1of2ForFork0_~i~0#1_83| 0) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1235 Int) (|~#a~0.offset| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (= |ULTIMATE.start_main_~i~2#1| |v_t_funThread1of2ForFork0_~i~0#1_83|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1231))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|) v_ArrVal_1235))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1238) |c_~#a~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0)))))) is different from false [2023-08-04 04:02:17,131 WARN L233 SmtUtils]: Spent 7.66s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:02:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-04 04:02:17,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46000258] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:02:17,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:02:17,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 23 [2023-08-04 04:02:17,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430397873] [2023-08-04 04:02:17,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:02:17,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-04 04:02:17,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:02:17,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-04 04:02:17,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=365, Unknown=6, NotChecked=126, Total=600 [2023-08-04 04:02:17,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 476 [2023-08-04 04:02:17,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 741 transitions, 13021 flow. Second operand has 25 states, 25 states have (on average 147.24) internal successors, (3681), 25 states have internal predecessors, (3681), 0 states have call successors, (0), 0 states 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:17,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:02:17,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 476 [2023-08-04 04:02:17,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:02:22,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:02:22,893 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (= (select .cse0 (+ .cse1 |c_~#a~0.offset|)) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse1 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1235 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1235)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1238) |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1237) |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset| 4)) 0))))))) is different from false [2023-08-04 04:02:26,428 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1238 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1238) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1235 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1235)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1238) |c_~#a~0.base|) (+ .cse1 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1237) |c_~#a~0.base|) (+ .cse1 |c_~#a~0.offset| 4)) 0)))))) is different from false [2023-08-04 04:02:44,052 WARN L539 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:02:47,034 INFO L124 PetriNetUnfolderBase]: 34004/67767 cut-off events. [2023-08-04 04:02:47,034 INFO L125 PetriNetUnfolderBase]: For 1207507/1207840 co-relation queries the response was YES. [2023-08-04 04:02:48,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464272 conditions, 67767 events. 34004/67767 cut-off events. For 1207507/1207840 co-relation queries the response was YES. Maximal size of possible extension queue 2755. Compared 733291 event pairs, 7709 based on Foata normal form. 80/61949 useless extension candidates. Maximal degree in co-relation 456880. Up to 33692 conditions per place. [2023-08-04 04:02:48,281 INFO L140 encePairwiseOnDemand]: 443/476 looper letters, 696 selfloop transitions, 477 changer transitions 294/1476 dead transitions. [2023-08-04 04:02:48,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 1476 transitions, 25530 flow [2023-08-04 04:02:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-04 04:02:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-04 04:02:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5084 transitions. [2023-08-04 04:02:48,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3445378151260504 [2023-08-04 04:02:48,287 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5084 transitions. [2023-08-04 04:02:48,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5084 transitions. [2023-08-04 04:02:48,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:02:48,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5084 transitions. [2023-08-04 04:02:48,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 164.0) internal successors, (5084), 31 states have internal predecessors, (5084), 0 states have call successors, (0), 0 states 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:48,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 476.0) internal successors, (15232), 32 states have internal predecessors, (15232), 0 states have call successors, (0), 0 states 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:48,308 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 476.0) internal successors, (15232), 32 states have internal predecessors, (15232), 0 states have call successors, (0), 0 states 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:48,308 INFO L175 Difference]: Start difference. First operand has 340 places, 741 transitions, 13021 flow. Second operand 31 states and 5084 transitions. [2023-08-04 04:02:48,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 1476 transitions, 25530 flow [2023-08-04 04:03:08,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 1476 transitions, 24992 flow, removed 101 selfloop flow, removed 21 redundant places. [2023-08-04 04:03:08,697 INFO L231 Difference]: Finished difference. Result has 368 places, 884 transitions, 16681 flow [2023-08-04 04:03:08,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=12507, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=355, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=16681, PETRI_PLACES=368, PETRI_TRANSITIONS=884} [2023-08-04 04:03:08,698 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 300 predicate places. [2023-08-04 04:03:08,698 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 884 transitions, 16681 flow [2023-08-04 04:03:08,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 147.24) internal successors, (3681), 25 states have internal predecessors, (3681), 0 states have call successors, (0), 0 states 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,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:03:08,698 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:03:08,704 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:03:08,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-04 04:03:08,899 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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:08,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:03:08,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1634994652, now seen corresponding path program 3 times [2023-08-04 04:03:08,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:03:08,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182872739] [2023-08-04 04:03:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:03:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:03:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:03:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:03:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:03:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182872739] [2023-08-04 04:03:10,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182872739] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:03:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37398633] [2023-08-04 04:03:10,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 04:03:10,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:03:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:03:10,965 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:03:10,973 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:03:11,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 04:03:11,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:03:11,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-04 04:03:11,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:03:11,144 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 04:03:11,289 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-04 04:03:11,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-04 04:03:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:03:11,332 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 13 treesize of output 15 [2023-08-04 04:03:11,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:03:11,367 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 13 treesize of output 15 [2023-08-04 04:03:11,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-04 04:03:11,447 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:03:11,447 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 25 treesize of output 11 [2023-08-04 04:03:11,514 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 22 treesize of output 17 [2023-08-04 04:03:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:03:11,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:03:11,725 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 21 treesize of output 19 [2023-08-04 04:03:11,730 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 15 treesize of output 8 [2023-08-04 04:03:22,007 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_85| Int) (v_ArrVal_1319 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_85| 0) (= |ULTIMATE.start_main_~i~2#1| |v_t_funThread1of2ForFork0_~i~0#1_85|) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_85|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1319) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_85| 28) |~#a~0.offset|) v_ArrVal_1323) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-04 04:03:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-04 04:03:22,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37398633] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:03:22,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:03:22,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 29 [2023-08-04 04:03:22,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783675373] [2023-08-04 04:03:22,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:03:22,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-04 04:03:22,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:03:22,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-04 04:03:22,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=679, Unknown=3, NotChecked=56, Total=930 [2023-08-04 04:03:22,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 476 [2023-08-04 04:03:22,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 884 transitions, 16681 flow. Second operand has 31 states, 31 states have (on average 138.09677419354838) internal successors, (4281), 31 states have internal predecessors, (4281), 0 states have call successors, (0), 0 states 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,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:03:22,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 476 [2023-08-04 04:03:22,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:03:49,704 INFO L124 PetriNetUnfolderBase]: 34943/70516 cut-off events. [2023-08-04 04:03:49,704 INFO L125 PetriNetUnfolderBase]: For 1880520/1880921 co-relation queries the response was YES. [2023-08-04 04:03:51,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578821 conditions, 70516 events. 34943/70516 cut-off events. For 1880520/1880921 co-relation queries the response was YES. Maximal size of possible extension queue 2849. Compared 775610 event pairs, 11904 based on Foata normal form. 140/69000 useless extension candidates. Maximal degree in co-relation 571177. Up to 35473 conditions per place. [2023-08-04 04:03:51,221 INFO L140 encePairwiseOnDemand]: 457/476 looper letters, 845 selfloop transitions, 308 changer transitions 206/1368 dead transitions. [2023-08-04 04:03:51,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 1368 transitions, 27156 flow [2023-08-04 04:03:51,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-04 04:03:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-04 04:03:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3615 transitions. [2023-08-04 04:03:51,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3164390756302521 [2023-08-04 04:03:51,224 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3615 transitions. [2023-08-04 04:03:51,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3615 transitions. [2023-08-04 04:03:51,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:03:51,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3615 transitions. [2023-08-04 04:03:51,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 150.625) internal successors, (3615), 24 states have internal predecessors, (3615), 0 states have call successors, (0), 0 states 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:51,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 476.0) internal successors, (11900), 25 states have internal predecessors, (11900), 0 states have call successors, (0), 0 states 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:51,236 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 476.0) internal successors, (11900), 25 states have internal predecessors, (11900), 0 states have call successors, (0), 0 states 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:51,236 INFO L175 Difference]: Start difference. First operand has 368 places, 884 transitions, 16681 flow. Second operand 24 states and 3615 transitions. [2023-08-04 04:03:51,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 1368 transitions, 27156 flow [2023-08-04 04:04:20,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 1368 transitions, 25632 flow, removed 429 selfloop flow, removed 12 redundant places. [2023-08-04 04:04:20,141 INFO L231 Difference]: Finished difference. Result has 384 places, 932 transitions, 17561 flow [2023-08-04 04:04:20,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=15409, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=17561, PETRI_PLACES=384, PETRI_TRANSITIONS=932} [2023-08-04 04:04:20,142 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 316 predicate places. [2023-08-04 04:04:20,142 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 932 transitions, 17561 flow [2023-08-04 04:04:20,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 138.09677419354838) internal successors, (4281), 31 states have internal predecessors, (4281), 0 states have call successors, (0), 0 states 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:20,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:04:20,143 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:04:20,147 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:04:20,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-04 04:04:20,343 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 04:04:20,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:04:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1954030730, now seen corresponding path program 1 times [2023-08-04 04:04:20,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:04:20,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35250855] [2023-08-04 04:04:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:04:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:04:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:04:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:04:20,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:04:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35250855] [2023-08-04 04:04:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35250855] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:04:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008032088] [2023-08-04 04:04:20,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:04:20,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:04:20,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:04:20,661 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:04:20,689 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:04:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:04:20,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-04 04:04:20,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:04:20,824 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-04 04:04:20,915 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:04:20,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 04:04:20,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:04:20,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-04 04:04:21,012 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 16 treesize of output 12 [2023-08-04 04:04:21,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:04:21,061 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 04:04:21,100 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:04:21,100 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 25 treesize of output 11 [2023-08-04 04:04:21,133 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 22 treesize of output 17 [2023-08-04 04:04:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-04 04:04:21,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:04:21,246 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1407 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1407) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) (forall ((v_ArrVal_1407 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1407) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 4)) 0)))) is different from false [2023-08-04 04:04:21,275 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:04:21,275 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 71 treesize of output 59 [2023-08-04 04:04:21,286 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:04:21,286 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 94 treesize of output 75 [2023-08-04 04:04:21,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2023-08-04 04:04:21,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-04 04:04:23,369 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1404 (Array Int Int)) (|~#a~0.offset| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1404) |c_~#a~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-04 04:04:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-04 04:04:26,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008032088] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:04:26,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:04:26,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-04 04:04:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360646554] [2023-08-04 04:04:26,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:04:26,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 04:04:26,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:04:26,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 04:04:26,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=259, Unknown=2, NotChecked=70, Total=420 [2023-08-04 04:04:26,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-04 04:04:26,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 932 transitions, 17561 flow. Second operand has 21 states, 21 states have (on average 149.47619047619048) internal successors, (3139), 21 states have internal predecessors, (3139), 0 states have call successors, (0), 0 states 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:26,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:04:26,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-04 04:04:26,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:04:59,486 INFO L124 PetriNetUnfolderBase]: 44189/89537 cut-off events. [2023-08-04 04:04:59,486 INFO L125 PetriNetUnfolderBase]: For 2433647/2434021 co-relation queries the response was YES. [2023-08-04 04:05:01,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724758 conditions, 89537 events. 44189/89537 cut-off events. For 2433647/2434021 co-relation queries the response was YES. Maximal size of possible extension queue 3533. Compared 1023063 event pairs, 11617 based on Foata normal form. 284/87395 useless extension candidates. Maximal degree in co-relation 719568. Up to 43408 conditions per place. [2023-08-04 04:05:01,476 INFO L140 encePairwiseOnDemand]: 456/476 looper letters, 971 selfloop transitions, 500 changer transitions 353/1833 dead transitions. [2023-08-04 04:05:01,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1833 transitions, 34563 flow [2023-08-04 04:05:01,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-04 04:05:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-04 04:05:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4398 transitions. [2023-08-04 04:05:01,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35536522301228185 [2023-08-04 04:05:01,481 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4398 transitions. [2023-08-04 04:05:01,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4398 transitions. [2023-08-04 04:05:01,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:05:01,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4398 transitions. [2023-08-04 04:05:01,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 169.15384615384616) internal successors, (4398), 26 states have internal predecessors, (4398), 0 states have call successors, (0), 0 states 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:05:01,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 476.0) internal successors, (12852), 27 states have internal predecessors, (12852), 0 states have call successors, (0), 0 states 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:05:01,495 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 476.0) internal successors, (12852), 27 states have internal predecessors, (12852), 0 states have call successors, (0), 0 states 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:05:01,496 INFO L175 Difference]: Start difference. First operand has 384 places, 932 transitions, 17561 flow. Second operand 26 states and 4398 transitions. [2023-08-04 04:05:01,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 1833 transitions, 34563 flow Received shutdown request... [2023-08-04 04:05:01,578 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 04:05:01,582 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:05:01,625 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:05:01,625 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 04:05:01,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-04 04:05:01,778 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-08-04 04:05:01,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 04:05:01,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 04:05:01,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 04:05:01,779 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 04:05:01,779 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-04 04:05:01,780 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 04:05:01,780 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 04:05:01,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 04:05:01 BasicIcfg [2023-08-04 04:05:01,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 04:05:01,783 INFO L158 Benchmark]: Toolchain (without parser) took 788611.37ms. Allocated memory was 530.6MB in the beginning and 15.1GB in the end (delta: 14.6GB). Free memory was 491.8MB in the beginning and 8.2GB in the end (delta: -7.7GB). Peak memory consumption was 7.1GB. Max. memory is 16.0GB. [2023-08-04 04:05:01,783 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 362.8MB. Free memory was 316.0MB in the beginning and 315.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 04:05:01,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 679.39ms. Allocated memory is still 530.6MB. Free memory was 491.8MB in the beginning and 462.1MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-04 04:05:01,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.11ms. Allocated memory is still 530.6MB. Free memory was 462.1MB in the beginning and 459.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:05:01,784 INFO L158 Benchmark]: Boogie Preprocessor took 47.42ms. Allocated memory is still 530.6MB. Free memory was 459.4MB in the beginning and 457.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:05:01,784 INFO L158 Benchmark]: RCFGBuilder took 450.27ms. Allocated memory is still 530.6MB. Free memory was 457.3MB in the beginning and 498.4MB in the end (delta: -41.1MB). Peak memory consumption was 25.4MB. Max. memory is 16.0GB. [2023-08-04 04:05:01,784 INFO L158 Benchmark]: TraceAbstraction took 787360.50ms. Allocated memory was 530.6MB in the beginning and 15.1GB in the end (delta: 14.6GB). Free memory was 497.2MB in the beginning and 8.2GB in the end (delta: -7.7GB). Peak memory consumption was 7.1GB. Max. memory is 16.0GB. [2023-08-04 04:05:01,785 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 362.8MB. Free memory was 316.0MB in the beginning and 315.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 679.39ms. Allocated memory is still 530.6MB. Free memory was 491.8MB in the beginning and 462.1MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.11ms. Allocated memory is still 530.6MB. Free memory was 462.1MB in the beginning and 459.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.42ms. Allocated memory is still 530.6MB. Free memory was 459.4MB in the beginning and 457.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 450.27ms. Allocated memory is still 530.6MB. Free memory was 457.3MB in the beginning and 498.4MB in the end (delta: -41.1MB). Peak memory consumption was 25.4MB. Max. memory is 16.0GB. * TraceAbstraction took 787360.50ms. Allocated memory was 530.6MB in the beginning and 15.1GB in the end (delta: 14.6GB). Free memory was 497.2MB in the beginning and 8.2GB in the end (delta: -7.7GB). Peak memory consumption was 7.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 158 PlacesBefore, 45 PlacesAfterwards, 185 TransitionsBefore, 65 TransitionsAfterwards, 10336 CoEnabledTransitionPairs, 5 FixpointIterations, 35 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 16 ConcurrentYvCompositions, 7 ChoiceCompositions, 151 TotalNumberOfCompositions, 15158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8146, independent: 7914, independent conditional: 0, independent unconditional: 7914, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5129, independent: 5073, independent conditional: 0, independent unconditional: 5073, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8146, independent: 2841, independent conditional: 0, independent unconditional: 2841, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 5129, unknown conditional: 0, unknown unconditional: 5129] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 201, Positive conditional cache size: 0, Positive unconditional cache size: 201, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 158 PlacesBefore, 45 PlacesAfterwards, 185 TransitionsBefore, 66 TransitionsAfterwards, 10336 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 90 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 150 TotalNumberOfCompositions, 16649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8305, independent: 8033, independent conditional: 0, independent unconditional: 8033, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5080, independent: 5023, independent conditional: 0, independent unconditional: 5023, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8305, independent: 3010, independent conditional: 0, independent unconditional: 3010, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 5080, unknown conditional: 0, unknown unconditional: 5080] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, 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: 2.8s, 220 PlacesBefore, 68 PlacesAfterwards, 260 TransitionsBefore, 101 TransitionsAfterwards, 31416 CoEnabledTransitionPairs, 5 FixpointIterations, 37 TrivialSequentialCompositions, 141 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 27 ConcurrentYvCompositions, 7 ChoiceCompositions, 216 TotalNumberOfCompositions, 49651 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25177, independent: 24830, independent conditional: 0, independent unconditional: 24830, 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: 15630, independent: 15542, independent conditional: 0, independent unconditional: 15542, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25177, independent: 9288, independent conditional: 0, independent unconditional: 9288, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 15630, unknown conditional: 0, unknown unconditional: 15630] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 501, Positive conditional cache size: 0, Positive unconditional cache size: 501, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 216 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: 6.1s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 877 IncrementalHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 18 mSDtfsCounter, 877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=4, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 100 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 321 SizeOfPredicates, 3 NumberOfNonLiveVariables, 530 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 23/58 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, 272 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: 777.5s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 573.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 319 mSolverCounterUnknown, 11088 SdHoareTripleChecker+Valid, 145.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10797 mSDsluCounter, 1024 SdHoareTripleChecker+Invalid, 142.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11761 IncrementalHoareTripleChecker+Unchecked, 979 mSDsCounter, 1709 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26877 IncrementalHoareTripleChecker+Invalid, 40666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1709 mSolverCounterUnsat, 45 mSDtfsCounter, 26877 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1207 GetRequests, 629 SyntacticMatches, 39 SemanticMatches, 539 ConstructedPredicates, 24 IntricatePredicates, 1 DeprecatedPredicates, 4535 ImplicationChecksByTransitivity, 343.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17561occurred in iteration=17, InterpolantAutomatonStates: 330, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 195.1s InterpolantComputationTime, 846 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1185 ConstructedInterpolants, 349 QuantifiedInterpolants, 29280 SizeOfPredicates, 127 NumberOfNonLiveVariables, 3334 ConjunctsInSsa, 506 ConjunctsInUnsatCore, 48 InterpolantComputations, 4 PerfectInterpolantSequences, 1813/2227 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, 216 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: 3.6s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 9 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown