/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:26:52,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:26:52,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 15:26:52,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:26:52,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:26:52,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:26:52,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:26:52,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:26:52,126 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:26:52,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:26:52,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:26:52,132 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:26:52,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:26:52,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:26:52,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:26:52,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:26:52,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:26:52,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:26:52,134 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:26:52,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:26:52,135 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:26:52,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:26:52,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:26:52,135 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:26:52,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:26:52,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:26:52,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:26:52,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:26:52,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:26:52,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:26:52,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:26:52,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:26:52,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:26:52,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:26:52,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:26:52,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:26:52,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:26:52,342 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:26:52,343 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:26:52,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-12-09 15:26:53,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:26:53,398 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:26:53,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-12-09 15:26:53,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf6465e7/2102fa2f63bf4988b7a42a62ccd30eb5/FLAG076001d2f [2023-12-09 15:26:53,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf6465e7/2102fa2f63bf4988b7a42a62ccd30eb5 [2023-12-09 15:26:53,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:26:53,415 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:26:53,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:26:53,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:26:53,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:26:53,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3750de75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53, skipping insertion in model container [2023-12-09 15:26:53,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,441 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:26:53,572 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2023-12-09 15:26:53,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:26:53,583 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:26:53,598 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2023-12-09 15:26:53,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:26:53,605 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:26:53,605 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:26:53,609 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:26:53,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53 WrapperNode [2023-12-09 15:26:53,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:26:53,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:26:53,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:26:53,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:26:53,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,637 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 199 [2023-12-09 15:26:53,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:26:53,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:26:53,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:26:53,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:26:53,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:26:53,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:26:53,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:26:53,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:26:53,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (1/1) ... [2023-12-09 15:26:53,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:26:53,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:26:53,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 15:26:53,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 15:26:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:26:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:26:53,716 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:26:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:26:53,716 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:26:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:26:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:26:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:26:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:26:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:26:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:26:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:26:53,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:26:53,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:26:53,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:26:53,718 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:26:53,791 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:26:53,793 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:26:54,031 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:26:54,088 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:26:54,088 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-09 15:26:54,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:26:54 BoogieIcfgContainer [2023-12-09 15:26:54,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:26:54,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:26:54,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:26:54,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:26:54,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:26:53" (1/3) ... [2023-12-09 15:26:54,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e08bd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:26:54, skipping insertion in model container [2023-12-09 15:26:54,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:53" (2/3) ... [2023-12-09 15:26:54,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e08bd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:26:54, skipping insertion in model container [2023-12-09 15:26:54,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:26:54" (3/3) ... [2023-12-09 15:26:54,095 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2023-12-09 15:26:54,107 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:26:54,107 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:26:54,107 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:26:54,165 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:26:54,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 402 flow [2023-12-09 15:26:54,247 INFO L124 PetriNetUnfolderBase]: 15/192 cut-off events. [2023-12-09 15:26:54,247 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:26:54,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 192 events. 15/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-12-09 15:26:54,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 402 flow [2023-12-09 15:26:54,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 183 transitions, 378 flow [2023-12-09 15:26:54,260 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:26:54,264 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@76d1cab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:26:54,264 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 15:26:54,292 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:26:54,293 INFO L124 PetriNetUnfolderBase]: 15/182 cut-off events. [2023-12-09 15:26:54,293 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:26:54,293 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:54,293 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:54,294 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:26:54,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:54,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1247658675, now seen corresponding path program 1 times [2023-12-09 15:26:54,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:54,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66631507] [2023-12-09 15:26:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:54,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:26:54,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:54,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66631507] [2023-12-09 15:26:54,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66631507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:26:54,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:26:54,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:26:54,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112624980] [2023-12-09 15:26:54,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:54,938 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:26:54,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:54,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:26:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:26:54,966 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 194 [2023-12-09 15:26:54,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 183 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:54,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:54,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 194 [2023-12-09 15:26:54,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:55,189 INFO L124 PetriNetUnfolderBase]: 58/308 cut-off events. [2023-12-09 15:26:55,189 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-12-09 15:26:55,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 308 events. 58/308 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 787 event pairs, 12 based on Foata normal form. 20/304 useless extension candidates. Maximal degree in co-relation 270. Up to 67 conditions per place. [2023-12-09 15:26:55,194 INFO L140 encePairwiseOnDemand]: 174/194 looper letters, 57 selfloop transitions, 5 changer transitions 6/182 dead transitions. [2023-12-09 15:26:55,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 182 transitions, 515 flow [2023-12-09 15:26:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:26:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:26:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 949 transitions. [2023-12-09 15:26:55,209 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.698821796759941 [2023-12-09 15:26:55,210 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 949 transitions. [2023-12-09 15:26:55,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 949 transitions. [2023-12-09 15:26:55,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:55,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 949 transitions. [2023-12-09 15:26:55,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.57142857142858) internal successors, (949), 7 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:55,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:55,226 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:55,229 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 6 predicate places. [2023-12-09 15:26:55,229 INFO L500 AbstractCegarLoop]: Abstraction has has 181 places, 182 transitions, 515 flow [2023-12-09 15:26:55,230 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:55,230 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:55,230 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:55,231 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:26:55,231 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:26:55,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:55,233 INFO L85 PathProgramCache]: Analyzing trace with hash -150899687, now seen corresponding path program 1 times [2023-12-09 15:26:55,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:55,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3196258] [2023-12-09 15:26:55,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:55,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:26:55,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:55,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3196258] [2023-12-09 15:26:55,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3196258] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:26:55,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:26:55,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:26:55,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302415481] [2023-12-09 15:26:55,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:55,460 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:26:55,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:55,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:26:55,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:26:55,462 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 194 [2023-12-09 15:26:55,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 182 transitions, 515 flow. Second operand has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:55,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:55,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 194 [2023-12-09 15:26:55,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:55,637 INFO L124 PetriNetUnfolderBase]: 59/358 cut-off events. [2023-12-09 15:26:55,637 INFO L125 PetriNetUnfolderBase]: For 80/88 co-relation queries the response was YES. [2023-12-09 15:26:55,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 358 events. 59/358 cut-off events. For 80/88 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 913 event pairs, 12 based on Foata normal form. 4/335 useless extension candidates. Maximal degree in co-relation 358. Up to 67 conditions per place. [2023-12-09 15:26:55,641 INFO L140 encePairwiseOnDemand]: 181/194 looper letters, 50 selfloop transitions, 10 changer transitions 16/196 dead transitions. [2023-12-09 15:26:55,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 196 transitions, 701 flow [2023-12-09 15:26:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:26:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:26:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1431 transitions. [2023-12-09 15:26:55,644 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7376288659793815 [2023-12-09 15:26:55,644 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1431 transitions. [2023-12-09 15:26:55,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1431 transitions. [2023-12-09 15:26:55,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:55,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1431 transitions. [2023-12-09 15:26:55,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 143.1) internal successors, (1431), 10 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:55,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 194.0) internal successors, (2134), 11 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:55,651 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 194.0) internal successors, (2134), 11 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:55,652 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 15 predicate places. [2023-12-09 15:26:55,652 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 196 transitions, 701 flow [2023-12-09 15:26:55,653 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:55,653 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:55,653 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:55,653 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:26:55,653 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:26:55,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:55,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1605728617, now seen corresponding path program 1 times [2023-12-09 15:26:55,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:55,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778438802] [2023-12-09 15:26:55,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:55,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:26:55,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:55,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778438802] [2023-12-09 15:26:55,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778438802] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:26:55,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:26:55,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:26:55,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519031175] [2023-12-09 15:26:55,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:55,893 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:26:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:55,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:26:55,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:26:55,895 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2023-12-09 15:26:55,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 196 transitions, 701 flow. Second operand has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:55,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:55,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2023-12-09 15:26:55,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:56,017 INFO L124 PetriNetUnfolderBase]: 121/576 cut-off events. [2023-12-09 15:26:56,018 INFO L125 PetriNetUnfolderBase]: For 386/426 co-relation queries the response was YES. [2023-12-09 15:26:56,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 576 events. 121/576 cut-off events. For 386/426 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2427 event pairs, 8 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 912. Up to 140 conditions per place. [2023-12-09 15:26:56,022 INFO L140 encePairwiseOnDemand]: 188/194 looper letters, 52 selfloop transitions, 8 changer transitions 16/227 dead transitions. [2023-12-09 15:26:56,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 227 transitions, 1027 flow [2023-12-09 15:26:56,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:26:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:26:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 693 transitions. [2023-12-09 15:26:56,024 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8930412371134021 [2023-12-09 15:26:56,024 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 693 transitions. [2023-12-09 15:26:56,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 693 transitions. [2023-12-09 15:26:56,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:56,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 693 transitions. [2023-12-09 15:26:56,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,028 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,029 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 18 predicate places. [2023-12-09 15:26:56,030 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 227 transitions, 1027 flow [2023-12-09 15:26:56,030 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,030 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:56,030 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:56,030 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:26:56,030 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:26:56,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash -978205847, now seen corresponding path program 2 times [2023-12-09 15:26:56,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:56,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645634396] [2023-12-09 15:26:56,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:56,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:26:56,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:56,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645634396] [2023-12-09 15:26:56,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645634396] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:26:56,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:26:56,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:26:56,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759007872] [2023-12-09 15:26:56,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:56,252 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:26:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:56,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:26:56,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:26:56,255 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 194 [2023-12-09 15:26:56,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 227 transitions, 1027 flow. Second operand has 5 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:56,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 194 [2023-12-09 15:26:56,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:56,461 INFO L124 PetriNetUnfolderBase]: 213/866 cut-off events. [2023-12-09 15:26:56,462 INFO L125 PetriNetUnfolderBase]: For 1118/1170 co-relation queries the response was YES. [2023-12-09 15:26:56,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 866 events. 213/866 cut-off events. For 1118/1170 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4739 event pairs, 8 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1725. Up to 236 conditions per place. [2023-12-09 15:26:56,467 INFO L140 encePairwiseOnDemand]: 183/194 looper letters, 77 selfloop transitions, 2 changer transitions 23/249 dead transitions. [2023-12-09 15:26:56,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 249 transitions, 1385 flow [2023-12-09 15:26:56,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:26:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:26:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 980 transitions. [2023-12-09 15:26:56,469 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7216494845360825 [2023-12-09 15:26:56,470 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 980 transitions. [2023-12-09 15:26:56,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 980 transitions. [2023-12-09 15:26:56,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:56,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 980 transitions. [2023-12-09 15:26:56,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,475 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,477 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 24 predicate places. [2023-12-09 15:26:56,477 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 249 transitions, 1385 flow [2023-12-09 15:26:56,477 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,477 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:56,477 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:56,477 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:26:56,478 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:26:56,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1884531504, now seen corresponding path program 1 times [2023-12-09 15:26:56,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:56,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037114213] [2023-12-09 15:26:56,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:56,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:26:56,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:56,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037114213] [2023-12-09 15:26:56,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037114213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:26:56,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:26:56,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:26:56,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407382810] [2023-12-09 15:26:56,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:56,561 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:26:56,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:56,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:26:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:26:56,562 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 194 [2023-12-09 15:26:56,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 249 transitions, 1385 flow. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:56,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 194 [2023-12-09 15:26:56,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:56,681 INFO L124 PetriNetUnfolderBase]: 210/898 cut-off events. [2023-12-09 15:26:56,681 INFO L125 PetriNetUnfolderBase]: For 2104/2198 co-relation queries the response was YES. [2023-12-09 15:26:56,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2681 conditions, 898 events. 210/898 cut-off events. For 2104/2198 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4849 event pairs, 11 based on Foata normal form. 16/822 useless extension candidates. Maximal degree in co-relation 1918. Up to 309 conditions per place. [2023-12-09 15:26:56,687 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 53 selfloop transitions, 7 changer transitions 27/263 dead transitions. [2023-12-09 15:26:56,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 263 transitions, 1689 flow [2023-12-09 15:26:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:26:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:26:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2023-12-09 15:26:56,688 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9106529209621993 [2023-12-09 15:26:56,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2023-12-09 15:26:56,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2023-12-09 15:26:56,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:56,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2023-12-09 15:26:56,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,693 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 26 predicate places. [2023-12-09 15:26:56,693 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 263 transitions, 1689 flow [2023-12-09 15:26:56,693 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,693 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:56,694 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:56,694 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:26:56,694 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:26:56,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:56,695 INFO L85 PathProgramCache]: Analyzing trace with hash 30558781, now seen corresponding path program 1 times [2023-12-09 15:26:56,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:56,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687813894] [2023-12-09 15:26:56,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:56,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:26:56,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:56,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687813894] [2023-12-09 15:26:56,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687813894] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:26:56,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:26:56,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:26:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644810054] [2023-12-09 15:26:56,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:56,828 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:26:56,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:56,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:26:56,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:26:56,829 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 194 [2023-12-09 15:26:56,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 263 transitions, 1689 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:56,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:56,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 194 [2023-12-09 15:26:56,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:57,062 INFO L124 PetriNetUnfolderBase]: 261/1239 cut-off events. [2023-12-09 15:26:57,062 INFO L125 PetriNetUnfolderBase]: For 4164/4326 co-relation queries the response was YES. [2023-12-09 15:26:57,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3866 conditions, 1239 events. 261/1239 cut-off events. For 4164/4326 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7114 event pairs, 37 based on Foata normal form. 16/1122 useless extension candidates. Maximal degree in co-relation 2108. Up to 389 conditions per place. [2023-12-09 15:26:57,068 INFO L140 encePairwiseOnDemand]: 183/194 looper letters, 79 selfloop transitions, 8 changer transitions 71/311 dead transitions. [2023-12-09 15:26:57,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 311 transitions, 2352 flow [2023-12-09 15:26:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:26:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:26:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1364 transitions. [2023-12-09 15:26:57,071 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7812142038946163 [2023-12-09 15:26:57,071 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1364 transitions. [2023-12-09 15:26:57,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1364 transitions. [2023-12-09 15:26:57,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:57,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1364 transitions. [2023-12-09 15:26:57,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 151.55555555555554) internal successors, (1364), 9 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:57,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:57,076 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:57,078 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 34 predicate places. [2023-12-09 15:26:57,078 INFO L500 AbstractCegarLoop]: Abstraction has has 209 places, 311 transitions, 2352 flow [2023-12-09 15:26:57,079 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:26:57,079 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:57,080 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:57,080 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:26:57,080 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:26:57,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash -829900857, now seen corresponding path program 1 times [2023-12-09 15:26:57,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:57,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639267189] [2023-12-09 15:26:57,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:26:58,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:58,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639267189] [2023-12-09 15:26:58,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639267189] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:26:58,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743449428] [2023-12-09 15:26:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:58,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:26:58,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:26:58,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:26:58,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:26:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:58,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-09 15:26:58,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:26:59,698 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-09 15:26:59,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2023-12-09 15:26:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:26:59,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:00,185 INFO L349 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2023-12-09 15:27:00,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 99 [2023-12-09 15:27:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743449428] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:01,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:01,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 46 [2023-12-09 15:27:01,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734731692] [2023-12-09 15:27:01,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:01,525 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-09 15:27:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:01,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-09 15:27:01,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1724, Unknown=0, NotChecked=0, Total=2070 [2023-12-09 15:27:01,530 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 194 [2023-12-09 15:27:01,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 311 transitions, 2352 flow. Second operand has 46 states, 46 states have (on average 59.54347826086956) internal successors, (2739), 46 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:01,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:01,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 194 [2023-12-09 15:27:01,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:11,600 INFO L124 PetriNetUnfolderBase]: 5626/12062 cut-off events. [2023-12-09 15:27:11,600 INFO L125 PetriNetUnfolderBase]: For 33018/33150 co-relation queries the response was YES. [2023-12-09 15:27:11,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42192 conditions, 12062 events. 5626/12062 cut-off events. For 33018/33150 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 105717 event pairs, 355 based on Foata normal form. 0/10868 useless extension candidates. Maximal degree in co-relation 23029. Up to 3274 conditions per place. [2023-12-09 15:27:11,663 INFO L140 encePairwiseOnDemand]: 143/194 looper letters, 848 selfloop transitions, 347 changer transitions 430/1669 dead transitions. [2023-12-09 15:27:11,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 1669 transitions, 16769 flow [2023-12-09 15:27:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2023-12-09 15:27:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2023-12-09 15:27:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 9345 transitions. [2023-12-09 15:27:11,680 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.306815943266137 [2023-12-09 15:27:11,680 INFO L72 ComplementDD]: Start complementDD. Operand 157 states and 9345 transitions. [2023-12-09 15:27:11,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 9345 transitions. [2023-12-09 15:27:11,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:11,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 157 states and 9345 transitions. [2023-12-09 15:27:11,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 158 states, 157 states have (on average 59.52229299363057) internal successors, (9345), 157 states have internal predecessors, (9345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:11,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 158 states, 158 states have (on average 194.0) internal successors, (30652), 158 states have internal predecessors, (30652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:11,731 INFO L81 ComplementDD]: Finished complementDD. Result has 158 states, 158 states have (on average 194.0) internal successors, (30652), 158 states have internal predecessors, (30652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:11,731 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 190 predicate places. [2023-12-09 15:27:11,731 INFO L500 AbstractCegarLoop]: Abstraction has has 365 places, 1669 transitions, 16769 flow [2023-12-09 15:27:11,732 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 59.54347826086956) internal successors, (2739), 46 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:11,732 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:11,732 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:11,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:11,943 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:11,944 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:27:11,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash 330472307, now seen corresponding path program 2 times [2023-12-09 15:27:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:11,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585494100] [2023-12-09 15:27:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:11,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:27:12,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:12,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585494100] [2023-12-09 15:27:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585494100] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:12,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828543757] [2023-12-09 15:27:12,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:27:12,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:12,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:12,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:12,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:27:12,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:27:12,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:12,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-09 15:27:12,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:27:12,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:27:12,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828543757] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:12,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:12,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2023-12-09 15:27:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987091040] [2023-12-09 15:27:12,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:12,371 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:27:12,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:12,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:27:12,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:27:12,372 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2023-12-09 15:27:12,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 1669 transitions, 16769 flow. Second operand has 8 states, 8 states have (on average 167.25) internal successors, (1338), 8 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:12,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:12,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2023-12-09 15:27:12,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:14,632 INFO L124 PetriNetUnfolderBase]: 6990/14039 cut-off events. [2023-12-09 15:27:14,632 INFO L125 PetriNetUnfolderBase]: For 54427/54629 co-relation queries the response was YES. [2023-12-09 15:27:14,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57103 conditions, 14039 events. 6990/14039 cut-off events. For 54427/54629 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 120975 event pairs, 392 based on Foata normal form. 6/13010 useless extension candidates. Maximal degree in co-relation 32054. Up to 4281 conditions per place. [2023-12-09 15:27:14,805 INFO L140 encePairwiseOnDemand]: 188/194 looper letters, 805 selfloop transitions, 410 changer transitions 353/2065 dead transitions. [2023-12-09 15:27:14,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 2065 transitions, 25058 flow [2023-12-09 15:27:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:27:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:27:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1355 transitions. [2023-12-09 15:27:14,807 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8730670103092784 [2023-12-09 15:27:14,807 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1355 transitions. [2023-12-09 15:27:14,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1355 transitions. [2023-12-09 15:27:14,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:14,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1355 transitions. [2023-12-09 15:27:14,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 169.375) internal successors, (1355), 8 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:14,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 194.0) internal successors, (1746), 9 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:14,811 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 194.0) internal successors, (1746), 9 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:14,812 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 190 predicate places. [2023-12-09 15:27:14,812 INFO L500 AbstractCegarLoop]: Abstraction has has 365 places, 2065 transitions, 25058 flow [2023-12-09 15:27:14,813 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.25) internal successors, (1338), 8 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:14,813 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:14,813 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:14,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:15,018 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-09 15:27:15,019 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:27:15,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1753418197, now seen corresponding path program 3 times [2023-12-09 15:27:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124214761] [2023-12-09 15:27:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:16,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:16,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124214761] [2023-12-09 15:27:16,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124214761] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:16,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959111850] [2023-12-09 15:27:16,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:27:16,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:16,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:16,577 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:16,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:27:16,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:27:16,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:16,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-09 15:27:16,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:16,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-09 15:27:17,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:27:17,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-09 15:27:17,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-09 15:27:17,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:27:17,997 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-09 15:27:17,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-09 15:27:18,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:27:18,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:27:18,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-09 15:27:19,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2023-12-09 15:27:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:19,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:23,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:23,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2023-12-09 15:27:23,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:23,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2532 treesize of output 2444 [2023-12-09 15:27:23,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:23,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1176 treesize of output 1048 [2023-12-09 15:27:23,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:23,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1008 treesize of output 808 [2023-12-09 15:27:23,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:23,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 768 treesize of output 676 [2023-12-09 15:27:25,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:25,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2023-12-09 15:27:25,115 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:27:25,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 830 treesize of output 798 [2023-12-09 15:27:25,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:25,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 394 treesize of output 339 [2023-12-09 15:27:25,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:25,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 322 treesize of output 279 [2023-12-09 15:27:25,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 214 [2023-12-09 15:27:26,960 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:27:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:26,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959111850] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:26,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:26,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 32] total 85 [2023-12-09 15:27:26,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680878671] [2023-12-09 15:27:26,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:26,964 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2023-12-09 15:27:26,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:26,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2023-12-09 15:27:26,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=6438, Unknown=66, NotChecked=0, Total=7140 [2023-12-09 15:27:26,969 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 194 [2023-12-09 15:27:26,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 2065 transitions, 25058 flow. Second operand has 85 states, 85 states have (on average 47.870588235294115) internal successors, (4069), 85 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:26,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:26,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 194 [2023-12-09 15:27:26,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:44,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:27:48,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:27:51,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:27:53,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:27:55,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:15,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:17,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:23,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:34,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:35,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:37,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:42,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:50,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:53,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:59,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:27,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:29,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:31,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:34,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:36,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:39,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~end~0 1)) (.cse9 (= c_~start~0 c_~end~0)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse20 (* c_~start~0 4)) (.cse8 (not (= (mod c_~ok~0 256) 0))) (.cse24 (* c_~end~0 4))) (let ((.cse10 (let ((.cse44 (+ .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (~i~0 Int)) (let ((.cse47 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_181) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182))) (let ((.cse45 (store .cse47 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (let ((.cse43 (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse46 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse43 .cse44) (select (select .cse45 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) .cse46))) (< (select .cse43 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select (select .cse47 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) .cse46) 1))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)))) (or (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int) (~i~0 Int)) (or (not (let ((.cse48 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_181) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (= (select (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse44) (select (select .cse48 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)))) .cse8)))) (.cse15 (+ .cse20 c_~queue~0.offset)) (.cse13 (+ .cse24 c_~queue~0.offset)) (.cse30 (let ((.cse42 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0))))) (and (or .cse42 .cse9) (or .cse8 .cse42) (not (= .cse0 0))))) (.cse2 (+ |c_#StackHeapBarrier| 1)) (.cse3 (< c_~end~0 0)) (.cse4 (< c_~start~0 0)) (.cse5 (< c_~n~0 .cse1)) (.cse6 (< c_~n~0 (+ c_~start~0 1)))) (and (= .cse0 1) (or (< 0 .cse1) (< c_~start~0 .cse1)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or (< (+ c_~start~0 c_~n~0) 2) (not (= c_~end~0 0)) (< c_~start~0 1)) (<= .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse3 .cse4 .cse5 .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (let ((.cse7 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| 1)))))) (and (or .cse7 .cse8) (or .cse7 .cse9) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25|))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_25| 1))))))) (or .cse10 .cse3 .cse4 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post22#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6) (or .cse3 .cse4 (let ((.cse12 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (forall ((v_ArrVal_183 (Array Int Int))) (not (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (= (select (select .cse11 c_~A~0.base) .cse12) (select (select .cse11 c_~queue~0.base) .cse13))))) .cse8) (forall ((v_ArrVal_183 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (let ((.cse14 (select .cse16 c_~queue~0.base))) (or (< (select .cse14 .cse15) (+ c_~v_old~0 1)) (not (= (select (select .cse16 c_~A~0.base) .cse12) (select .cse14 .cse13))))))))) .cse5 .cse6 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)) (or .cse3 .cse4 .cse5 .cse6 (let ((.cse18 (+ .cse24 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (or (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int) (~i~0 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (not (let ((.cse17 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_181) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (= (select (select .cse17 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse18)))))) .cse8) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (~i~0 Int)) (let ((.cse21 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_181) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182))) (let ((.cse23 (store .cse21 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (let ((.cse22 (+ (* ~i~0 4) ~A~0.offset)) (.cse19 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse19 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ (select (select .cse21 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) .cse22) 1)) (not (= (select (select .cse23 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) .cse22) (select .cse19 .cse18))))))))))))) (or .cse3 (and (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (~i~0 Int)) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182))) (let ((.cse25 (store .cse28 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (let ((.cse27 (select .cse25 c_~queue~0.base)) (.cse26 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse25 |c_ULTIMATE.start_main_#t~ret13#1.base|) .cse26) (select .cse27 .cse13))) (< (select .cse27 .cse15) (+ (select (select .cse28 |c_ULTIMATE.start_main_#t~ret13#1.base|) .cse26) 1))))))) (or (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (~i~0 Int)) (not (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (= (select (select .cse29 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse29 c_~queue~0.base) .cse13))))) .cse8)) .cse4 .cse5 .cse6) (or (< c_~end~0 1) (< c_~n~0 2)) (or .cse10 .cse3 .cse4 .cse5 .cse6) (<= c_~new~0 c_~v_old~0) (= c_~ok~0 1) (or .cse3 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse5 .cse6 .cse30) (or (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (~i~0 Int)) (let ((.cse34 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_181) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182))) (let ((.cse32 (store .cse34 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (let ((.cse31 (select .cse32 c_~queue~0.base)) (.cse33 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse31 .cse13) (select (select .cse32 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) .cse33))) (< (select .cse31 .cse15) (+ (select (select .cse34 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) .cse33) 1))))))))) (or .cse8 (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int) (~i~0 Int)) (or (not (let ((.cse35 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_181) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (= (select (select .cse35 c_~queue~0.base) .cse13) (select (select .cse35 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) (+ (* ~i~0 4) ~A~0.offset))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)))))) .cse3 .cse4 .cse5 .cse6) (= c_~queue~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (or .cse3 .cse4 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6 .cse30) (<= c_~start~0 c_~end~0) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse3 .cse4 .cse5 .cse6 (let ((.cse40 (+ .cse24 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (~i~0 Int)) (let ((.cse37 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_181) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182))) (let ((.cse39 (store .cse37 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (let ((.cse38 (+ (* ~i~0 4) ~A~0.offset)) (.cse36 (select .cse39 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< (select .cse36 (+ .cse20 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ (select (select .cse37 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) .cse38) 1)) (not (= (select (select .cse39 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) .cse38) (select .cse36 .cse40)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)))) (or .cse8 (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int) (~i~0 Int)) (or (not (let ((.cse41 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_181) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_183))) (= (select (select .cse41 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse41 |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse40)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0))))))))))) is different from false [2023-12-09 15:29:42,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:52,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:54,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:57,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:59,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:01,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:04,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:06,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:10,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:12,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:14,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:24,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:26,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:28,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:58,417 INFO L124 PetriNetUnfolderBase]: 17323/33672 cut-off events. [2023-12-09 15:30:58,417 INFO L125 PetriNetUnfolderBase]: For 153583/154815 co-relation queries the response was YES. [2023-12-09 15:30:58,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166247 conditions, 33672 events. 17323/33672 cut-off events. For 153583/154815 co-relation queries the response was YES. Maximal size of possible extension queue 1535. Compared 329671 event pairs, 576 based on Foata normal form. 161/31288 useless extension candidates. Maximal degree in co-relation 111689. Up to 11242 conditions per place. [2023-12-09 15:30:58,635 INFO L140 encePairwiseOnDemand]: 135/194 looper letters, 3161 selfloop transitions, 1127 changer transitions 746/5216 dead transitions. [2023-12-09 15:30:58,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 5216 transitions, 73497 flow [2023-12-09 15:30:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2023-12-09 15:30:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2023-12-09 15:30:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 8192 transitions. [2023-12-09 15:30:58,644 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.2574805129494594 [2023-12-09 15:30:58,645 INFO L72 ComplementDD]: Start complementDD. Operand 164 states and 8192 transitions. [2023-12-09 15:30:58,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 8192 transitions. [2023-12-09 15:30:58,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:30:58,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 164 states and 8192 transitions. [2023-12-09 15:30:58,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 165 states, 164 states have (on average 49.951219512195124) internal successors, (8192), 164 states have internal predecessors, (8192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:58,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 165 states, 165 states have (on average 194.0) internal successors, (32010), 165 states have internal predecessors, (32010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:58,685 INFO L81 ComplementDD]: Finished complementDD. Result has 165 states, 165 states have (on average 194.0) internal successors, (32010), 165 states have internal predecessors, (32010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:58,685 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 353 predicate places. [2023-12-09 15:30:58,685 INFO L500 AbstractCegarLoop]: Abstraction has has 528 places, 5216 transitions, 73497 flow [2023-12-09 15:30:58,686 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 47.870588235294115) internal successors, (4069), 85 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:30:58,686 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:30:58,687 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:30:58,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-09 15:30:58,892 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:30:58,892 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:30:58,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:30:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2079399705, now seen corresponding path program 4 times [2023-12-09 15:30:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:30:58,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354443086] [2023-12-09 15:30:58,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:30:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:30:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:31:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:00,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:31:00,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354443086] [2023-12-09 15:31:00,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354443086] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:31:00,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554777571] [2023-12-09 15:31:00,231 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:31:00,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:00,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:31:00,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:31:00,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:31:00,350 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:31:00,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:31:00,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-09 15:31:00,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:31:00,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-09 15:31:00,509 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 15:31:00,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-09 15:31:01,630 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-09 15:31:01,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2023-12-09 15:31:01,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-09 15:31:01,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-09 15:31:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:01,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:31:02,594 INFO L349 Elim1Store]: treesize reduction 19, result has 59.6 percent of original size [2023-12-09 15:31:02,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 64 [2023-12-09 15:31:02,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-12-09 15:31:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:05,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554777571] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:31:05,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:31:05,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28, 27] total 66 [2023-12-09 15:31:05,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411506244] [2023-12-09 15:31:05,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:31:05,122 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-09 15:31:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:31:05,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-09 15:31:05,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=3898, Unknown=1, NotChecked=0, Total=4290 [2023-12-09 15:31:05,125 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 194 [2023-12-09 15:31:05,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 5216 transitions, 73497 flow. Second operand has 66 states, 66 states have (on average 47.78787878787879) internal successors, (3154), 66 states have internal predecessors, (3154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:31:05,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:31:05,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 194 [2023-12-09 15:31:05,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:31:16,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2023-12-09 15:31:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-12-09 15:31:18,662 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-09 15:31:18,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-09 15:31:18,695 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:31:18,695 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:31:18,864 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:18,864 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (66states, 43/194 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 4047 conditions, 810 events (138/809 cut-off events. For 2647/2769 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4894 event pairs, 18 based on Foata normal form. 26/849 useless extension candidates. Maximal degree in co-relation 2520. Up to 188 conditions per place.). [2023-12-09 15:31:18,866 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-12-09 15:31:18,866 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-12-09 15:31:18,866 INFO L457 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-12-09 15:31:18,869 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:31:18,869 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:31:18,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:31:18 BasicIcfg [2023-12-09 15:31:18,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:31:18,871 INFO L158 Benchmark]: Toolchain (without parser) took 265456.06ms. Allocated memory was 299.9MB in the beginning and 959.4MB in the end (delta: 659.6MB). Free memory was 247.9MB in the beginning and 188.2MB in the end (delta: 59.7MB). Peak memory consumption was 720.3MB. Max. memory is 8.0GB. [2023-12-09 15:31:18,871 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 202.4MB. Free memory was 148.4MB in the beginning and 148.2MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:31:18,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.85ms. Allocated memory is still 299.9MB. Free memory was 247.9MB in the beginning and 235.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-09 15:31:18,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.52ms. Allocated memory is still 299.9MB. Free memory was 235.8MB in the beginning and 233.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:31:18,872 INFO L158 Benchmark]: Boogie Preprocessor took 33.82ms. Allocated memory is still 299.9MB. Free memory was 233.8MB in the beginning and 231.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:31:18,872 INFO L158 Benchmark]: RCFGBuilder took 417.88ms. Allocated memory is still 299.9MB. Free memory was 231.7MB in the beginning and 205.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-09 15:31:18,872 INFO L158 Benchmark]: TraceAbstraction took 264779.62ms. Allocated memory was 299.9MB in the beginning and 959.4MB in the end (delta: 659.6MB). Free memory was 204.9MB in the beginning and 188.2MB in the end (delta: 16.7MB). Peak memory consumption was 677.3MB. Max. memory is 8.0GB. [2023-12-09 15:31:18,873 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 202.4MB. Free memory was 148.4MB in the beginning and 148.2MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.85ms. Allocated memory is still 299.9MB. Free memory was 247.9MB in the beginning and 235.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.52ms. Allocated memory is still 299.9MB. Free memory was 235.8MB in the beginning and 233.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.82ms. Allocated memory is still 299.9MB. Free memory was 233.8MB in the beginning and 231.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 417.88ms. Allocated memory is still 299.9MB. Free memory was 231.7MB in the beginning and 205.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 264779.62ms. Allocated memory was 299.9MB in the beginning and 959.4MB in the end (delta: 659.6MB). Free memory was 204.9MB in the beginning and 188.2MB in the end (delta: 16.7MB). Peak memory consumption was 677.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (66states, 43/194 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 4047 conditions, 810 events (138/809 cut-off events. For 2647/2769 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4894 event pairs, 18 based on Foata normal form. 26/849 useless extension candidates. Maximal degree in co-relation 2520. Up to 188 conditions per place.). - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (66states, 43/194 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 4047 conditions, 810 events (138/809 cut-off events. For 2647/2769 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4894 event pairs, 18 based on Foata normal form. 26/849 useless extension candidates. Maximal degree in co-relation 2520. Up to 188 conditions per place.). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (66states, 43/194 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 4047 conditions, 810 events (138/809 cut-off events. For 2647/2769 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4894 event pairs, 18 based on Foata normal form. 26/849 useless extension candidates. Maximal degree in co-relation 2520. Up to 188 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 206 locations, 3 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: 264.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 239.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 358 mSolverCounterUnknown, 10028 SdHoareTripleChecker+Valid, 87.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10028 mSDsluCounter, 11153 SdHoareTripleChecker+Invalid, 85.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 333 IncrementalHoareTripleChecker+Unchecked, 10583 mSDsCounter, 874 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16946 IncrementalHoareTripleChecker+Invalid, 18511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 874 mSolverCounterUnsat, 570 mSDtfsCounter, 16946 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1825 GetRequests, 1208 SyntacticMatches, 4 SemanticMatches, 613 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35594 ImplicationChecksByTransitivity, 144.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73497occurred in iteration=9, InterpolantAutomatonStates: 369, 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, 23.5s InterpolantComputationTime, 2201 NumberOfCodeBlocks, 2201 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2843 ConstructedInterpolants, 185 QuantifiedInterpolants, 43595 SizeOfPredicates, 120 NumberOfNonLiveVariables, 1456 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 28/59 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown