./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:35:08,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:35:08,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:35:08,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:35:08,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:35:08,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:35:08,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:35:08,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:35:08,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:35:08,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:35:08,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:35:08,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:35:08,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:35:08,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:35:08,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:35:08,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:35:08,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:35:08,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:35:08,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:35:08,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:35:08,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:35:08,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:35:08,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:35:08,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:35:08,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:35:08,581 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:35:08,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:35:08,582 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:35:08,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:35:08,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:35:08,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:35:08,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:35:08,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:35:08,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:35:08,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:35:08,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:35:08,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:35:08,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:35:08,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:35:08,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:35:08,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:35:08,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:35:08,587 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2024-11-09 02:35:08,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:35:08,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:35:08,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:35:08,881 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:35:08,882 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:35:08,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-09 02:35:10,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:35:10,756 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:35:10,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-09 02:35:10,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab5581d60/9de2eec6d36d43cfbc8242e3c8743032/FLAG744e6a06f [2024-11-09 02:35:11,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab5581d60/9de2eec6d36d43cfbc8242e3c8743032 [2024-11-09 02:35:11,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:35:11,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:35:11,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:35:11,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:35:11,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:35:11,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443495c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11, skipping insertion in model container [2024-11-09 02:35:11,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:35:11,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-11-09 02:35:11,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:35:11,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:35:11,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-11-09 02:35:11,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:35:11,843 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:35:11,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11 WrapperNode [2024-11-09 02:35:11,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:35:11,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:35:11,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:35:11,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:35:11,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,903 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2024-11-09 02:35:11,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:35:11,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:35:11,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:35:11,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:35:11,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,935 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 02:35:11,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:35:11,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:35:11,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:35:11,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:35:11,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (1/1) ... [2024-11-09 02:35:11,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:35:11,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:35:12,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:35:12,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:35:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 02:35:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 02:35:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-11-09 02:35:12,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-11-09 02:35:12,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:35:12,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:35:12,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:35:12,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:35:12,058 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:35:12,236 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:35:12,238 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:35:12,432 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:35:12,433 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:35:12,831 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:35:12,831 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 02:35:12,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:35:12 BoogieIcfgContainer [2024-11-09 02:35:12,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:35:12,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:35:12,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:35:12,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:35:12,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:35:11" (1/3) ... [2024-11-09 02:35:12,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8bc4954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:35:12, skipping insertion in model container [2024-11-09 02:35:12,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:35:11" (2/3) ... [2024-11-09 02:35:12,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8bc4954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:35:12, skipping insertion in model container [2024-11-09 02:35:12,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:35:12" (3/3) ... [2024-11-09 02:35:12,844 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-11-09 02:35:12,861 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:35:12,862 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:35:12,862 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:35:12,901 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 02:35:12,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 51 flow [2024-11-09 02:35:12,969 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2024-11-09 02:35:12,969 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 02:35:12,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 21 events. 3/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2024-11-09 02:35:12,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 51 flow [2024-11-09 02:35:12,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 18 transitions, 42 flow [2024-11-09 02:35:12,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:35:12,995 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@38576af3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:35:12,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 02:35:13,003 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:35:13,004 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2024-11-09 02:35:13,004 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 02:35:13,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:35:13,007 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:35:13,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:35:13,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:35:13,013 INFO L85 PathProgramCache]: Analyzing trace with hash 159153663, now seen corresponding path program 1 times [2024-11-09 02:35:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:35:13,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355290796] [2024-11-09 02:35:13,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:35:13,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:35:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:35:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:35:13,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:35:13,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355290796] [2024-11-09 02:35:13,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355290796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:35:13,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:35:13,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:35:13,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082747299] [2024-11-09 02:35:13,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:35:13,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:35:13,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:35:13,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:35:13,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:35:13,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2024-11-09 02:35:13,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:13,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:35:13,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2024-11-09 02:35:13,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:35:13,476 INFO L124 PetriNetUnfolderBase]: 19/60 cut-off events. [2024-11-09 02:35:13,476 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 02:35:13,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 60 events. 19/60 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 6 based on Foata normal form. 3/59 useless extension candidates. Maximal degree in co-relation 90. Up to 29 conditions per place. [2024-11-09 02:35:13,479 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 14 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2024-11-09 02:35:13,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 23 transitions, 84 flow [2024-11-09 02:35:13,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:35:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:35:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-11-09 02:35:13,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 02:35:13,494 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 42 flow. Second operand 3 states and 44 transitions. [2024-11-09 02:35:13,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 23 transitions, 84 flow [2024-11-09 02:35:13,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 23 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:35:13,500 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 50 flow [2024-11-09 02:35:13,502 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2024-11-09 02:35:13,509 INFO L277 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2024-11-09 02:35:13,509 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 50 flow [2024-11-09 02:35:13,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:13,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:35:13,510 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:35:13,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:35:13,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:35:13,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:35:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash -355610242, now seen corresponding path program 1 times [2024-11-09 02:35:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:35:13,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425854591] [2024-11-09 02:35:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:35:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:35:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:35:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:35:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:35:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425854591] [2024-11-09 02:35:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425854591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:35:13,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:35:13,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:35:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435284905] [2024-11-09 02:35:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:35:13,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:35:13,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:35:13,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:35:13,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:35:13,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2024-11-09 02:35:13,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:13,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:35:13,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2024-11-09 02:35:13,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:35:13,748 INFO L124 PetriNetUnfolderBase]: 25/82 cut-off events. [2024-11-09 02:35:13,750 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-09 02:35:13,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 82 events. 25/82 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 241 event pairs, 10 based on Foata normal form. 6/87 useless extension candidates. Maximal degree in co-relation 75. Up to 41 conditions per place. [2024-11-09 02:35:13,752 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 16 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2024-11-09 02:35:13,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 25 transitions, 108 flow [2024-11-09 02:35:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:35:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:35:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-11-09 02:35:13,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 02:35:13,755 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 50 flow. Second operand 3 states and 44 transitions. [2024-11-09 02:35:13,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 25 transitions, 108 flow [2024-11-09 02:35:13,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:35:13,756 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 60 flow [2024-11-09 02:35:13,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2024-11-09 02:35:13,757 INFO L277 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2024-11-09 02:35:13,757 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 60 flow [2024-11-09 02:35:13,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:13,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:35:13,758 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:35:13,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:35:13,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:35:13,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:35:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash -553850407, now seen corresponding path program 1 times [2024-11-09 02:35:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:35:13,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954890866] [2024-11-09 02:35:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:35:13,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:35:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:35:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:35:13,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:35:13,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954890866] [2024-11-09 02:35:13,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954890866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:35:13,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330898444] [2024-11-09 02:35:13,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:35:13,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:35:13,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:35:13,937 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) [2024-11-09 02:35:13,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:35:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:35:14,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:35:14,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:35:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:35:14,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:35:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:35:14,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330898444] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:35:14,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:35:14,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-09 02:35:14,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462286574] [2024-11-09 02:35:14,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:35:14,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:35:14,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:35:14,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:35:14,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:35:14,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-11-09 02:35:14,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 60 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:14,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:35:14,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-11-09 02:35:14,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:35:14,522 INFO L124 PetriNetUnfolderBase]: 76/219 cut-off events. [2024-11-09 02:35:14,522 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-11-09 02:35:14,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 219 events. 76/219 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 706 event pairs, 4 based on Foata normal form. 30/247 useless extension candidates. Maximal degree in co-relation 166. Up to 61 conditions per place. [2024-11-09 02:35:14,527 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 41 selfloop transitions, 33 changer transitions 0/80 dead transitions. [2024-11-09 02:35:14,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 80 transitions, 406 flow [2024-11-09 02:35:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 02:35:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 02:35:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 216 transitions. [2024-11-09 02:35:14,531 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-09 02:35:14,531 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 60 flow. Second operand 16 states and 216 transitions. [2024-11-09 02:35:14,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 80 transitions, 406 flow [2024-11-09 02:35:14,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 80 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:35:14,537 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 332 flow [2024-11-09 02:35:14,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=332, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2024-11-09 02:35:14,540 INFO L277 CegarLoopForPetriNet]: 20 programPoint places, 30 predicate places. [2024-11-09 02:35:14,540 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 332 flow [2024-11-09 02:35:14,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:14,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:35:14,541 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:35:14,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 02:35:14,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:35:14,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:35:14,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:35:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1305280635, now seen corresponding path program 2 times [2024-11-09 02:35:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:35:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130034059] [2024-11-09 02:35:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:35:14,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:35:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:35:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 02:35:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:35:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130034059] [2024-11-09 02:35:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130034059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:35:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794377040] [2024-11-09 02:35:14,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 02:35:14,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:35:14,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:35:14,951 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) [2024-11-09 02:35:14,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 02:35:15,134 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 02:35:15,135 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:35:15,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 02:35:15,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:35:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 02:35:15,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:35:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 02:35:15,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794377040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:35:15,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:35:15,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 02:35:15,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214170288] [2024-11-09 02:35:15,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:35:15,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:35:15,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:35:15,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:35:15,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:35:15,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-11-09 02:35:15,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 332 flow. Second operand has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:15,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:35:15,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-11-09 02:35:15,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:35:15,534 INFO L124 PetriNetUnfolderBase]: 166/452 cut-off events. [2024-11-09 02:35:15,534 INFO L125 PetriNetUnfolderBase]: For 3168/3177 co-relation queries the response was YES. [2024-11-09 02:35:15,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 452 events. 166/452 cut-off events. For 3168/3177 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1556 event pairs, 10 based on Foata normal form. 30/476 useless extension candidates. Maximal degree in co-relation 1472. Up to 133 conditions per place. [2024-11-09 02:35:15,542 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 110 selfloop transitions, 36 changer transitions 0/152 dead transitions. [2024-11-09 02:35:15,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 152 transitions, 1486 flow [2024-11-09 02:35:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:35:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 02:35:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 172 transitions. [2024-11-09 02:35:15,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-11-09 02:35:15,544 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 332 flow. Second operand 12 states and 172 transitions. [2024-11-09 02:35:15,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 152 transitions, 1486 flow [2024-11-09 02:35:15,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 152 transitions, 1358 flow, removed 44 selfloop flow, removed 2 redundant places. [2024-11-09 02:35:15,565 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 552 flow [2024-11-09 02:35:15,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=552, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2024-11-09 02:35:15,567 INFO L277 CegarLoopForPetriNet]: 20 programPoint places, 46 predicate places. [2024-11-09 02:35:15,567 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 552 flow [2024-11-09 02:35:15,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:15,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:35:15,568 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:35:15,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 02:35:15,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 02:35:15,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:35:15,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:35:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1988966811, now seen corresponding path program 3 times [2024-11-09 02:35:15,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:35:15,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927166105] [2024-11-09 02:35:15,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:35:15,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:35:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:35:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 02:35:16,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:35:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927166105] [2024-11-09 02:35:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927166105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:35:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725891941] [2024-11-09 02:35:16,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 02:35:16,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:35:16,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:35:16,098 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) [2024-11-09 02:35:16,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 02:35:16,261 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 02:35:16,262 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:35:16,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:35:16,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:35:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-09 02:35:16,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:35:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-09 02:35:16,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725891941] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:35:16,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:35:16,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2024-11-09 02:35:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425628336] [2024-11-09 02:35:16,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:35:16,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 02:35:16,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:35:16,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 02:35:16,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-11-09 02:35:16,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-11-09 02:35:16,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 552 flow. Second operand has 19 states, 19 states have (on average 10.421052631578947) internal successors, (198), 19 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:16,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:35:16,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-11-09 02:35:16,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:35:18,177 INFO L124 PetriNetUnfolderBase]: 435/1345 cut-off events. [2024-11-09 02:35:18,177 INFO L125 PetriNetUnfolderBase]: For 10513/10523 co-relation queries the response was YES. [2024-11-09 02:35:18,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4793 conditions, 1345 events. 435/1345 cut-off events. For 10513/10523 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7108 event pairs, 11 based on Foata normal form. 144/1477 useless extension candidates. Maximal degree in co-relation 3991. Up to 229 conditions per place. [2024-11-09 02:35:18,196 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 186 selfloop transitions, 204 changer transitions 0/402 dead transitions. [2024-11-09 02:35:18,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 402 transitions, 3528 flow [2024-11-09 02:35:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-11-09 02:35:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2024-11-09 02:35:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 1101 transitions. [2024-11-09 02:35:18,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5887700534759358 [2024-11-09 02:35:18,204 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 552 flow. Second operand 85 states and 1101 transitions. [2024-11-09 02:35:18,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 402 transitions, 3528 flow [2024-11-09 02:35:18,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 402 transitions, 3486 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 02:35:18,228 INFO L231 Difference]: Finished difference. Result has 209 places, 231 transitions, 2888 flow [2024-11-09 02:35:18,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=2888, PETRI_PLACES=209, PETRI_TRANSITIONS=231} [2024-11-09 02:35:18,229 INFO L277 CegarLoopForPetriNet]: 20 programPoint places, 189 predicate places. [2024-11-09 02:35:18,229 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 231 transitions, 2888 flow [2024-11-09 02:35:18,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.421052631578947) internal successors, (198), 19 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:18,230 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:35:18,230 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:35:18,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 02:35:18,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:35:18,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:35:18,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:35:18,432 INFO L85 PathProgramCache]: Analyzing trace with hash -195720770, now seen corresponding path program 4 times [2024-11-09 02:35:18,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:35:18,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026410087] [2024-11-09 02:35:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:35:18,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:35:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:35:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 02:35:18,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:35:18,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026410087] [2024-11-09 02:35:18,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026410087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:35:18,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402243516] [2024-11-09 02:35:18,760 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 02:35:18,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:35:18,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:35:18,762 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) [2024-11-09 02:35:18,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 02:35:18,932 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 02:35:18,932 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:35:18,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 02:35:18,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:35:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 02:35:19,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:35:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 02:35:19,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402243516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:35:19,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:35:19,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23 [2024-11-09 02:35:19,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222870032] [2024-11-09 02:35:19,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:35:19,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 02:35:19,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:35:19,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 02:35:19,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-11-09 02:35:19,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-11-09 02:35:19,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 231 transitions, 2888 flow. Second operand has 23 states, 23 states have (on average 11.26086956521739) internal successors, (259), 23 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:19,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:35:19,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-11-09 02:35:19,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:35:20,084 INFO L124 PetriNetUnfolderBase]: 590/1602 cut-off events. [2024-11-09 02:35:20,084 INFO L125 PetriNetUnfolderBase]: For 133180/133252 co-relation queries the response was YES. [2024-11-09 02:35:20,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11826 conditions, 1602 events. 590/1602 cut-off events. For 133180/133252 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 8437 event pairs, 28 based on Foata normal form. 81/1658 useless extension candidates. Maximal degree in co-relation 10816. Up to 498 conditions per place. [2024-11-09 02:35:20,109 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 293 selfloop transitions, 150 changer transitions 0/461 dead transitions. [2024-11-09 02:35:20,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 461 transitions, 8252 flow [2024-11-09 02:35:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 02:35:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-09 02:35:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 315 transitions. [2024-11-09 02:35:20,112 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6508264462809917 [2024-11-09 02:35:20,112 INFO L175 Difference]: Start difference. First operand has 209 places, 231 transitions, 2888 flow. Second operand 22 states and 315 transitions. [2024-11-09 02:35:20,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 461 transitions, 8252 flow [2024-11-09 02:35:20,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 461 transitions, 7372 flow, removed 368 selfloop flow, removed 15 redundant places. [2024-11-09 02:35:20,318 INFO L231 Difference]: Finished difference. Result has 225 places, 290 transitions, 3396 flow [2024-11-09 02:35:20,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3396, PETRI_PLACES=225, PETRI_TRANSITIONS=290} [2024-11-09 02:35:20,319 INFO L277 CegarLoopForPetriNet]: 20 programPoint places, 205 predicate places. [2024-11-09 02:35:20,319 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 290 transitions, 3396 flow [2024-11-09 02:35:20,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.26086956521739) internal successors, (259), 23 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:20,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:35:20,320 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:35:20,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 02:35:20,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:35:20,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:35:20,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:35:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1523936837, now seen corresponding path program 5 times [2024-11-09 02:35:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:35:20,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855750645] [2024-11-09 02:35:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:35:20,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:35:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:35:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 20 proven. 51 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-11-09 02:35:20,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:35:20,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855750645] [2024-11-09 02:35:20,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855750645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:35:20,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715791190] [2024-11-09 02:35:20,738 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 02:35:20,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:35:20,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:35:20,740 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) [2024-11-09 02:35:20,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 02:35:20,909 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2024-11-09 02:35:20,909 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:35:20,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:35:20,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:35:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 20 proven. 51 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-11-09 02:35:20,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:35:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 20 proven. 51 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-11-09 02:35:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715791190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:35:21,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:35:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-09 02:35:21,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002454965] [2024-11-09 02:35:21,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:35:21,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 02:35:21,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:35:21,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 02:35:21,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:35:21,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-11-09 02:35:21,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 290 transitions, 3396 flow. Second operand has 17 states, 17 states have (on average 10.294117647058824) internal successors, (175), 17 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:21,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:35:21,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-11-09 02:35:21,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:35:22,431 INFO L124 PetriNetUnfolderBase]: 1408/4010 cut-off events. [2024-11-09 02:35:22,432 INFO L125 PetriNetUnfolderBase]: For 623485/623493 co-relation queries the response was YES. [2024-11-09 02:35:22,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22229 conditions, 4010 events. 1408/4010 cut-off events. For 623485/623493 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 26091 event pairs, 168 based on Foata normal form. 382/4308 useless extension candidates. Maximal degree in co-relation 20661. Up to 741 conditions per place. [2024-11-09 02:35:22,484 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 620 selfloop transitions, 216 changer transitions 0/851 dead transitions. [2024-11-09 02:35:22,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 851 transitions, 12310 flow [2024-11-09 02:35:22,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 02:35:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 02:35:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 231 transitions. [2024-11-09 02:35:22,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-09 02:35:22,486 INFO L175 Difference]: Start difference. First operand has 225 places, 290 transitions, 3396 flow. Second operand 16 states and 231 transitions. [2024-11-09 02:35:22,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 851 transitions, 12310 flow [2024-11-09 02:35:23,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 851 transitions, 11804 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-09 02:35:23,021 INFO L231 Difference]: Finished difference. Result has 238 places, 398 transitions, 4722 flow [2024-11-09 02:35:23,022 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3242, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4722, PETRI_PLACES=238, PETRI_TRANSITIONS=398} [2024-11-09 02:35:23,023 INFO L277 CegarLoopForPetriNet]: 20 programPoint places, 218 predicate places. [2024-11-09 02:35:23,023 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 398 transitions, 4722 flow [2024-11-09 02:35:23,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.294117647058824) internal successors, (175), 17 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:23,023 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:35:23,024 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:35:23,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 02:35:23,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:35:23,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:35:23,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:35:23,225 INFO L85 PathProgramCache]: Analyzing trace with hash 947048967, now seen corresponding path program 6 times [2024-11-09 02:35:23,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:35:23,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876724617] [2024-11-09 02:35:23,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:35:23,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:35:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:35:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 20 proven. 287 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-11-09 02:35:23,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:35:23,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876724617] [2024-11-09 02:35:23,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876724617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:35:23,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609480460] [2024-11-09 02:35:23,678 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 02:35:23,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:35:23,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:35:23,681 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) [2024-11-09 02:35:23,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 02:35:23,947 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-11-09 02:35:23,947 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:35:23,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 02:35:23,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:35:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 20 proven. 287 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-11-09 02:35:24,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:35:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 20 proven. 287 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-11-09 02:35:24,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609480460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:35:24,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:35:24,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-11-09 02:35:24,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068799398] [2024-11-09 02:35:24,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:35:24,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 02:35:24,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:35:24,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 02:35:24,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-11-09 02:35:24,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-11-09 02:35:24,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 398 transitions, 4722 flow. Second operand has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 23 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:24,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:35:24,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-11-09 02:35:24,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:35:26,309 INFO L124 PetriNetUnfolderBase]: 1936/5504 cut-off events. [2024-11-09 02:35:26,309 INFO L125 PetriNetUnfolderBase]: For 653197/653215 co-relation queries the response was YES. [2024-11-09 02:35:26,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31265 conditions, 5504 events. 1936/5504 cut-off events. For 653197/653215 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 38413 event pairs, 174 based on Foata normal form. 298/5706 useless extension candidates. Maximal degree in co-relation 29135. Up to 1023 conditions per place. [2024-11-09 02:35:26,373 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 956 selfloop transitions, 288 changer transitions 0/1259 dead transitions. [2024-11-09 02:35:26,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 1259 transitions, 18848 flow [2024-11-09 02:35:26,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 02:35:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-09 02:35:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 313 transitions. [2024-11-09 02:35:26,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6466942148760331 [2024-11-09 02:35:26,375 INFO L175 Difference]: Start difference. First operand has 238 places, 398 transitions, 4722 flow. Second operand 22 states and 313 transitions. [2024-11-09 02:35:26,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 1259 transitions, 18848 flow [2024-11-09 02:35:27,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 1259 transitions, 18688 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 02:35:27,355 INFO L231 Difference]: Finished difference. Result has 261 places, 482 transitions, 6298 flow [2024-11-09 02:35:27,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=4562, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6298, PETRI_PLACES=261, PETRI_TRANSITIONS=482} [2024-11-09 02:35:27,357 INFO L277 CegarLoopForPetriNet]: 20 programPoint places, 241 predicate places. [2024-11-09 02:35:27,357 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 482 transitions, 6298 flow [2024-11-09 02:35:27,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 23 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:35:27,357 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:35:27,357 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:35:27,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 02:35:27,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:35:27,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:35:27,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:35:27,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1936420455, now seen corresponding path program 7 times [2024-11-09 02:35:27,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:35:27,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282136997] [2024-11-09 02:35:27,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:35:27,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:35:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:35:27,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:35:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:35:27,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:35:27,807 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:35:27,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 02:35:27,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-11-09 02:35:27,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:35:27,812 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2024-11-09 02:35:27,976 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 02:35:27,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:35:27,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:35:27 BasicIcfg [2024-11-09 02:35:27,983 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:35:27,983 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:35:27,983 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:35:27,983 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:35:27,984 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:35:12" (3/4) ... [2024-11-09 02:35:27,985 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 02:35:28,127 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 02:35:28,128 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:35:28,128 INFO L158 Benchmark]: Toolchain (without parser) took 17106.59ms. Allocated memory was 163.6MB in the beginning and 998.2MB in the end (delta: 834.7MB). Free memory was 91.8MB in the beginning and 751.6MB in the end (delta: -659.8MB). Peak memory consumption was 208.1MB. Max. memory is 16.1GB. [2024-11-09 02:35:28,128 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:35:28,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 820.86ms. Allocated memory is still 163.6MB. Free memory was 91.7MB in the beginning and 97.6MB in the end (delta: -5.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-11-09 02:35:28,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.92ms. Allocated memory is still 163.6MB. Free memory was 97.6MB in the beginning and 94.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:35:28,130 INFO L158 Benchmark]: Boogie Preprocessor took 55.25ms. Allocated memory is still 163.6MB. Free memory was 94.9MB in the beginning and 92.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:35:28,131 INFO L158 Benchmark]: RCFGBuilder took 871.27ms. Allocated memory is still 163.6MB. Free memory was 92.6MB in the beginning and 116.2MB in the end (delta: -23.6MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2024-11-09 02:35:28,131 INFO L158 Benchmark]: TraceAbstraction took 15147.97ms. Allocated memory was 163.6MB in the beginning and 998.2MB in the end (delta: 834.7MB). Free memory was 115.0MB in the beginning and 733.2MB in the end (delta: -618.3MB). Peak memory consumption was 331.9MB. Max. memory is 16.1GB. [2024-11-09 02:35:28,131 INFO L158 Benchmark]: Witness Printer took 144.58ms. Allocated memory is still 998.2MB. Free memory was 733.2MB in the beginning and 751.6MB in the end (delta: -18.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-09 02:35:28,133 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.20ms. Allocated memory is still 163.6MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 820.86ms. Allocated memory is still 163.6MB. Free memory was 91.7MB in the beginning and 97.6MB in the end (delta: -5.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.92ms. Allocated memory is still 163.6MB. Free memory was 97.6MB in the beginning and 94.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.25ms. Allocated memory is still 163.6MB. Free memory was 94.9MB in the beginning and 92.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 871.27ms. Allocated memory is still 163.6MB. Free memory was 92.6MB in the beginning and 116.2MB in the end (delta: -23.6MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15147.97ms. Allocated memory was 163.6MB in the beginning and 998.2MB in the end (delta: 834.7MB). Free memory was 115.0MB in the beginning and 733.2MB in the end (delta: -618.3MB). Peak memory consumption was 331.9MB. Max. memory is 16.1GB. * Witness Printer took 144.58ms. Allocated memory is still 998.2MB. Free memory was 733.2MB in the beginning and 751.6MB in the end (delta: -18.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=0, myglobal=1, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=1, myglobal=2, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=2, myglobal=3, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=3, myglobal=4, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=4, myglobal=5, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=5, myglobal=6, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=6, myglobal=7, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=7, myglobal=8, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=8, myglobal=9, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=9, myglobal=10, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=10, myglobal=11, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=11, myglobal=12, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=12, myglobal=13, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=13, myglobal=14, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=14, myglobal=15, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=15, myglobal=16, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=16, myglobal=17, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=17, myglobal=18, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=18, myglobal=19, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=19, myglobal=20, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=20, myglobal=20, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=21, myglobal=21] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=22, myglobal=22] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=23, myglobal=23] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=24, myglobal=24] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=25, myglobal=25] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=26, myglobal=26] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=27, myglobal=27] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=28, myglobal=28] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=29, myglobal=29] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=30, myglobal=30] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=31, myglobal=31] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=32, myglobal=32] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=33, myglobal=33] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=34, myglobal=34] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=35, myglobal=35] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=36, myglobal=36] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=37, myglobal=37] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=38, myglobal=38] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=39, myglobal=39] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=40, myglobal=40] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] [L13] 0 reach_error() VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] - UnprovableResult [Line: 1342]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 28 locations, 2 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: 14.9s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1155 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1142 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 993 IncrementalHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1 mSDtfsCounter, 993 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1172 GetRequests, 991 SyntacticMatches, 14 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6298occurred in iteration=8, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1161 NumberOfCodeBlocks, 1118 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 1454 ConstructedInterpolants, 0 QuantifiedInterpolants, 3264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1288 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 6467/8689 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 proved your program to be incorrect! [2024-11-09 02:35:28,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE