/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 INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 21:26:22,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 21:26:22,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 21:26:22,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 21:26:22,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 21:26:22,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 21:26:22,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 21:26:22,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 21:26:22,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 21:26:22,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 21:26:22,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 21:26:22,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 21:26:22,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 21:26:22,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 21:26:22,457 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 21:26:22,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 21:26:22,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 21:26:22,458 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 21:26:22,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 21:26:22,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 21:26:22,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 21:26:22,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 21:26:22,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 21:26:22,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 21:26:22,460 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 21:26:22,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 21:26:22,461 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 21:26:22,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 21:26:22,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 21:26:22,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 21:26:22,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:26:22,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 21:26:22,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 21:26:22,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 21:26:22,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 21:26:22,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 21:26:22,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 21:26:22,463 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 21:26:22,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 21:26:22,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 21:26:22,464 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 21:26:22,464 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 -> INSUFFICIENT_FIRST [2023-08-03 21:26:22,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 21:26:22,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 21:26:22,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 21:26:22,745 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 21:26:22,745 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 21:26:22,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i [2023-08-03 21:26:23,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 21:26:24,191 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 21:26:24,192 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i [2023-08-03 21:26:24,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b766880/b6d7fb00e3b742f49662876b7e244d88/FLAG5812d5543 [2023-08-03 21:26:24,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b766880/b6d7fb00e3b742f49662876b7e244d88 [2023-08-03 21:26:24,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 21:26:24,235 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 21:26:24,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 21:26:24,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 21:26:24,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 21:26:24,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:24,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b815e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24, skipping insertion in model container [2023-08-03 21:26:24,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:24,290 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 21:26:24,691 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_74-tricky_address1_racefree_bound2.i[41323,41336] [2023-08-03 21:26:24,724 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:26:24,749 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 21:26:24,775 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 21:26:24,777 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 21:26:24,788 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-03 21:26:24,798 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_74-tricky_address1_racefree_bound2.i[41323,41336] [2023-08-03 21:26:24,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:26:24,878 INFO L206 MainTranslator]: Completed translation [2023-08-03 21:26:24,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24 WrapperNode [2023-08-03 21:26:24,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 21:26:24,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 21:26:24,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 21:26:24,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 21:26:24,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:24,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:24,951 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 190 [2023-08-03 21:26:24,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 21:26:24,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 21:26:24,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 21:26:24,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 21:26:24,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:24,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:24,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:24,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:24,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:25,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:25,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:25,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:25,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 21:26:25,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 21:26:25,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 21:26:25,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 21:26:25,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (1/1) ... [2023-08-03 21:26:25,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:26:25,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:25,049 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-03 21:26:25,073 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-03 21:26:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 21:26:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 21:26:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 21:26:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 21:26:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-03 21:26:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 21:26:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-03 21:26:25,088 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-03 21:26:25,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 21:26:25,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 21:26:25,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 21:26:25,091 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 21:26:25,203 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 21:26:25,206 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 21:26:25,407 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 21:26:25,414 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 21:26:25,414 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-03 21:26:25,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:26:25 BoogieIcfgContainer [2023-08-03 21:26:25,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 21:26:25,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 21:26:25,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 21:26:25,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 21:26:25,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 09:26:24" (1/3) ... [2023-08-03 21:26:25,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c506168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:26:25, skipping insertion in model container [2023-08-03 21:26:25,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:26:24" (2/3) ... [2023-08-03 21:26:25,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c506168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:26:25, skipping insertion in model container [2023-08-03 21:26:25,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:26:25" (3/3) ... [2023-08-03 21:26:25,424 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i [2023-08-03 21:26:25,430 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 21:26:25,438 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 21:26:25,438 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 21:26:25,438 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 21:26:25,508 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-03 21:26:25,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-08-03 21:26:25,663 INFO L124 PetriNetUnfolderBase]: 45/260 cut-off events. [2023-08-03 21:26:25,663 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-03 21:26:25,670 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-03 21:26:25,671 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-08-03 21:26:25,679 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-08-03 21:26:25,683 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:26:25,699 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-03 21:26:25,703 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-03 21:26:25,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-08-03 21:26:25,760 INFO L124 PetriNetUnfolderBase]: 44/255 cut-off events. [2023-08-03 21:26:25,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:26:25,764 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-03 21:26:25,769 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-08-03 21:26:28,624 INFO L134 LiptonReduction]: Checked pairs total: 15158 [2023-08-03 21:26:28,624 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-03 21:26:28,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:26:28,640 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;@1e81bf14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:26:28,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:26:28,646 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:26:28,646 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2023-08-03 21:26:28,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:26:28,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:28,647 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-03 21:26:28,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:28,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash -164803575, now seen corresponding path program 1 times [2023-08-03 21:26:28,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:28,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685185963] [2023-08-03 21:26:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:28,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:28,860 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-03 21:26:28,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:28,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685185963] [2023-08-03 21:26:28,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685185963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:28,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:26:28,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:26:28,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052383361] [2023-08-03 21:26:28,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:28,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:26:28,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:28,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:26:28,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:26:28,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-03 21:26:28,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 65 transitions, 135 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-03 21:26:28,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:28,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-03 21:26:28,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:29,041 INFO L124 PetriNetUnfolderBase]: 301/651 cut-off events. [2023-08-03 21:26:29,041 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:26:29,042 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-03 21:26:29,044 INFO L140 encePairwiseOnDemand]: 318/341 looper letters, 20 selfloop transitions, 2 changer transitions 19/46 dead transitions. [2023-08-03 21:26:29,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-03 21:26:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:26:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:26:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-08-03 21:26:29,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512218963831867 [2023-08-03 21:26:29,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-08-03 21:26:29,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-08-03 21:26:29,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:29,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-08-03 21:26:29,066 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-03 21:26:29,070 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-03 21:26:29,071 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-03 21:26:29,073 INFO L175 Difference]: Start difference. First operand has 45 places, 65 transitions, 135 flow. Second operand 3 states and 524 transitions. [2023-08-03 21:26:29,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-03 21:26:29,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:26:29,077 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 69 flow [2023-08-03 21:26:29,079 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=69, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-03 21:26:29,081 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-03 21:26:29,082 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 69 flow [2023-08-03 21:26:29,082 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-03 21:26:29,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:29,082 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:29,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 21:26:29,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:29,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash 716448256, now seen corresponding path program 1 times [2023-08-03 21:26:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:29,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878692169] [2023-08-03 21:26:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:29,200 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-03 21:26:29,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:29,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878692169] [2023-08-03 21:26:29,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878692169] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:29,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594416774] [2023-08-03 21:26:29,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:29,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:29,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:29,213 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-03 21:26:29,216 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-03 21:26:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:29,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:26:29,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:29,332 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-03 21:26:29,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:29,367 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-03 21:26:29,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594416774] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:29,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:29,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 21:26:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224410632] [2023-08-03 21:26:29,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:29,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 21:26:29,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:29,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 21:26:29,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:26:29,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 341 [2023-08-03 21:26:29,399 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-03 21:26:29,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:29,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 341 [2023-08-03 21:26:29,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:29,455 INFO L124 PetriNetUnfolderBase]: 47/128 cut-off events. [2023-08-03 21:26:29,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:26:29,457 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 359 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-03 21:26:29,457 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-03 21:26:29,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-03 21:26:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:26:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:26:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 952 transitions. [2023-08-03 21:26:29,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46529814271749753 [2023-08-03 21:26:29,464 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 952 transitions. [2023-08-03 21:26:29,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 952 transitions. [2023-08-03 21:26:29,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:29,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 952 transitions. [2023-08-03 21:26:29,471 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-03 21:26:29,476 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-03 21:26:29,477 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-03 21:26:29,477 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 69 flow. Second operand 6 states and 952 transitions. [2023-08-03 21:26:29,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-03 21:26:29,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:29,479 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-03 21:26:29,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, 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-03 21:26:29,480 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-03 21:26:29,480 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-03 21:26:29,481 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-03 21:26:29,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:29,481 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-03 21:26:29,495 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-03 21:26:29,689 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-03 21:26:29,690 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:29,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1278120393, now seen corresponding path program 2 times [2023-08-03 21:26:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:29,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097169204] [2023-08-03 21:26:29,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:29,851 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-03 21:26:29,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:29,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097169204] [2023-08-03 21:26:29,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097169204] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:29,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938127781] [2023-08-03 21:26:29,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:26:29,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:29,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:29,858 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-03 21:26:29,867 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-03 21:26:29,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:26:29,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:26:29,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 21:26:29,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:29,953 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-03 21:26:29,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:30,000 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-03 21:26:30,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938127781] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:30,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:30,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 21:26:30,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370811599] [2023-08-03 21:26:30,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:30,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 21:26:30,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:30,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 21:26:30,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 21:26:30,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 341 [2023-08-03 21:26:30,047 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-03 21:26:30,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:30,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 341 [2023-08-03 21:26:30,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:30,137 INFO L124 PetriNetUnfolderBase]: 47/134 cut-off events. [2023-08-03 21:26:30,137 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-03 21:26:30,137 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 359 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-03 21:26:30,138 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-03 21:26:30,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-03 21:26:30,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 21:26:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 21:26:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1885 transitions. [2023-08-03 21:26:30,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46065493646138805 [2023-08-03 21:26:30,143 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1885 transitions. [2023-08-03 21:26:30,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1885 transitions. [2023-08-03 21:26:30,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:30,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1885 transitions. [2023-08-03 21:26:30,147 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-03 21:26:30,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 341.0) internal successors, (4433), 13 states have internal predecessors, (4433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:30,155 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 341.0) internal successors, (4433), 13 states have internal predecessors, (4433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:30,156 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1885 transitions. [2023-08-03 21:26:30,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-03 21:26:30,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:30,158 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-03 21:26:30,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, 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-03 21:26:30,159 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-03 21:26:30,159 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-03 21:26:30,160 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-03 21:26:30,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:30,160 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-03 21:26:30,168 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-03 21:26:30,365 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-03 21:26:30,365 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:30,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:30,366 INFO L85 PathProgramCache]: Analyzing trace with hash 766826089, now seen corresponding path program 3 times [2023-08-03 21:26:30,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:30,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512208176] [2023-08-03 21:26:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:30,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:26:30,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:26:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:26:30,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:26:30,477 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:26:30,478 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:26:30,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 21:26:30,480 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-03 21:26:30,481 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (1/2) [2023-08-03 21:26:30,482 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 21:26:30,482 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 21:26:30,526 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-03 21:26:30,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:30,589 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-03 21:26:30,589 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:26:30,592 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-03 21:26:30,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:30,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:30,596 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:26:30,597 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:30,597 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:30,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:30,641 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-03 21:26:30,641 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:26:30,645 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-03 21:26:30,662 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-08-03 21:26:33,675 INFO L134 LiptonReduction]: Checked pairs total: 55124 [2023-08-03 21:26:33,675 INFO L136 LiptonReduction]: Total number of compositions: 218 [2023-08-03 21:26:33,680 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:26:33,681 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;@1e81bf14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:26:33,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:26:33,692 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:26:33,693 INFO L124 PetriNetUnfolderBase]: 38/115 cut-off events. [2023-08-03 21:26:33,693 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-03 21:26:33,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:33,693 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 21:26:33,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:33,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1123911026, now seen corresponding path program 1 times [2023-08-03 21:26:33,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:33,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198349795] [2023-08-03 21:26:33,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:33,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:33,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:33,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198349795] [2023-08-03 21:26:33,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198349795] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:33,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:26:33,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:26:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494892063] [2023-08-03 21:26:33,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:33,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:26:33,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:33,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:26:33,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:26:33,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 478 [2023-08-03 21:26:33,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 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-03 21:26:33,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:33,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 478 [2023-08-03 21:26:33,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:35,144 INFO L124 PetriNetUnfolderBase]: 9872/15757 cut-off events. [2023-08-03 21:26:35,144 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-03 21:26:35,166 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 104377 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-03 21:26:35,186 INFO L140 encePairwiseOnDemand]: 444/478 looper letters, 36 selfloop transitions, 2 changer transitions 23/70 dead transitions. [2023-08-03 21:26:35,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-08-03 21:26:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:26:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:26:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2023-08-03 21:26:35,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50139470013947 [2023-08-03 21:26:35,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 719 transitions. [2023-08-03 21:26:35,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 719 transitions. [2023-08-03 21:26:35,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:35,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 719 transitions. [2023-08-03 21:26:35,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:35,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:35,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:35,194 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 719 transitions. [2023-08-03 21:26:35,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-08-03 21:26:35,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:26:35,199 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 116 flow [2023-08-03 21:26:35,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, 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=116, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2023-08-03 21:26:35,200 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 21:26:35,201 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 116 flow [2023-08-03 21:26:35,201 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-03 21:26:35,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:35,201 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:35,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 21:26:35,201 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:35,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -207077384, now seen corresponding path program 1 times [2023-08-03 21:26:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:35,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624903399] [2023-08-03 21:26:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:35,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:35,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:35,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624903399] [2023-08-03 21:26:35,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624903399] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:35,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407695971] [2023-08-03 21:26:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:35,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:35,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:35,258 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-03 21:26:35,258 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-03 21:26:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:35,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:26:35,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:35,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:35,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407695971] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:35,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:35,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 21:26:35,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24491013] [2023-08-03 21:26:35,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:35,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 21:26:35,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:35,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 21:26:35,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:26:35,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 478 [2023-08-03 21:26:35,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 210.71428571428572) internal successors, (1475), 7 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:35,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:35,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 478 [2023-08-03 21:26:35,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:35,643 INFO L124 PetriNetUnfolderBase]: 1738/2923 cut-off events. [2023-08-03 21:26:35,644 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-08-03 21:26:35,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5649 conditions, 2923 events. 1738/2923 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16152 event pairs, 1617 based on Foata normal form. 0/2391 useless extension candidates. Maximal degree in co-relation 5636. Up to 2647 conditions per place. [2023-08-03 21:26:35,656 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 36 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-03 21:26:35,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 210 flow [2023-08-03 21:26:35,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:26:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:26:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1298 transitions. [2023-08-03 21:26:35,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525801952580195 [2023-08-03 21:26:35,660 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1298 transitions. [2023-08-03 21:26:35,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1298 transitions. [2023-08-03 21:26:35,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:35,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1298 transitions. [2023-08-03 21:26:35,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 216.33333333333334) internal successors, (1298), 6 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:35,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:35,668 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:35,668 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 116 flow. Second operand 6 states and 1298 transitions. [2023-08-03 21:26:35,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 210 flow [2023-08-03 21:26:35,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 204 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:35,670 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 146 flow [2023-08-03 21:26:35,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-03 21:26:35,670 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2023-08-03 21:26:35,671 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 146 flow [2023-08-03 21:26:35,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.71428571428572) internal successors, (1475), 7 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:35,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:35,672 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 21:26:35,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 21:26:35,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:35,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:35,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1964701426, now seen corresponding path program 2 times [2023-08-03 21:26:35,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:35,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654234174] [2023-08-03 21:26:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:35,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:35,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654234174] [2023-08-03 21:26:35,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654234174] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:35,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139064187] [2023-08-03 21:26:35,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:26:35,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:35,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:35,981 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-03 21:26:35,985 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-03 21:26:36,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:26:36,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:26:36,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 21:26:36,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:36,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:26:36,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139064187] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:36,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:36,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 21:26:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915250954] [2023-08-03 21:26:36,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:36,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 21:26:36,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:36,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 21:26:36,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 21:26:36,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 478 [2023-08-03 21:26:36,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 146 flow. Second operand has 13 states, 13 states have (on average 210.3846153846154) internal successors, (2735), 13 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:36,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:36,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 478 [2023-08-03 21:26:36,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:36,451 INFO L124 PetriNetUnfolderBase]: 1738/2929 cut-off events. [2023-08-03 21:26:36,451 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2023-08-03 21:26:36,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5680 conditions, 2929 events. 1738/2929 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16191 event pairs, 1617 based on Foata normal form. 6/2404 useless extension candidates. Maximal degree in co-relation 5621. Up to 2647 conditions per place. [2023-08-03 21:26:36,465 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 36 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2023-08-03 21:26:36,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 276 flow [2023-08-03 21:26:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 21:26:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 21:26:36,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2561 transitions. [2023-08-03 21:26:36,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4464783821478382 [2023-08-03 21:26:36,474 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2561 transitions. [2023-08-03 21:26:36,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2561 transitions. [2023-08-03 21:26:36,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:36,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2561 transitions. [2023-08-03 21:26:36,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 213.41666666666666) internal successors, (2561), 12 states have internal predecessors, (2561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:36,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 478.0) internal successors, (6214), 13 states have internal predecessors, (6214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:36,493 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 478.0) internal successors, (6214), 13 states have internal predecessors, (6214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:36,493 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 146 flow. Second operand 12 states and 2561 transitions. [2023-08-03 21:26:36,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 276 flow [2023-08-03 21:26:36,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 56 transitions, 262 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:36,496 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 216 flow [2023-08-03 21:26:36,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=216, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2023-08-03 21:26:36,497 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2023-08-03 21:26:36,497 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 216 flow [2023-08-03 21:26:36,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 210.3846153846154) internal successors, (2735), 13 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:36,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:36,499 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 21:26:36,507 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-03 21:26:36,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:36,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:26:36,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash -193054414, now seen corresponding path program 3 times [2023-08-03 21:26:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316508840] [2023-08-03 21:26:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:26:36,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:36,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316508840] [2023-08-03 21:26:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316508840] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:36,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530380806] [2023-08-03 21:26:36,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:26:36,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:36,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:36,788 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-03 21:26:36,792 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-03 21:26:36,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-03 21:26:36,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:26:36,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:26:36,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:26:36,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:26:36,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530380806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:36,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:26:36,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 21:26:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810286459] [2023-08-03 21:26:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:36,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:26:36,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:36,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:26:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:26:36,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 478 [2023-08-03 21:26:36,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:36,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:36,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 478 [2023-08-03 21:26:36,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:37,227 INFO L124 PetriNetUnfolderBase]: 1201/2046 cut-off events. [2023-08-03 21:26:37,227 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-08-03 21:26:37,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4126 conditions, 2046 events. 1201/2046 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10802 event pairs, 112 based on Foata normal form. 0/1832 useless extension candidates. Maximal degree in co-relation 4049. Up to 1410 conditions per place. [2023-08-03 21:26:37,235 INFO L140 encePairwiseOnDemand]: 474/478 looper letters, 0 selfloop transitions, 0 changer transitions 103/103 dead transitions. [2023-08-03 21:26:37,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 498 flow [2023-08-03 21:26:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:26:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:26:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1131 transitions. [2023-08-03 21:26:37,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47322175732217575 [2023-08-03 21:26:37,239 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1131 transitions. [2023-08-03 21:26:37,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1131 transitions. [2023-08-03 21:26:37,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:37,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1131 transitions. [2023-08-03 21:26:37,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 226.2) internal successors, (1131), 5 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:37,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:37,246 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:37,246 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 216 flow. Second operand 5 states and 1131 transitions. [2023-08-03 21:26:37,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 498 flow [2023-08-03 21:26:37,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 103 transitions, 449 flow, removed 19 selfloop flow, removed 6 redundant places. [2023-08-03 21:26:37,249 INFO L231 Difference]: Finished difference. Result has 71 places, 0 transitions, 0 flow [2023-08-03 21:26:37,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=71, PETRI_TRANSITIONS=0} [2023-08-03 21:26:37,250 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 21:26:37,250 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 0 transitions, 0 flow [2023-08-03 21:26:37,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:37,251 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:26:37,263 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-03 21:26:37,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:37,464 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-03 21:26:37,464 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE (1/2) [2023-08-03 21:26:37,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:37,519 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-03 21:26:37,519 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:26:37,523 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-03 21:26:37,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:37,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:37,528 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:26:37,528 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:37,528 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:37,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 21:26:37,575 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-03 21:26:37,575 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 21:26:37,579 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-03 21:26:37,592 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-08-03 21:26:40,293 INFO L134 LiptonReduction]: Checked pairs total: 54087 [2023-08-03 21:26:40,294 INFO L136 LiptonReduction]: Total number of compositions: 212 [2023-08-03 21:26:40,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:26:40,295 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;@1e81bf14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:26:40,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 21:26:40,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:26:40,298 INFO L124 PetriNetUnfolderBase]: 7/25 cut-off events. [2023-08-03 21:26:40,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:26:40,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:40,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 21:26:40,299 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-03 21:26:40,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1743075921, now seen corresponding path program 1 times [2023-08-03 21:26:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287079970] [2023-08-03 21:26:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:40,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:40,319 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-03 21:26:40,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:40,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287079970] [2023-08-03 21:26:40,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287079970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:40,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:26:40,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:26:40,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311619553] [2023-08-03 21:26:40,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:40,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:26:40,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:40,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:26:40,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:26:40,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 472 [2023-08-03 21:26:40,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 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-03 21:26:40,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:40,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 472 [2023-08-03 21:26:40,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:41,311 INFO L124 PetriNetUnfolderBase]: 9849/15756 cut-off events. [2023-08-03 21:26:41,311 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-03 21:26:41,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30204 conditions, 15756 events. 9849/15756 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 104685 event pairs, 9112 based on Foata normal form. 2729/16053 useless extension candidates. Maximal degree in co-relation 12153. Up to 14349 conditions per place. [2023-08-03 21:26:41,389 INFO L140 encePairwiseOnDemand]: 438/472 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-03 21:26:41,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-08-03 21:26:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:26:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:26:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2023-08-03 21:26:41,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507768361581921 [2023-08-03 21:26:41,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 719 transitions. [2023-08-03 21:26:41,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 719 transitions. [2023-08-03 21:26:41,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:41,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 719 transitions. [2023-08-03 21:26:41,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:41,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:41,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:41,397 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 719 transitions. [2023-08-03 21:26:41,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-08-03 21:26:41,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:26:41,400 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-03 21:26:41,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, 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-03 21:26:41,403 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 21:26:41,403 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-03 21:26:41,403 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-03 21:26:41,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:41,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:41,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 21:26:41,404 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-03 21:26:41,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1643433822, now seen corresponding path program 1 times [2023-08-03 21:26:41,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:41,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303004801] [2023-08-03 21:26:41,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:41,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:41,428 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-03 21:26:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:41,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303004801] [2023-08-03 21:26:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303004801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:41,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:26:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:26:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044835214] [2023-08-03 21:26:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:41,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:26:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:41,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:26:41,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:26:41,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 472 [2023-08-03 21:26:41,438 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-03 21:26:41,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:41,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 472 [2023-08-03 21:26:41,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:42,150 INFO L124 PetriNetUnfolderBase]: 9675/15650 cut-off events. [2023-08-03 21:26:42,150 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-03 21:26:42,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30110 conditions, 15650 events. 9675/15650 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 106510 event pairs, 4312 based on Foata normal form. 0/13238 useless extension candidates. Maximal degree in co-relation 30097. Up to 14317 conditions per place. [2023-08-03 21:26:42,243 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 72 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-03 21:26:42,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 350 flow [2023-08-03 21:26:42,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:26:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:26:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2023-08-03 21:26:42,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4971751412429379 [2023-08-03 21:26:42,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2023-08-03 21:26:42,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2023-08-03 21:26:42,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:42,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2023-08-03 21:26:42,247 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-03 21:26:42,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:42,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:42,250 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 704 transitions. [2023-08-03 21:26:42,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 350 flow [2023-08-03 21:26:42,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:42,252 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-03 21:26:42,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, 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-03 21:26:42,252 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-03 21:26:42,252 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-03 21:26:42,253 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-03 21:26:42,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:42,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:42,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 21:26:42,253 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-03 21:26:42,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:42,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1988470643, now seen corresponding path program 1 times [2023-08-03 21:26:42,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:42,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137335855] [2023-08-03 21:26:42,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:42,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:42,288 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-03 21:26:42,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137335855] [2023-08-03 21:26:42,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137335855] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830935813] [2023-08-03 21:26:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:42,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:42,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:42,294 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-03 21:26:42,317 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-03 21:26:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:42,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:26:42,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:26:42,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:42,396 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-03 21:26:42,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830935813] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:42,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:42,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 21:26:42,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910914871] [2023-08-03 21:26:42,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:42,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 21:26:42,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:42,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 21:26:42,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:26:42,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 472 [2023-08-03 21:26:42,421 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-03 21:26:42,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:42,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 472 [2023-08-03 21:26:42,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:43,345 INFO L124 PetriNetUnfolderBase]: 9912/15619 cut-off events. [2023-08-03 21:26:43,345 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2023-08-03 21:26:43,369 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 506. Compared 101455 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-03 21:26:43,402 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 56 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-03 21:26:43,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 310 flow [2023-08-03 21:26:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:26:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:26:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1317 transitions. [2023-08-03 21:26:43,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4650423728813559 [2023-08-03 21:26:43,406 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1317 transitions. [2023-08-03 21:26:43,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1317 transitions. [2023-08-03 21:26:43,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:43,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1317 transitions. [2023-08-03 21:26:43,409 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-03 21:26:43,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,413 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:43,413 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1317 transitions. [2023-08-03 21:26:43,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 310 flow [2023-08-03 21:26:43,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:43,416 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-03 21:26:43,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, 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-03 21:26:43,416 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-03 21:26:43,416 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-03 21:26:43,417 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-03 21:26:43,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:43,417 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:43,427 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-03 21:26:43,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:43,623 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-03 21:26:43,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:43,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1129668096, now seen corresponding path program 2 times [2023-08-03 21:26:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:43,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214689063] [2023-08-03 21:26:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:43,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:43,697 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-03 21:26:43,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:43,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214689063] [2023-08-03 21:26:43,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214689063] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:43,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884276215] [2023-08-03 21:26:43,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:26:43,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:43,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:43,699 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-03 21:26:43,702 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-03 21:26:43,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-03 21:26:43,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:26:43,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-03 21:26:43,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:43,809 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-03 21:26:43,855 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:26:43,856 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-03 21:26:43,875 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-03 21:26:43,929 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-03 21:26:43,929 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:26:43,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884276215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:26:43,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:26:43,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-03 21:26:43,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375977174] [2023-08-03 21:26:43,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:26:43,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-03 21:26:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-03 21:26:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-03 21:26:44,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 472 [2023-08-03 21:26:44,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 201.5) internal successors, (1209), 6 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:44,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:44,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 472 [2023-08-03 21:26:44,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:45,091 INFO L124 PetriNetUnfolderBase]: 10217/16656 cut-off events. [2023-08-03 21:26:45,091 INFO L125 PetriNetUnfolderBase]: For 670/670 co-relation queries the response was YES. [2023-08-03 21:26:45,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32720 conditions, 16656 events. 10217/16656 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 117444 event pairs, 1772 based on Foata normal form. 0/14576 useless extension candidates. Maximal degree in co-relation 32684. Up to 11893 conditions per place. [2023-08-03 21:26:45,154 INFO L140 encePairwiseOnDemand]: 463/472 looper letters, 131 selfloop transitions, 14 changer transitions 9/167 dead transitions. [2023-08-03 21:26:45,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 167 transitions, 735 flow [2023-08-03 21:26:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:26:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:26:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions. [2023-08-03 21:26:45,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4770480225988701 [2023-08-03 21:26:45,159 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions. [2023-08-03 21:26:45,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions. [2023-08-03 21:26:45,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:45,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions. [2023-08-03 21:26:45,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:45,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:45,166 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:45,166 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1351 transitions. [2023-08-03 21:26:45,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 167 transitions, 735 flow [2023-08-03 21:26:45,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 167 transitions, 721 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 21:26:45,171 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 280 flow [2023-08-03 21:26:45,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, 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=280, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2023-08-03 21:26:45,171 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-03 21:26:45,172 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 280 flow [2023-08-03 21:26:45,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 201.5) internal successors, (1209), 6 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:45,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:45,172 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:45,178 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-03 21:26:45,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:45,378 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:26:45,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash -838764964, now seen corresponding path program 1 times [2023-08-03 21:26:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:45,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496251965] [2023-08-03 21:26:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:45,456 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-03 21:26:45,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496251965] [2023-08-03 21:26:45,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496251965] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752372513] [2023-08-03 21:26:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:45,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:45,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:45,458 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-03 21:26:45,461 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-03 21:26:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:45,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 21:26:45,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:45,558 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-03 21:26:45,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:45,598 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-03 21:26:45,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752372513] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:45,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:45,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 21:26:45,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664799196] [2023-08-03 21:26:45,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:45,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 21:26:45,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:45,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 21:26:45,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 21:26:45,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 472 [2023-08-03 21:26:45,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 280 flow. Second operand has 13 states, 13 states have (on average 210.69230769230768) internal successors, (2739), 13 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:45,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:26:45,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 472 [2023-08-03 21:26:45,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:26:46,764 INFO L124 PetriNetUnfolderBase]: 10219/16583 cut-off events. [2023-08-03 21:26:46,765 INFO L125 PetriNetUnfolderBase]: For 3424/3429 co-relation queries the response was YES. [2023-08-03 21:26:46,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35717 conditions, 16583 events. 10219/16583 cut-off events. For 3424/3429 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 114106 event pairs, 9019 based on Foata normal form. 6/15198 useless extension candidates. Maximal degree in co-relation 35659. Up to 15405 conditions per place. [2023-08-03 21:26:46,838 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 68 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-03 21:26:46,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 474 flow [2023-08-03 21:26:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 21:26:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 21:26:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2580 transitions. [2023-08-03 21:26:46,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4555084745762712 [2023-08-03 21:26:46,846 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2580 transitions. [2023-08-03 21:26:46,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2580 transitions. [2023-08-03 21:26:46,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:26:46,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2580 transitions. [2023-08-03 21:26:46,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 215.0) internal successors, (2580), 12 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:46,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 472.0) internal successors, (6136), 13 states have internal predecessors, (6136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:46,862 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 472.0) internal successors, (6136), 13 states have internal predecessors, (6136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:46,862 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 280 flow. Second operand 12 states and 2580 transitions. [2023-08-03 21:26:46,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 474 flow [2023-08-03 21:26:46,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:26:46,871 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 364 flow [2023-08-03 21:26:46,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=364, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2023-08-03 21:26:46,872 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-08-03 21:26:46,872 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 364 flow [2023-08-03 21:26:46,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 210.69230769230768) internal successors, (2739), 13 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:26:46,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:26:46,873 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:26:46,881 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-03 21:26:47,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-03 21:26:47,078 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-03 21:26:47,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:26:47,079 INFO L85 PathProgramCache]: Analyzing trace with hash 639830844, now seen corresponding path program 2 times [2023-08-03 21:26:47,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:26:47,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547561212] [2023-08-03 21:26:47,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:26:47,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:26:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:26:47,442 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-03 21:26:47,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:26:47,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547561212] [2023-08-03 21:26:47,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547561212] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:26:47,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101547834] [2023-08-03 21:26:47,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:26:47,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:26:47,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:26:47,445 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-03 21:26:47,464 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-03 21:26:47,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:26:47,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:26:47,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-03 21:26:47,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:26:47,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-03 21:26:47,629 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:26:47,629 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-03 21:26:47,648 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-03 21:26:47,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:26:47,709 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-03 21:26:47,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:26:57,870 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-03 21:26:57,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101547834] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:26:57,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:26:57,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-03 21:26:57,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266273081] [2023-08-03 21:26:57,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:26:57,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 21:26:57,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:26:57,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 21:26:57,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=112, Unknown=4, NotChecked=0, Total=156 [2023-08-03 21:26:59,897 WARN L539 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-03 21:27:01,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:03,949 WARN L539 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-03 21:27:05,961 WARN L539 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-03 21:27:07,983 WARN L539 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-03 21:27:10,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:12,057 WARN L539 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-03 21:27:14,071 WARN L539 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-03 21:27:16,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:18,130 WARN L539 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-03 21:27:20,144 WARN L539 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-03 21:27:22,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:24,201 WARN L539 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-03 21:27:26,214 WARN L539 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-03 21:27:28,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:30,262 WARN L539 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-03 21:27:32,291 WARN L539 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-03 21:27:34,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:36,337 WARN L539 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-03 21:27:38,362 WARN L539 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-03 21:27:40,377 WARN L539 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-03 21:27:42,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:44,457 WARN L539 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-03 21:27:46,477 WARN L539 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-03 21:27:48,495 WARN L539 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-03 21:27:50,514 WARN L539 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-03 21:27:52,525 WARN L539 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-03 21:27:54,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:56,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:27:58,580 WARN L539 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-03 21:28:00,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:28:02,614 WARN L539 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-03 21:28:04,636 WARN L539 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-03 21:28:06,656 WARN L539 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-03 21:28:08,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:28:10,695 WARN L539 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-03 21:28:12,705 WARN L539 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-03 21:28:14,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:28:16,730 WARN L539 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-03 21:28:18,742 WARN L539 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-03 21:28:20,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:28:22,762 WARN L539 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-03 21:28:24,783 WARN L539 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-03 21:28:26,803 WARN L539 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-03 21:28:26,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 472 [2023-08-03 21:28:26,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 364 flow. Second operand has 13 states, 13 states have (on average 155.69230769230768) internal successors, (2024), 13 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:26,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:28:26,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 472 [2023-08-03 21:28:26,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:28:28,359 INFO L124 PetriNetUnfolderBase]: 13747/21893 cut-off events. [2023-08-03 21:28:28,359 INFO L125 PetriNetUnfolderBase]: For 4310/4310 co-relation queries the response was YES. [2023-08-03 21:28:28,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47465 conditions, 21893 events. 13747/21893 cut-off events. For 4310/4310 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 151448 event pairs, 2540 based on Foata normal form. 0/20472 useless extension candidates. Maximal degree in co-relation 47382. Up to 14670 conditions per place. [2023-08-03 21:28:28,531 INFO L140 encePairwiseOnDemand]: 460/472 looper letters, 164 selfloop transitions, 23 changer transitions 26/222 dead transitions. [2023-08-03 21:28:28,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 222 transitions, 1126 flow [2023-08-03 21:28:28,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-03 21:28:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-03 21:28:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1268 transitions. [2023-08-03 21:28:28,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3837772397094431 [2023-08-03 21:28:28,536 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1268 transitions. [2023-08-03 21:28:28,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1268 transitions. [2023-08-03 21:28:28,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:28:28,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1268 transitions. [2023-08-03 21:28:28,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 181.14285714285714) internal successors, (1268), 7 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:28,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 472.0) internal successors, (3776), 8 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:28,543 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 472.0) internal successors, (3776), 8 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:28,543 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 364 flow. Second operand 7 states and 1268 transitions. [2023-08-03 21:28:28,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 222 transitions, 1126 flow [2023-08-03 21:28:28,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 222 transitions, 1078 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-03 21:28:28,560 INFO L231 Difference]: Finished difference. Result has 109 places, 103 transitions, 454 flow [2023-08-03 21:28:28,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=454, PETRI_PLACES=109, PETRI_TRANSITIONS=103} [2023-08-03 21:28:28,561 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 41 predicate places. [2023-08-03 21:28:28,561 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 103 transitions, 454 flow [2023-08-03 21:28:28,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 155.69230769230768) internal successors, (2024), 13 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:28,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:28:28,562 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:28:28,567 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-03 21:28:28,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-03 21:28:28,767 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-03 21:28:28,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:28:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash 197451237, now seen corresponding path program 1 times [2023-08-03 21:28:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:28:28,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275316990] [2023-08-03 21:28:28,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:28:28,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:28:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:28:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:28:28,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:28:28,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275316990] [2023-08-03 21:28:28,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275316990] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:28:28,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694051454] [2023-08-03 21:28:28,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:28:28,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:28:28,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:28:28,845 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-03 21:28:28,849 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-03 21:28:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:28:28,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:28:28,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:28:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:28:28,969 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:28:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:28:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694051454] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:28:28,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:28:28,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 21:28:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005283111] [2023-08-03 21:28:28,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:28:28,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:28:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:28:28,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:28:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:28:28,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 472 [2023-08-03 21:28:29,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 103 transitions, 454 flow. Second operand has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:29,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:28:29,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 472 [2023-08-03 21:28:29,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:28:30,096 INFO L124 PetriNetUnfolderBase]: 10774/17575 cut-off events. [2023-08-03 21:28:30,096 INFO L125 PetriNetUnfolderBase]: For 7825/7825 co-relation queries the response was YES. [2023-08-03 21:28:30,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41523 conditions, 17575 events. 10774/17575 cut-off events. For 7825/7825 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 126346 event pairs, 902 based on Foata normal form. 16/16621 useless extension candidates. Maximal degree in co-relation 41459. Up to 15241 conditions per place. [2023-08-03 21:28:30,203 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 139 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2023-08-03 21:28:30,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 156 transitions, 926 flow [2023-08-03 21:28:30,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:28:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:28:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 939 transitions. [2023-08-03 21:28:30,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973516949152542 [2023-08-03 21:28:30,206 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 939 transitions. [2023-08-03 21:28:30,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 939 transitions. [2023-08-03 21:28:30,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:28:30,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 939 transitions. [2023-08-03 21:28:30,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 234.75) internal successors, (939), 4 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:30,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 472.0) internal successors, (2360), 5 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:30,211 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 472.0) internal successors, (2360), 5 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:30,211 INFO L175 Difference]: Start difference. First operand has 109 places, 103 transitions, 454 flow. Second operand 4 states and 939 transitions. [2023-08-03 21:28:30,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 156 transitions, 926 flow [2023-08-03 21:28:30,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 156 transitions, 926 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:28:30,229 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 476 flow [2023-08-03 21:28:30,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=476, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2023-08-03 21:28:30,230 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 46 predicate places. [2023-08-03 21:28:30,230 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 476 flow [2023-08-03 21:28:30,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:30,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:28:30,230 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-03 21:28:30,239 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-03 21:28:30,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-03 21:28:30,435 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-03 21:28:30,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:28:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash -157552559, now seen corresponding path program 1 times [2023-08-03 21:28:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:28:30,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263716353] [2023-08-03 21:28:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:28:30,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:28:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:28:30,559 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-03 21:28:30,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:28:30,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263716353] [2023-08-03 21:28:30,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263716353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:28:30,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:28:30,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:28:30,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374442456] [2023-08-03 21:28:30,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:28:30,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:28:30,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:28:30,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:28:30,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:28:30,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 472 [2023-08-03 21:28:30,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 476 flow. Second operand has 5 states, 5 states have (on average 192.4) internal successors, (962), 5 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:30,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:28:30,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 472 [2023-08-03 21:28:30,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:28:31,602 INFO L124 PetriNetUnfolderBase]: 6688/12553 cut-off events. [2023-08-03 21:28:31,602 INFO L125 PetriNetUnfolderBase]: For 9380/9392 co-relation queries the response was YES. [2023-08-03 21:28:31,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31456 conditions, 12553 events. 6688/12553 cut-off events. For 9380/9392 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 99067 event pairs, 2257 based on Foata normal form. 2015/13421 useless extension candidates. Maximal degree in co-relation 31390. Up to 5560 conditions per place. [2023-08-03 21:28:31,708 INFO L140 encePairwiseOnDemand]: 450/472 looper letters, 162 selfloop transitions, 31 changer transitions 3/206 dead transitions. [2023-08-03 21:28:31,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 206 transitions, 1316 flow [2023-08-03 21:28:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:28:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:28:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1098 transitions. [2023-08-03 21:28:31,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652542372881356 [2023-08-03 21:28:31,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1098 transitions. [2023-08-03 21:28:31,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1098 transitions. [2023-08-03 21:28:31,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:28:31,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1098 transitions. [2023-08-03 21:28:31,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:31,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 472.0) internal successors, (2832), 6 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:31,718 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 472.0) internal successors, (2832), 6 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:31,718 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 476 flow. Second operand 5 states and 1098 transitions. [2023-08-03 21:28:31,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 206 transitions, 1316 flow [2023-08-03 21:28:31,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 206 transitions, 1307 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-03 21:28:31,747 INFO L231 Difference]: Finished difference. Result has 118 places, 125 transitions, 635 flow [2023-08-03 21:28:31,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=635, PETRI_PLACES=118, PETRI_TRANSITIONS=125} [2023-08-03 21:28:31,748 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 50 predicate places. [2023-08-03 21:28:31,748 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 125 transitions, 635 flow [2023-08-03 21:28:31,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.4) internal successors, (962), 5 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:28:31,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:28:31,749 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-03 21:28:31,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-03 21:28:31,749 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-03 21:28:31,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:28:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1329455216, now seen corresponding path program 1 times [2023-08-03 21:28:31,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:28:31,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447155113] [2023-08-03 21:28:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:28:31,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:28:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:28:32,308 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-03 21:28:32,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:28:32,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447155113] [2023-08-03 21:28:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447155113] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:28:32,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968739035] [2023-08-03 21:28:32,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:28:32,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:28:32,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:28:32,310 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-03 21:28:32,336 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-03 21:28:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:28:32,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 21:28:32,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:28:32,441 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-03 21:28:32,509 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:28:32,509 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-03 21:28:32,531 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-03 21:28:32,556 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-03 21:28:32,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 21:28:32,636 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:28:32,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-03 21:28:32,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 21:28:32,755 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-03 21:28:32,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:28:32,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-03 21:28:32,845 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-03 21:28:42,895 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_111| Int) (v_ArrVal_573 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_109| Int) (v_ArrVal_570 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_111| |v_t_funThread2of2ForFork0_~p~0#1.offset_109|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_570) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_109| v_ArrVal_573) |v_t_funThread1of2ForFork0_~p~0#1.offset_111|) 0))) is different from false [2023-08-03 21:28:43,040 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-03 21:28:43,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968739035] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:28:43,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:28:43,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-03 21:28:43,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408316345] [2023-08-03 21:28:43,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:28:43,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-03 21:28:43,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:28:43,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-03 21:28:43,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=4, NotChecked=34, Total=380 [2023-08-03 21:28:45,046 WARN L539 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-03 21:28:47,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:28:49,056 WARN L539 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-03 21:28:51,058 WARN L539 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-03 21:28:53,063 WARN L539 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-03 21:28:55,070 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-03 21:28:57,073 WARN L539 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-03 21:28:59,083 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-03 21:29:01,095 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-03 21:29:03,098 WARN L539 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-03 21:29:05,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:07,104 WARN L539 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-03 21:29:09,107 WARN L539 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-03 21:29:11,114 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-03 21:29:13,116 WARN L539 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-03 21:29:15,119 WARN L539 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-03 21:29:17,126 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-03 21:29:19,130 WARN L539 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-03 21:29:21,145 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-03 21:29:23,148 WARN L539 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-03 21:29:25,150 WARN L539 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-03 21:29:27,152 WARN L539 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-03 21:29:29,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:31,160 WARN L539 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-03 21:29:33,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:35,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:37,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:39,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:29:41,181 WARN L539 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-03 21:29:43,194 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-03 21:29:45,199 WARN L539 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-03 21:29:47,205 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-03 21:29:49,216 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-03 21:29:51,227 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-03 21:29:53,235 WARN L539 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-03 21:29:55,242 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-03 21:29:57,246 WARN L539 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-03 21:29:59,259 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-03 21:30:01,267 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-03 21:30:03,270 WARN L539 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-03 21:30:05,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:30:07,282 WARN L539 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-03 21:30:09,290 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-03 21:30:11,296 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-03 21:30:13,299 WARN L539 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-03 21:30:15,302 WARN L539 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-03 21:30:17,304 WARN L539 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-03 21:30:19,317 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-03 21:30:21,320 WARN L539 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-03 21:30:23,332 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-03 21:30:25,342 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-03 21:30:27,347 WARN L539 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-03 21:30:29,360 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-03 21:30:31,367 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-03 21:30:33,374 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-03 21:30:35,376 WARN L539 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-03 21:30:37,384 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-03 21:30:39,387 WARN L539 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-03 21:30:41,398 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-03 21:30:43,405 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-03 21:30:45,412 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-03 21:30:47,415 WARN L539 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-03 21:30:49,417 WARN L539 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-03 21:30:49,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 472 [2023-08-03 21:30:49,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 125 transitions, 635 flow. Second operand has 20 states, 20 states have (on average 153.65) internal successors, (3073), 20 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:49,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:49,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 472 [2023-08-03 21:30:49,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:30:52,107 INFO L124 PetriNetUnfolderBase]: 11037/20214 cut-off events. [2023-08-03 21:30:52,108 INFO L125 PetriNetUnfolderBase]: For 18220/18260 co-relation queries the response was YES. [2023-08-03 21:30:52,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59900 conditions, 20214 events. 11037/20214 cut-off events. For 18220/18260 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 166033 event pairs, 2532 based on Foata normal form. 60/18384 useless extension candidates. Maximal degree in co-relation 59831. Up to 9185 conditions per place. [2023-08-03 21:30:52,304 INFO L140 encePairwiseOnDemand]: 452/472 looper letters, 385 selfloop transitions, 79 changer transitions 67/540 dead transitions. [2023-08-03 21:30:52,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 540 transitions, 3450 flow [2023-08-03 21:30:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-03 21:30:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-03 21:30:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2994 transitions. [2023-08-03 21:30:52,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37313060817547355 [2023-08-03 21:30:52,311 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2994 transitions. [2023-08-03 21:30:52,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2994 transitions. [2023-08-03 21:30:52,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:30:52,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2994 transitions. [2023-08-03 21:30:52,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 176.11764705882354) internal successors, (2994), 17 states have internal predecessors, (2994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:52,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 472.0) internal successors, (8496), 18 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:52,331 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 472.0) internal successors, (8496), 18 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:52,331 INFO L175 Difference]: Start difference. First operand has 118 places, 125 transitions, 635 flow. Second operand 17 states and 2994 transitions. [2023-08-03 21:30:52,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 540 transitions, 3450 flow [2023-08-03 21:30:52,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 540 transitions, 3449 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:30:52,391 INFO L231 Difference]: Finished difference. Result has 142 places, 184 transitions, 1360 flow [2023-08-03 21:30:52,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1360, PETRI_PLACES=142, PETRI_TRANSITIONS=184} [2023-08-03 21:30:52,392 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 74 predicate places. [2023-08-03 21:30:52,392 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 184 transitions, 1360 flow [2023-08-03 21:30:52,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 153.65) internal successors, (3073), 20 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:52,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:30:52,393 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-03 21:30:52,405 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-03 21:30:52,605 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,SelfDestructingSolverStorable16 [2023-08-03 21:30:52,605 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-03 21:30:52,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:30:52,606 INFO L85 PathProgramCache]: Analyzing trace with hash -665226550, now seen corresponding path program 2 times [2023-08-03 21:30:52,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:30:52,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360915807] [2023-08-03 21:30:52,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:30:52,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:30:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:30:53,137 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-03 21:30:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:30:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360915807] [2023-08-03 21:30:53,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360915807] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:30:53,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305509771] [2023-08-03 21:30:53,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:30:53,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:30:53,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:30:53,140 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-03 21:30:53,141 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-03 21:30:53,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:30:53,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:30:53,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 21:30:53,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:30:53,284 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-03 21:30:53,369 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:30:53,369 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-03 21:30:53,389 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-03 21:30:53,414 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-03 21:30:53,443 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 21:30:53,482 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:30:53,483 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-03 21:30:53,538 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 21:30:53,570 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-03 21:30:53,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:30:53,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-03 21:30:53,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-03 21:30:57,696 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_111| Int) (v_ArrVal_659 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_113| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_113| |v_t_funThread2of2ForFork0_~p~0#1.offset_111|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_655) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_111| v_ArrVal_659) |v_t_funThread1of2ForFork0_~p~0#1.offset_113|) 0))) is different from false [2023-08-03 21:30:57,822 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-03 21:30:57,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305509771] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:30:57,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:30:57,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-03 21:30:57,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330637686] [2023-08-03 21:30:57,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:30:57,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-03 21:30:57,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:30:57,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-03 21:30:57,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=278, Unknown=2, NotChecked=34, Total=380 [2023-08-03 21:30:57,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 472 [2023-08-03 21:30:57,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 184 transitions, 1360 flow. Second operand has 20 states, 20 states have (on average 153.65) internal successors, (3073), 20 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:30:57,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:30:57,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 472 [2023-08-03 21:30:57,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:31:03,179 INFO L124 PetriNetUnfolderBase]: 14857/27592 cut-off events. [2023-08-03 21:31:03,179 INFO L125 PetriNetUnfolderBase]: For 68177/68264 co-relation queries the response was YES. [2023-08-03 21:31:03,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97683 conditions, 27592 events. 14857/27592 cut-off events. For 68177/68264 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 244582 event pairs, 2785 based on Foata normal form. 106/25188 useless extension candidates. Maximal degree in co-relation 97604. Up to 10897 conditions per place. [2023-08-03 21:31:03,415 INFO L140 encePairwiseOnDemand]: 452/472 looper letters, 387 selfloop transitions, 121 changer transitions 160/677 dead transitions. [2023-08-03 21:31:03,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 677 transitions, 5400 flow [2023-08-03 21:31:03,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-03 21:31:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-03 21:31:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3684 transitions. [2023-08-03 21:31:03,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37167070217917675 [2023-08-03 21:31:03,422 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3684 transitions. [2023-08-03 21:31:03,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3684 transitions. [2023-08-03 21:31:03,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:31:03,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3684 transitions. [2023-08-03 21:31:03,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 175.42857142857142) internal successors, (3684), 21 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:03,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 472.0) internal successors, (10384), 22 states have internal predecessors, (10384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:03,439 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 472.0) internal successors, (10384), 22 states have internal predecessors, (10384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:03,439 INFO L175 Difference]: Start difference. First operand has 142 places, 184 transitions, 1360 flow. Second operand 21 states and 3684 transitions. [2023-08-03 21:31:03,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 677 transitions, 5400 flow [2023-08-03 21:31:03,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 677 transitions, 5289 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-03 21:31:03,798 INFO L231 Difference]: Finished difference. Result has 171 places, 237 transitions, 2284 flow [2023-08-03 21:31:03,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2284, PETRI_PLACES=171, PETRI_TRANSITIONS=237} [2023-08-03 21:31:03,799 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 103 predicate places. [2023-08-03 21:31:03,799 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 237 transitions, 2284 flow [2023-08-03 21:31:03,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 153.65) internal successors, (3073), 20 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:03,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:31:03,800 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-03 21:31:03,806 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-03 21:31:04,005 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,SelfDestructingSolverStorable17 [2023-08-03 21:31:04,006 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-03 21:31:04,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:31:04,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1972035266, now seen corresponding path program 1 times [2023-08-03 21:31:04,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:31:04,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474644083] [2023-08-03 21:31:04,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:31:04,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:31:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:31:04,546 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-03 21:31:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:31:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474644083] [2023-08-03 21:31:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474644083] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:31:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215863262] [2023-08-03 21:31:04,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:31:04,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:31:04,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:31:04,549 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-03 21:31:04,572 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-03 21:31:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:31:04,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-03 21:31:04,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:31:04,675 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-03 21:31:04,764 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:31:04,765 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-03 21:31:04,779 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-03 21:31:04,807 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:31:04,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 21:31:04,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:31:04,868 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:31:04,889 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 21:31:04,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:31:04,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:31:04,961 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:31:04,962 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-03 21:31:04,999 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-03 21:31:05,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:31:05,035 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_113| Int) (v_ArrVal_746 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_113|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_746) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_113|)) 0)))) is different from false [2023-08-03 21:31:05,093 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:31:05,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-03 21:31:05,102 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:31:05,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-03 21:31:05,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 21:31:19,231 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_113| Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_744 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_115| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_115| v_ArrVal_744) |v_t_funThread2of2ForFork0_~p~0#1.offset_113|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_115| |v_t_funThread2of2ForFork0_~p~0#1.offset_113|)))) is different from false [2023-08-03 21:31:21,409 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-03 21:31:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215863262] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:31:21,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:31:21,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-08-03 21:31:21,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533317982] [2023-08-03 21:31:21,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:31:21,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-03 21:31:21,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:31:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-03 21:31:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=311, Unknown=5, NotChecked=78, Total=506 [2023-08-03 21:31:21,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 472 [2023-08-03 21:31:21,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 237 transitions, 2284 flow. Second operand has 23 states, 23 states have (on average 151.2173913043478) internal successors, (3478), 23 states have internal predecessors, (3478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:21,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:31:21,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 472 [2023-08-03 21:31:21,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:31:23,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:31:25,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:31:28,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:31:30,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:31:35,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:31:38,668 INFO L124 PetriNetUnfolderBase]: 17232/32010 cut-off events. [2023-08-03 21:31:38,668 INFO L125 PetriNetUnfolderBase]: For 166791/166929 co-relation queries the response was YES. [2023-08-03 21:31:38,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131737 conditions, 32010 events. 17232/32010 cut-off events. For 166791/166929 co-relation queries the response was YES. Maximal size of possible extension queue 1228. Compared 289615 event pairs, 2952 based on Foata normal form. 59/29140 useless extension candidates. Maximal degree in co-relation 131644. Up to 15946 conditions per place. [2023-08-03 21:31:39,045 INFO L140 encePairwiseOnDemand]: 449/472 looper letters, 447 selfloop transitions, 209 changer transitions 172/837 dead transitions. [2023-08-03 21:31:39,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 837 transitions, 8031 flow [2023-08-03 21:31:39,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-03 21:31:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-03 21:31:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4613 transitions. [2023-08-03 21:31:39,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619742623979912 [2023-08-03 21:31:39,050 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4613 transitions. [2023-08-03 21:31:39,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4613 transitions. [2023-08-03 21:31:39,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:31:39,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4613 transitions. [2023-08-03 21:31:39,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 170.85185185185185) internal successors, (4613), 27 states have internal predecessors, (4613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:39,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 472.0) internal successors, (13216), 28 states have internal predecessors, (13216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:39,066 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 472.0) internal successors, (13216), 28 states have internal predecessors, (13216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:39,066 INFO L175 Difference]: Start difference. First operand has 171 places, 237 transitions, 2284 flow. Second operand 27 states and 4613 transitions. [2023-08-03 21:31:39,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 837 transitions, 8031 flow [2023-08-03 21:31:40,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 837 transitions, 7911 flow, removed 46 selfloop flow, removed 2 redundant places. [2023-08-03 21:31:40,318 INFO L231 Difference]: Finished difference. Result has 208 places, 367 transitions, 4298 flow [2023-08-03 21:31:40,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=2176, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4298, PETRI_PLACES=208, PETRI_TRANSITIONS=367} [2023-08-03 21:31:40,319 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 140 predicate places. [2023-08-03 21:31:40,319 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 367 transitions, 4298 flow [2023-08-03 21:31:40,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 151.2173913043478) internal successors, (3478), 23 states have internal predecessors, (3478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:40,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:31:40,319 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-03 21:31:40,324 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-03 21:31:40,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:31:40,520 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-03 21:31:40,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:31:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash 583455934, now seen corresponding path program 2 times [2023-08-03 21:31:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:31:40,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267189242] [2023-08-03 21:31:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:31:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:31:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:31:40,970 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-03 21:31:40,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:31:40,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267189242] [2023-08-03 21:31:40,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267189242] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:31:40,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633184793] [2023-08-03 21:31:40,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:31:40,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:31:40,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:31:40,972 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-03 21:31:41,003 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-03 21:31:41,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:31:41,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:31:41,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 21:31:41,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:31:41,138 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-03 21:31:41,246 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:31:41,249 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-03 21:31:41,272 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-03 21:31:41,306 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:31:41,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 21:31:41,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:31:41,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:31:41,432 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:31:41,432 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-03 21:31:41,461 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 21:31:41,501 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-03 21:31:41,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:31:41,568 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 Int) (v_ArrVal_830 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_115| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_832)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_115|)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_830) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_115|)) 0)))) is different from false [2023-08-03 21:31:41,587 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:31:41,588 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-03 21:31:41,596 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:31:41,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-03 21:31:41,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 21:31:53,927 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-03 21:31:53,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633184793] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:31:53,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:31:53,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2023-08-03 21:31:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302668065] [2023-08-03 21:31:53,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:31:53,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-03 21:31:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:31:53,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-03 21:31:53,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=274, Unknown=5, NotChecked=34, Total=380 [2023-08-03 21:31:54,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 472 [2023-08-03 21:31:54,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 367 transitions, 4298 flow. Second operand has 20 states, 20 states have (on average 153.5) internal successors, (3070), 20 states have internal predecessors, (3070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:31:54,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:31:54,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 472 [2023-08-03 21:31:54,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:32:00,218 WARN L539 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-03 21:32:04,247 INFO L124 PetriNetUnfolderBase]: 19704/37090 cut-off events. [2023-08-03 21:32:04,247 INFO L125 PetriNetUnfolderBase]: For 289528/289680 co-relation queries the response was YES. [2023-08-03 21:32:04,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171613 conditions, 37090 events. 19704/37090 cut-off events. For 289528/289680 co-relation queries the response was YES. Maximal size of possible extension queue 1525. Compared 350024 event pairs, 4371 based on Foata normal form. 107/33811 useless extension candidates. Maximal degree in co-relation 171506. Up to 18652 conditions per place. [2023-08-03 21:32:04,757 INFO L140 encePairwiseOnDemand]: 453/472 looper letters, 552 selfloop transitions, 174 changer transitions 170/905 dead transitions. [2023-08-03 21:32:04,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 905 transitions, 10711 flow [2023-08-03 21:32:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-03 21:32:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-03 21:32:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3683 transitions. [2023-08-03 21:32:04,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37156981436642456 [2023-08-03 21:32:04,902 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3683 transitions. [2023-08-03 21:32:04,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3683 transitions. [2023-08-03 21:32:04,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:32:04,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3683 transitions. [2023-08-03 21:32:04,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 175.38095238095238) internal successors, (3683), 21 states have internal predecessors, (3683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:04,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 472.0) internal successors, (10384), 22 states have internal predecessors, (10384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:04,923 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 472.0) internal successors, (10384), 22 states have internal predecessors, (10384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:04,923 INFO L175 Difference]: Start difference. First operand has 208 places, 367 transitions, 4298 flow. Second operand 21 states and 3683 transitions. [2023-08-03 21:32:04,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 905 transitions, 10711 flow [2023-08-03 21:32:08,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 905 transitions, 9687 flow, removed 441 selfloop flow, removed 5 redundant places. [2023-08-03 21:32:08,197 INFO L231 Difference]: Finished difference. Result has 232 places, 415 transitions, 4957 flow [2023-08-03 21:32:08,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=3826, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4957, PETRI_PLACES=232, PETRI_TRANSITIONS=415} [2023-08-03 21:32:08,198 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 164 predicate places. [2023-08-03 21:32:08,198 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 415 transitions, 4957 flow [2023-08-03 21:32:08,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 153.5) internal successors, (3070), 20 states have internal predecessors, (3070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:08,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:32:08,198 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-03 21:32:08,205 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-03 21:32:08,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:32:08,399 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-03 21:32:08,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:32:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash 348077058, now seen corresponding path program 3 times [2023-08-03 21:32:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:32:08,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344493658] [2023-08-03 21:32:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:32:08,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:32:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:32:08,706 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-03 21:32:08,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:32:08,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344493658] [2023-08-03 21:32:08,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344493658] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:32:08,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137906110] [2023-08-03 21:32:08,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:32:08,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:32:08,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:32:08,709 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-03 21:32:08,717 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-03 21:32:08,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-03 21:32:08,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:32:08,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 21:32:08,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:32:08,854 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-03 21:32:08,911 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:32:08,911 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-03 21:32:08,931 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-03 21:32:08,957 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-03 21:32:08,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 21:32:09,028 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:32:09,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-03 21:32:09,081 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 21:32:09,117 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-03 21:32:09,118 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:32:09,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-03 21:32:09,194 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-03 21:32:11,363 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-03 21:32:11,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137906110] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:32:11,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:32:11,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-03 21:32:11,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253435589] [2023-08-03 21:32:11,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:32:11,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 21:32:11,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:32:11,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 21:32:11,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=213, Unknown=1, NotChecked=0, Total=272 [2023-08-03 21:32:13,400 WARN L539 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-03 21:32:15,549 WARN L539 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-03 21:32:17,596 WARN L539 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-03 21:32:19,664 WARN L539 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-03 21:32:21,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:24,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:26,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:28,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:30,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:32,342 WARN L539 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-03 21:32:34,499 WARN L539 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-03 21:32:36,552 WARN L539 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-03 21:32:38,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:40,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:42,666 WARN L539 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-03 21:32:44,746 WARN L539 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-03 21:32:46,789 WARN L539 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-03 21:32:48,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:32:50,886 WARN L539 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-03 21:32:52,924 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-03 21:32:54,998 WARN L539 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-03 21:32:54,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 472 [2023-08-03 21:32:55,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 415 transitions, 4957 flow. Second operand has 17 states, 17 states have (on average 154.8235294117647) internal successors, (2632), 17 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:32:55,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:32:55,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 472 [2023-08-03 21:32:55,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:02,225 INFO L124 PetriNetUnfolderBase]: 20352/38557 cut-off events. [2023-08-03 21:33:02,225 INFO L125 PetriNetUnfolderBase]: For 316778/316934 co-relation queries the response was YES. [2023-08-03 21:33:02,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179217 conditions, 38557 events. 20352/38557 cut-off events. For 316778/316934 co-relation queries the response was YES. Maximal size of possible extension queue 1634. Compared 368318 event pairs, 5115 based on Foata normal form. 61/35160 useless extension candidates. Maximal degree in co-relation 179101. Up to 22217 conditions per place. [2023-08-03 21:33:02,849 INFO L140 encePairwiseOnDemand]: 452/472 looper letters, 504 selfloop transitions, 136 changer transitions 144/793 dead transitions. [2023-08-03 21:33:02,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 793 transitions, 9392 flow [2023-08-03 21:33:02,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-03 21:33:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-03 21:33:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2994 transitions. [2023-08-03 21:33:02,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37313060817547355 [2023-08-03 21:33:02,853 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2994 transitions. [2023-08-03 21:33:02,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2994 transitions. [2023-08-03 21:33:02,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:02,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2994 transitions. [2023-08-03 21:33:02,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 176.11764705882354) internal successors, (2994), 17 states have internal predecessors, (2994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:02,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 472.0) internal successors, (8496), 18 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:02,863 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 472.0) internal successors, (8496), 18 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:02,863 INFO L175 Difference]: Start difference. First operand has 232 places, 415 transitions, 4957 flow. Second operand 17 states and 2994 transitions. [2023-08-03 21:33:02,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 793 transitions, 9392 flow [2023-08-03 21:33:06,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 793 transitions, 9192 flow, removed 60 selfloop flow, removed 7 redundant places. [2023-08-03 21:33:06,572 INFO L231 Difference]: Finished difference. Result has 242 places, 423 transitions, 5291 flow [2023-08-03 21:33:06,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=4783, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5291, PETRI_PLACES=242, PETRI_TRANSITIONS=423} [2023-08-03 21:33:06,572 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 174 predicate places. [2023-08-03 21:33:06,572 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 423 transitions, 5291 flow [2023-08-03 21:33:06,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 154.8235294117647) internal successors, (2632), 17 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:06,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:06,573 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-03 21:33:06,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-03 21:33:06,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:06,773 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:06,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1059432720, now seen corresponding path program 3 times [2023-08-03 21:33:06,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:06,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136486773] [2023-08-03 21:33:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:07,346 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-03 21:33:07,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:07,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136486773] [2023-08-03 21:33:07,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136486773] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:33:07,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332101386] [2023-08-03 21:33:07,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:33:07,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:07,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:33:07,348 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-03 21:33:07,349 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-03 21:33:07,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-03 21:33:07,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:33:07,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-03 21:33:07,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:33:07,474 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-03 21:33:07,553 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:33:07,553 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-03 21:33:07,576 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-03 21:33:07,599 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-03 21:33:07,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 21:33:07,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:07,677 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:33:07,703 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 21:33:07,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:07,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:33:07,775 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:33:07,776 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-03 21:33:07,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-03 21:33:07,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:33:07,847 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_121| Int) (v_ArrVal_1004 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_121|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1004) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_121|)) 0)))) is different from false [2023-08-03 21:33:07,856 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_121| Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1004) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_121|)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1003)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_121|) 0))) is different from false [2023-08-03 21:33:07,889 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:33:07,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-03 21:33:07,898 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:33:07,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-03 21:33:07,903 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 21:33:16,006 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_121| Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_1003 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_119| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_119| v_ArrVal_1003) |v_t_funThread1of2ForFork0_~p~0#1.offset_121|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_121| |v_t_funThread2of2ForFork0_~p~0#1.offset_119|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 21:33:18,579 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-03 21:33:18,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332101386] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:33:18,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:33:18,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-03 21:33:18,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528849765] [2023-08-03 21:33:18,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:33:18,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-03 21:33:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:18,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-03 21:33:18,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=252, Unknown=4, NotChecked=108, Total=462 [2023-08-03 21:33:18,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 472 [2023-08-03 21:33:18,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 423 transitions, 5291 flow. Second operand has 22 states, 22 states have (on average 153.3181818181818) internal successors, (3373), 22 states have internal predecessors, (3373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:18,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:18,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 472 [2023-08-03 21:33:18,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:21,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:33:23,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:33:25,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:33:27,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:33:34,930 INFO L124 PetriNetUnfolderBase]: 20841/39524 cut-off events. [2023-08-03 21:33:34,930 INFO L125 PetriNetUnfolderBase]: For 351208/351358 co-relation queries the response was YES. [2023-08-03 21:33:35,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185511 conditions, 39524 events. 20841/39524 cut-off events. For 351208/351358 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 380168 event pairs, 4245 based on Foata normal form. 13/36071 useless extension candidates. Maximal degree in co-relation 185390. Up to 23702 conditions per place. [2023-08-03 21:33:35,851 INFO L140 encePairwiseOnDemand]: 456/472 looper letters, 506 selfloop transitions, 174 changer transitions 148/837 dead transitions. [2023-08-03 21:33:35,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 837 transitions, 10159 flow [2023-08-03 21:33:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-03 21:33:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-03 21:33:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3315 transitions. [2023-08-03 21:33:35,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36964763603925066 [2023-08-03 21:33:35,869 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3315 transitions. [2023-08-03 21:33:35,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3315 transitions. [2023-08-03 21:33:35,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:35,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3315 transitions. [2023-08-03 21:33:35,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 174.47368421052633) internal successors, (3315), 19 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:35,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 472.0) internal successors, (9440), 20 states have internal predecessors, (9440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:35,914 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 472.0) internal successors, (9440), 20 states have internal predecessors, (9440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:35,914 INFO L175 Difference]: Start difference. First operand has 242 places, 423 transitions, 5291 flow. Second operand 19 states and 3315 transitions. [2023-08-03 21:33:35,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 837 transitions, 10159 flow [2023-08-03 21:33:40,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 837 transitions, 9889 flow, removed 27 selfloop flow, removed 9 redundant places. [2023-08-03 21:33:40,425 INFO L231 Difference]: Finished difference. Result has 254 places, 463 transitions, 6133 flow [2023-08-03 21:33:40,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=5030, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6133, PETRI_PLACES=254, PETRI_TRANSITIONS=463} [2023-08-03 21:33:40,425 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 186 predicate places. [2023-08-03 21:33:40,425 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 463 transitions, 6133 flow [2023-08-03 21:33:40,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 153.3181818181818) internal successors, (3373), 22 states have internal predecessors, (3373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:33:40,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:40,426 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-03 21:33:40,430 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-03 21:33:40,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-03 21:33:40,627 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-03 21:33:40,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:40,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2133166388, now seen corresponding path program 4 times [2023-08-03 21:33:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:40,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220932403] [2023-08-03 21:33:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:40,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:34:09,836 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-03 21:34:09,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:34:09,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220932403] [2023-08-03 21:34:09,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220932403] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:34:09,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565118163] [2023-08-03 21:34:09,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 21:34:09,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:34:09,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:34:09,842 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-03 21:34:09,844 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-03 21:34:09,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 21:34:09,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:34:09,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-03 21:34:09,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:34:09,971 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-03 21:34:10,095 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:34:10,095 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-03 21:34:10,132 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-03 21:34:10,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 21:34:10,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:34:10,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:34:10,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 21:34:10,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:34:10,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:34:10,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:34:10,439 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:34:10,440 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-03 21:34:10,484 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-03 21:34:10,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:34:10,769 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:34:10,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-03 21:34:10,777 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:34:10,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-03 21:34:10,781 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-03 21:34:10,800 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_123| Int) (v_ArrVal_1091 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_121| Int) (v_ArrVal_1088 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_123| v_ArrVal_1088)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1091) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_121|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_123| Int) (v_ArrVal_1091 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_121| Int) (v_ArrVal_1088 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_123| |v_t_funThread2of2ForFork0_~p~0#1.offset_121|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_123| v_ArrVal_1088)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1091) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_121|) 0))))) is different from false [2023-08-03 21:34:10,825 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_123| Int) (v_ArrVal_1091 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_121| Int) (v_ArrVal_1088 Int) (v_ArrVal_1084 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_123| |v_t_funThread2of2ForFork0_~p~0#1.offset_121|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1084))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_123| v_ArrVal_1088))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1091) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_121|) 0))) (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_123| Int) (v_ArrVal_1091 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_121| Int) (v_ArrVal_1088 Int) (v_ArrVal_1084 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1084))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_123| v_ArrVal_1088))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1091) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_121|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-03 21:34:18,936 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:34:19,087 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-03 21:34:19,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565118163] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:34:19,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:34:19,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 8] total 33 [2023-08-03 21:34:19,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868312681] [2023-08-03 21:34:19,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:34:19,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-03 21:34:19,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:34:19,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-03 21:34:19,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=865, Unknown=7, NotChecked=126, Total=1190 [2023-08-03 21:34:19,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 472 [2023-08-03 21:34:19,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 463 transitions, 6133 flow. Second operand has 35 states, 35 states have (on average 140.71428571428572) internal successors, (4925), 35 states have internal predecessors, (4925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:19,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:34:19,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 472 [2023-08-03 21:34:19,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:34:22,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:34:24,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:34:26,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:34:26,999 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1091 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_121| Int) (v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1088 Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1088)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1091) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_121|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1090) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_121|)) 0)))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_121| Int) (v_ArrVal_1091 (Array Int Int)) (v_ArrVal_1090 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1091) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_121|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1090) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_121|)) 0))))) is different from false [2023-08-03 21:34:30,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:34:32,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:34:34,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:34:42,110 WARN L539 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-03 21:34:44,808 WARN L539 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-03 21:34:46,462 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1088 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1088) (select |c_#memory_int| 4)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |t_funThread1of2ForFork0_~p~0#1.offset|)))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_121| Int) (v_ArrVal_1091 (Array Int Int)) (v_ArrVal_1090 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1091) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_121|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1090) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_121|)) 0))))) is different from false [2023-08-03 21:34:50,281 INFO L124 PetriNetUnfolderBase]: 25453/47858 cut-off events. [2023-08-03 21:34:50,281 INFO L125 PetriNetUnfolderBase]: For 528424/528572 co-relation queries the response was YES. [2023-08-03 21:34:51,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234906 conditions, 47858 events. 25453/47858 cut-off events. For 528424/528572 co-relation queries the response was YES. Maximal size of possible extension queue 2072. Compared 466533 event pairs, 4498 based on Foata normal form. 66/43409 useless extension candidates. Maximal degree in co-relation 234778. Up to 23790 conditions per place. [2023-08-03 21:34:51,110 INFO L140 encePairwiseOnDemand]: 433/472 looper letters, 692 selfloop transitions, 388 changer transitions 331/1420 dead transitions. [2023-08-03 21:34:51,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 1420 transitions, 17964 flow [2023-08-03 21:34:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-08-03 21:34:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-08-03 21:34:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 8598 transitions. [2023-08-03 21:34:51,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3252875302663438 [2023-08-03 21:34:51,120 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 8598 transitions. [2023-08-03 21:34:51,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 8598 transitions. [2023-08-03 21:34:51,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:34:51,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 8598 transitions. [2023-08-03 21:34:51,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 153.53571428571428) internal successors, (8598), 56 states have internal predecessors, (8598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:51,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 472.0) internal successors, (26904), 57 states have internal predecessors, (26904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:51,156 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 472.0) internal successors, (26904), 57 states have internal predecessors, (26904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:51,156 INFO L175 Difference]: Start difference. First operand has 254 places, 463 transitions, 6133 flow. Second operand 56 states and 8598 transitions. [2023-08-03 21:34:51,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 1420 transitions, 17964 flow [2023-08-03 21:34:57,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 1420 transitions, 17803 flow, removed 54 selfloop flow, removed 6 redundant places. [2023-08-03 21:34:57,861 INFO L231 Difference]: Finished difference. Result has 329 places, 667 transitions, 10310 flow [2023-08-03 21:34:57,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=5972, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=10310, PETRI_PLACES=329, PETRI_TRANSITIONS=667} [2023-08-03 21:34:57,861 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 261 predicate places. [2023-08-03 21:34:57,862 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 667 transitions, 10310 flow [2023-08-03 21:34:57,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 140.71428571428572) internal successors, (4925), 35 states have internal predecessors, (4925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:34:57,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:34:57,862 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-03 21:34:57,867 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-03 21:34:58,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:34:58,063 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:34:58,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:34:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash 406282950, now seen corresponding path program 1 times [2023-08-03 21:34:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:34:58,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981923726] [2023-08-03 21:34:58,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:34:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:34:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:35:12,203 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-03 21:35:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:35:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981923726] [2023-08-03 21:35:12,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981923726] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:35:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263782042] [2023-08-03 21:35:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:35:12,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:35:12,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:35:12,205 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-03 21:35:12,207 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-03 21:35:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:35:12,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-03 21:35:12,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:35:12,338 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-03 21:35:12,401 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:35:12,401 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-03 21:35:12,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 21:35:12,449 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 21:35:12,499 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-03 21:35:12,555 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 21:35:12,555 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 22 treesize of output 15 [2023-08-03 21:35:12,611 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-03 21:35:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:35:12,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:35:12,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-08-03 21:35:12,886 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 19 treesize of output 12 [2023-08-03 21:35:12,894 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1175 Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_125| Int) (v_ArrVal_1174 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1174) |c_~#a~0.base|) .cse0 v_ArrVal_1175) |v_t_funThread1of2ForFork0_~p~0#1.offset_125|)) (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_125|)))) is different from false [2023-08-03 21:35:12,912 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1175 Int) (|~#a~0.offset| Int) (v_ArrVal_1174 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_125| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1174) |c_~#a~0.base|) .cse0 v_ArrVal_1175) |v_t_funThread1of2ForFork0_~p~0#1.offset_125|)) (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_125|)))) is different from false [2023-08-03 21:35:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 4 not checked. [2023-08-03 21:35:13,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263782042] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:35:13,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:35:13,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 7] total 31 [2023-08-03 21:35:13,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820137452] [2023-08-03 21:35:13,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:35:13,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-03 21:35:13,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:35:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-03 21:35:13,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=805, Unknown=4, NotChecked=118, Total=1056 [2023-08-03 21:35:13,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 472 [2023-08-03 21:35:13,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 667 transitions, 10310 flow. Second operand has 33 states, 33 states have (on average 138.96969696969697) internal successors, (4586), 33 states have internal predecessors, (4586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:35:13,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:35:13,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 472 [2023-08-03 21:35:13,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:35:30,527 INFO L124 PetriNetUnfolderBase]: 29239/55469 cut-off events. [2023-08-03 21:35:30,527 INFO L125 PetriNetUnfolderBase]: For 945224/945399 co-relation queries the response was YES. [2023-08-03 21:35:32,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336508 conditions, 55469 events. 29239/55469 cut-off events. For 945224/945399 co-relation queries the response was YES. Maximal size of possible extension queue 2238. Compared 556648 event pairs, 7577 based on Foata normal form. 89/52412 useless extension candidates. Maximal degree in co-relation 336343. Up to 31617 conditions per place. [2023-08-03 21:35:32,173 INFO L140 encePairwiseOnDemand]: 444/472 looper letters, 862 selfloop transitions, 273 changer transitions 182/1326 dead transitions. [2023-08-03 21:35:32,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1326 transitions, 20770 flow [2023-08-03 21:35:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-03 21:35:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-03 21:35:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 6071 transitions. [2023-08-03 21:35:32,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3215572033898305 [2023-08-03 21:35:32,183 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 6071 transitions. [2023-08-03 21:35:32,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 6071 transitions. [2023-08-03 21:35:32,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:35:32,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 6071 transitions. [2023-08-03 21:35:32,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 151.775) internal successors, (6071), 40 states have internal predecessors, (6071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:35:32,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 472.0) internal successors, (19352), 41 states have internal predecessors, (19352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:35:32,206 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 472.0) internal successors, (19352), 41 states have internal predecessors, (19352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:35:32,206 INFO L175 Difference]: Start difference. First operand has 329 places, 667 transitions, 10310 flow. Second operand 40 states and 6071 transitions. [2023-08-03 21:35:32,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 1326 transitions, 20770 flow [2023-08-03 21:35:45,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 1326 transitions, 19858 flow, removed 327 selfloop flow, removed 29 redundant places. [2023-08-03 21:35:45,803 INFO L231 Difference]: Finished difference. Result has 349 places, 804 transitions, 13048 flow [2023-08-03 21:35:45,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=9535, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=13048, PETRI_PLACES=349, PETRI_TRANSITIONS=804} [2023-08-03 21:35:45,804 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 281 predicate places. [2023-08-03 21:35:45,805 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 804 transitions, 13048 flow [2023-08-03 21:35:45,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 138.96969696969697) internal successors, (4586), 33 states have internal predecessors, (4586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:35:45,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:35:45,806 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-03 21:35:45,810 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-03 21:35:46,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:35:46,006 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-03 21:35:46,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:35:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash -351270352, now seen corresponding path program 1 times [2023-08-03 21:35:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:35:46,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941387349] [2023-08-03 21:35:46,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:35:46,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:35:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:35:46,457 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-03 21:35:46,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:35:46,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941387349] [2023-08-03 21:35:46,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941387349] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:35:46,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411360080] [2023-08-03 21:35:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:35:46,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:35:46,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:35:46,459 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-03 21:35:46,487 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-03 21:35:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:35:46,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 21:35:46,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:35:46,618 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-03 21:35:46,690 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:35:46,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 21:35:46,711 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-03 21:35:46,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 21:35:46,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:35:46,778 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:35:46,819 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-03 21:35:46,890 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 21:35:46,890 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 22 treesize of output 15 [2023-08-03 21:35:46,923 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 21:35:46,971 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-03 21:35:46,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:35:47,110 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1261 Int) (v_ArrVal_1259 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1260 (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_1259) |c_~#a~0.base|) (+ .cse0 4 |~#a~0.offset|)) 0)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1260))) (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1261))) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|)) 0)))) is different from false [2023-08-03 21:35:47,135 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:35:47,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-03 21:35:47,144 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:35:47,145 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 45 treesize of output 42 [2023-08-03 21:35:47,149 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-03 21:35:47,172 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1261 Int) (|~#a~0.offset| Int) (v_ArrVal_1260 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_127| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1260) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_127| v_ArrVal_1261) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1261 Int) (|~#a~0.offset| Int) (v_ArrVal_1260 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_127| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_127|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1260) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_127| v_ArrVal_1261) .cse0) 0))))) is different from false [2023-08-03 21:35:49,435 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-03 21:35:49,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411360080] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:35:49,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:35:49,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-08-03 21:35:49,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465731144] [2023-08-03 21:35:49,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:35:49,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-03 21:35:49,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:35:49,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-03 21:35:49,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=329, Unknown=3, NotChecked=78, Total=506 [2023-08-03 21:35:49,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 472 [2023-08-03 21:35:49,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 804 transitions, 13048 flow. Second operand has 23 states, 23 states have (on average 149.34782608695653) internal successors, (3435), 23 states have internal predecessors, (3435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:35:49,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:35:49,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 472 [2023-08-03 21:35:49,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:35:53,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:36:18,457 INFO L124 PetriNetUnfolderBase]: 42224/81735 cut-off events. [2023-08-03 21:36:18,457 INFO L125 PetriNetUnfolderBase]: For 1358516/1358694 co-relation queries the response was YES. [2023-08-03 21:36:20,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517342 conditions, 81735 events. 42224/81735 cut-off events. For 1358516/1358694 co-relation queries the response was YES. Maximal size of possible extension queue 3558. Compared 882599 event pairs, 12014 based on Foata normal form. 516/77984 useless extension candidates. Maximal degree in co-relation 517182. Up to 36482 conditions per place. [2023-08-03 21:36:20,554 INFO L140 encePairwiseOnDemand]: 450/472 looper letters, 945 selfloop transitions, 380 changer transitions 484/1818 dead transitions. [2023-08-03 21:36:20,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1818 transitions, 29452 flow [2023-08-03 21:36:20,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-03 21:36:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-03 21:36:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4483 transitions. [2023-08-03 21:36:20,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35177338355304455 [2023-08-03 21:36:20,558 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4483 transitions. [2023-08-03 21:36:20,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4483 transitions. [2023-08-03 21:36:20,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:36:20,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4483 transitions. [2023-08-03 21:36:20,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 166.03703703703704) internal successors, (4483), 27 states have internal predecessors, (4483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:20,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 472.0) internal successors, (13216), 28 states have internal predecessors, (13216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:20,573 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 472.0) internal successors, (13216), 28 states have internal predecessors, (13216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:20,573 INFO L175 Difference]: Start difference. First operand has 349 places, 804 transitions, 13048 flow. Second operand 27 states and 4483 transitions. [2023-08-03 21:36:20,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 1818 transitions, 29452 flow [2023-08-03 21:36:41,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 1818 transitions, 29356 flow, removed 31 selfloop flow, removed 12 redundant places. [2023-08-03 21:36:41,644 INFO L231 Difference]: Finished difference. Result has 377 places, 952 transitions, 16542 flow [2023-08-03 21:36:41,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=12968, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=16542, PETRI_PLACES=377, PETRI_TRANSITIONS=952} [2023-08-03 21:36:41,645 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 309 predicate places. [2023-08-03 21:36:41,645 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 952 transitions, 16542 flow [2023-08-03 21:36:41,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.34782608695653) internal successors, (3435), 23 states have internal predecessors, (3435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:41,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:36:41,646 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-03 21:36:41,651 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-03 21:36:41,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:36:41,851 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:36:41,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:36:41,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2051113094, now seen corresponding path program 2 times [2023-08-03 21:36:41,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:36:41,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460369946] [2023-08-03 21:36:41,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:36:41,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:36:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:36:43,723 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-03 21:36:43,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:36:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460369946] [2023-08-03 21:36:43,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460369946] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:36:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237498156] [2023-08-03 21:36:43,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:36:43,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:36:43,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:36:43,725 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-03 21:36:43,726 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-03 21:36:43,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:36:43,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:36:43,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-03 21:36:43,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:36:43,868 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-03 21:36:43,943 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:36:43,943 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-03 21:36:43,979 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-03 21:36:44,015 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-03 21:36:44,065 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-03 21:36:44,126 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 21:36:44,127 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 22 treesize of output 15 [2023-08-03 21:36:44,203 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-03 21:36:44,295 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-03 21:36:44,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:36:44,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-08-03 21:36:44,411 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 16 treesize of output 12 [2023-08-03 21:36:46,422 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_129| Int) (|~#a~0.offset| Int) (v_ArrVal_1347 Int)) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_129|) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 v_ArrVal_1347) |v_t_funThread1of2ForFork0_~p~0#1.offset_129|) 0)))) is different from false [2023-08-03 21:36:46,490 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1343 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_129| Int) (|~#a~0.offset| Int) (v_ArrVal_1347 Int)) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_129|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1343) |c_~#a~0.base|) .cse0 v_ArrVal_1347) |v_t_funThread1of2ForFork0_~p~0#1.offset_129|) 0)))) is different from false [2023-08-03 21:36:46,751 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-03 21:36:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237498156] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:36:46,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:36:46,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 27 [2023-08-03 21:36:46,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483011023] [2023-08-03 21:36:46,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:36:46,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-03 21:36:46,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:36:46,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-03 21:36:46,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=601, Unknown=2, NotChecked=102, Total=812 [2023-08-03 21:36:47,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 472 [2023-08-03 21:36:47,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 952 transitions, 16542 flow. Second operand has 29 states, 29 states have (on average 146.17241379310346) internal successors, (4239), 29 states have internal predecessors, (4239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:47,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:36:47,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 472 [2023-08-03 21:36:47,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:37:15,273 WARN L233 SmtUtils]: Spent 28.14s on a formula simplification. DAG size of input: 38 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:37:17,276 WARN L539 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-03 21:37:20,361 WARN L539 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-03 21:37:23,052 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-03 21:37:25,066 WARN L539 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-03 21:37:54,270 INFO L124 PetriNetUnfolderBase]: 43534/85310 cut-off events. [2023-08-03 21:37:54,270 INFO L125 PetriNetUnfolderBase]: For 1781439/1781673 co-relation queries the response was YES. [2023-08-03 21:37:56,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577241 conditions, 85310 events. 43534/85310 cut-off events. For 1781439/1781673 co-relation queries the response was YES. Maximal size of possible extension queue 3677. Compared 939472 event pairs, 16364 based on Foata normal form. 176/81025 useless extension candidates. Maximal degree in co-relation 577075. Up to 55340 conditions per place. [2023-08-03 21:37:56,762 INFO L140 encePairwiseOnDemand]: 451/472 looper letters, 1009 selfloop transitions, 295 changer transitions 172/1485 dead transitions. [2023-08-03 21:37:56,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 1485 transitions, 26883 flow [2023-08-03 21:37:56,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-03 21:37:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-03 21:37:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4914 transitions. [2023-08-03 21:37:56,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33583925642427553 [2023-08-03 21:37:56,768 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 4914 transitions. [2023-08-03 21:37:56,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 4914 transitions. [2023-08-03 21:37:56,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:37:56,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 4914 transitions. [2023-08-03 21:37:56,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 158.51612903225808) internal successors, (4914), 31 states have internal predecessors, (4914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:37:56,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 472.0) internal successors, (15104), 32 states have internal predecessors, (15104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:37:56,782 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 472.0) internal successors, (15104), 32 states have internal predecessors, (15104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:37:56,782 INFO L175 Difference]: Start difference. First operand has 377 places, 952 transitions, 16542 flow. Second operand 31 states and 4914 transitions. [2023-08-03 21:37:56,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 1485 transitions, 26883 flow [2023-08-03 21:38:24,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 1485 transitions, 26204 flow, removed 233 selfloop flow, removed 7 redundant places. [2023-08-03 21:38:24,113 INFO L231 Difference]: Finished difference. Result has 410 places, 1026 transitions, 18870 flow [2023-08-03 21:38:24,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=16013, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=18870, PETRI_PLACES=410, PETRI_TRANSITIONS=1026} [2023-08-03 21:38:24,114 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 342 predicate places. [2023-08-03 21:38:24,114 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 1026 transitions, 18870 flow [2023-08-03 21:38:24,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 146.17241379310346) internal successors, (4239), 29 states have internal predecessors, (4239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:38:24,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:38:24,115 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-03 21:38:24,119 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-03 21:38:24,315 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,SelfDestructingSolverStorable25 [2023-08-03 21:38:24,316 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:38:24,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:38:24,316 INFO L85 PathProgramCache]: Analyzing trace with hash 805612544, now seen corresponding path program 2 times [2023-08-03 21:38:24,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:38:24,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958412278] [2023-08-03 21:38:24,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:38:24,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:38:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:38:24,790 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-03 21:38:24,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:38:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958412278] [2023-08-03 21:38:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958412278] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:38:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969411603] [2023-08-03 21:38:24,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:38:24,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:38:24,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:38:24,792 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-03 21:38:24,793 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-03 21:38:24,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:38:24,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:38:24,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-03 21:38:24,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:38:24,928 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-03 21:38:25,016 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:38:25,016 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-03 21:38:25,054 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-03 21:38:25,081 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 21:38:25,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:25,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:38:25,185 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-03 21:38:25,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-03 21:38:25,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:25,290 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:38:25,321 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 21:38:25,321 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 22 treesize of output 15 [2023-08-03 21:38:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 21:38:25,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:38:25,419 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1434 (Array Int Int)) (v_ArrVal_1432 Int) (|~#a~0.offset| Int)) (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1434) |c_~#a~0.base|) (+ .cse0 4 |~#a~0.offset|)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1432)) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|)) 0)))) is different from false [2023-08-03 21:38:25,447 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1434 (Array Int Int)) (v_ArrVal_1431 (Array Int Int)) (v_ArrVal_1432 Int) (|~#a~0.offset| Int)) (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1434) |c_~#a~0.base|) (+ .cse0 4 |~#a~0.offset|)) 0)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1431))) (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1432))) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|)) 0)))) is different from false [2023-08-03 21:38:25,488 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:38:25,489 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-03 21:38:25,499 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:38:25,500 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 45 treesize of output 42 [2023-08-03 21:38:25,505 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-03 21:38:27,526 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_131| Int) (v_ArrVal_1431 (Array Int Int)) (v_ArrVal_1432 Int) (|~#a~0.offset| Int)) (let ((.cse0 (+ .cse1 |~#a~0.offset|))) (or (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_131|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1431) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_131| v_ArrVal_1432) .cse0) 0)))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_131| Int) (v_ArrVal_1431 (Array Int Int)) (v_ArrVal_1432 Int) (|~#a~0.offset| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1431) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_131| v_ArrVal_1432) (+ .cse1 |~#a~0.offset|)) 0))))) is different from false [2023-08-03 21:38:35,641 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:38:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2023-08-03 21:38:35,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969411603] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:38:35,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:38:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-03 21:38:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910813903] [2023-08-03 21:38:35,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:38:35,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-03 21:38:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:38:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-03 21:38:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=249, Unknown=3, NotChecked=108, Total=462 [2023-08-03 21:38:36,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 472 [2023-08-03 21:38:36,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 1026 transitions, 18870 flow. Second operand has 22 states, 22 states have (on average 151.45454545454547) internal successors, (3332), 22 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-03 21:38:36,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:38:36,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 472 [2023-08-03 21:38:36,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:38:38,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:38:40,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 21:39:15,884 INFO L124 PetriNetUnfolderBase]: 49478/98097 cut-off events. [2023-08-03 21:39:15,884 INFO L125 PetriNetUnfolderBase]: For 2118304/2118534 co-relation queries the response was YES. [2023-08-03 21:39:19,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672694 conditions, 98097 events. 49478/98097 cut-off events. For 2118304/2118534 co-relation queries the response was YES. Maximal size of possible extension queue 4370. Compared 1113490 event pairs, 11946 based on Foata normal form. 335/93142 useless extension candidates. Maximal degree in co-relation 672506. Up to 41622 conditions per place. [2023-08-03 21:39:19,386 INFO L140 encePairwiseOnDemand]: 449/472 looper letters, 794 selfloop transitions, 751 changer transitions 241/1795 dead transitions. [2023-08-03 21:39:19,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 1795 transitions, 33352 flow [2023-08-03 21:39:19,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-03 21:39:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-03 21:39:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3463 transitions. [2023-08-03 21:39:19,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36684322033898303 [2023-08-03 21:39:19,390 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3463 transitions. [2023-08-03 21:39:19,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3463 transitions. [2023-08-03 21:39:19,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:39:19,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3463 transitions. [2023-08-03 21:39:19,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 173.15) internal successors, (3463), 20 states have internal predecessors, (3463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:39:19,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 472.0) internal successors, (9912), 21 states have internal predecessors, (9912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:39:19,402 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 472.0) internal successors, (9912), 21 states have internal predecessors, (9912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:39:19,402 INFO L175 Difference]: Start difference. First operand has 410 places, 1026 transitions, 18870 flow. Second operand 20 states and 3463 transitions. [2023-08-03 21:39:19,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 1795 transitions, 33352 flow Received shutdown request... [2023-08-03 21:39:30,024 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 21:39:30,030 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-03 21:39:30,067 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 21:39:30,067 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-03 21:39:30,224 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,SelfDestructingSolverStorable26 [2023-08-03 21:39:30,224 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-08-03 21:39:30,224 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 21:39:30,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 21:39:30,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 21:39:30,225 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-08-03 21:39:30,225 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (2/2) [2023-08-03 21:39:30,227 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 21:39:30,227 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 21:39:30,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 09:39:30 BasicIcfg [2023-08-03 21:39:30,229 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 21:39:30,230 INFO L158 Benchmark]: Toolchain (without parser) took 785995.19ms. Allocated memory was 578.8MB in the beginning and 15.4GB in the end (delta: 14.8GB). Free memory was 522.3MB in the beginning and 8.8GB in the end (delta: -8.3GB). Peak memory consumption was 7.0GB. Max. memory is 16.0GB. [2023-08-03 21:39:30,230 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 364.9MB. Free memory is still 314.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 21:39:30,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 642.94ms. Allocated memory is still 578.8MB. Free memory was 522.3MB in the beginning and 491.9MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-03 21:39:30,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.00ms. Allocated memory is still 578.8MB. Free memory was 491.9MB in the beginning and 489.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:39:30,230 INFO L158 Benchmark]: Boogie Preprocessor took 58.06ms. Allocated memory is still 578.8MB. Free memory was 489.8MB in the beginning and 487.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:39:30,231 INFO L158 Benchmark]: RCFGBuilder took 405.81ms. Allocated memory is still 578.8MB. Free memory was 487.7MB in the beginning and 466.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-03 21:39:30,231 INFO L158 Benchmark]: TraceAbstraction took 784811.18ms. Allocated memory was 578.8MB in the beginning and 15.4GB in the end (delta: 14.8GB). Free memory was 466.7MB in the beginning and 8.8GB in the end (delta: -8.3GB). Peak memory consumption was 6.9GB. Max. memory is 16.0GB. [2023-08-03 21:39:30,231 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 364.9MB. Free memory is still 314.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 642.94ms. Allocated memory is still 578.8MB. Free memory was 522.3MB in the beginning and 491.9MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.00ms. Allocated memory is still 578.8MB. Free memory was 491.9MB in the beginning and 489.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 58.06ms. Allocated memory is still 578.8MB. Free memory was 489.8MB in the beginning and 487.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 405.81ms. Allocated memory is still 578.8MB. Free memory was 487.7MB in the beginning and 466.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 784811.18ms. Allocated memory was 578.8MB in the beginning and 15.4GB in the end (delta: 14.8GB). Free memory was 466.7MB in the beginning and 8.8GB in the end (delta: -8.3GB). Peak memory consumption was 6.9GB. 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.9s, 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: 3.1s, 220 PlacesBefore, 68 PlacesAfterwards, 260 TransitionsBefore, 100 TransitionsAfterwards, 31416 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 144 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 26 ConcurrentYvCompositions, 8 ChoiceCompositions, 218 TotalNumberOfCompositions, 55124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24876, independent: 24449, independent conditional: 0, independent unconditional: 24449, dependent: 427, dependent conditional: 0, dependent unconditional: 427, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15412, independent: 15298, independent conditional: 0, independent unconditional: 15298, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 24876, independent: 9151, independent conditional: 0, independent unconditional: 9151, dependent: 313, dependent conditional: 0, dependent unconditional: 313, unknown: 15412, unknown conditional: 0, unknown unconditional: 15412] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 304, Positive conditional cache size: 0, Positive unconditional cache size: 304, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, 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, 100 TransitionsAfterwards, 31416 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 138 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 26 ConcurrentYvCompositions, 8 ChoiceCompositions, 212 TotalNumberOfCompositions, 54087 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24876, independent: 24451, independent conditional: 0, independent unconditional: 24451, dependent: 425, dependent conditional: 0, dependent unconditional: 425, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15354, independent: 15256, independent conditional: 0, independent unconditional: 15256, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 24876, independent: 9195, independent conditional: 0, independent unconditional: 9195, dependent: 327, dependent conditional: 0, dependent unconditional: 327, unknown: 15354, unknown conditional: 0, unknown unconditional: 15354] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 395, Positive conditional cache size: 0, Positive unconditional cache size: 395, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, 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 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: 4.9s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.2s 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.5s 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency 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: 6.9s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 580 IncrementalHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 2 mSDtfsCounter, 580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=0, InterpolantAutomatonStates: 26, 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.3s InterpolantComputationTime, 114 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 177/215 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 1 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: 772.8s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 619.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 312 mSolverCounterUnknown, 11762 SdHoareTripleChecker+Valid, 333.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11428 mSDsluCounter, 1940 SdHoareTripleChecker+Invalid, 330.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11285 IncrementalHoareTripleChecker+Unchecked, 1774 mSDsCounter, 1545 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26898 IncrementalHoareTripleChecker+Invalid, 40040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1545 mSolverCounterUnsat, 166 mSDtfsCounter, 26898 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1164 GetRequests, 658 SyntacticMatches, 26 SemanticMatches, 480 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 3579 ImplicationChecksByTransitivity, 128.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18870occurred in iteration=18, InterpolantAutomatonStates: 322, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 144.8s InterpolantComputationTime, 865 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1215 ConstructedInterpolants, 341 QuantifiedInterpolants, 24942 SizeOfPredicates, 107 NumberOfNonLiveVariables, 3442 ConjunctsInSsa, 454 ConjunctsInUnsatCore, 50 InterpolantComputations, 4 PerfectInterpolantSequences, 2080/2385 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