/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 21:03:28,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 21:03:28,126 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-VariableLbe.epf [2023-08-25 21:03:28,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 21:03:28,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 21:03:28,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 21:03:28,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 21:03:28,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 21:03:28,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 21:03:28,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 21:03:28,167 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 21:03:28,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 21:03:28,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 21:03:28,168 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 21:03:28,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 21:03:28,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 21:03:28,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 21:03:28,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 21:03:28,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 21:03:28,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 21:03:28,170 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 21:03:28,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 21:03:28,173 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 21:03:28,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 21:03:28,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 21:03:28,174 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 21:03:28,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 21:03:28,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:03:28,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 21:03:28,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 21:03:28,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 21:03:28,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 21:03:28,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 21:03:28,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 21:03:28,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 21:03:28,177 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 21:03:28,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 21:03:28,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 21:03:28,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 21:03:28,473 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 21:03:28,473 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 21:03:28,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2023-08-25 21:03:29,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 21:03:29,771 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 21:03:29,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2023-08-25 21:03:29,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6868f6e9/a84b72b15eee4eb38de600f3e61462a2/FLAGf708090a3 [2023-08-25 21:03:29,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6868f6e9/a84b72b15eee4eb38de600f3e61462a2 [2023-08-25 21:03:29,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 21:03:29,796 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 21:03:29,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 21:03:29,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 21:03:29,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 21:03:29,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:03:29" (1/1) ... [2023-08-25 21:03:29,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29963877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:29, skipping insertion in model container [2023-08-25 21:03:29,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:03:29" (1/1) ... [2023-08-25 21:03:29,832 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 21:03:30,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:03:30,041 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 21:03:30,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:03:30,110 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 21:03:30,111 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 21:03:30,117 INFO L206 MainTranslator]: Completed translation [2023-08-25 21:03:30,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30 WrapperNode [2023-08-25 21:03:30,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 21:03:30,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 21:03:30,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 21:03:30,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 21:03:30,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (1/1) ... [2023-08-25 21:03:30,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (1/1) ... [2023-08-25 21:03:30,177 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 507 [2023-08-25 21:03:30,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 21:03:30,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 21:03:30,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 21:03:30,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 21:03:30,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (1/1) ... [2023-08-25 21:03:30,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (1/1) ... [2023-08-25 21:03:30,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (1/1) ... [2023-08-25 21:03:30,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (1/1) ... [2023-08-25 21:03:30,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (1/1) ... [2023-08-25 21:03:30,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (1/1) ... [2023-08-25 21:03:30,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (1/1) ... [2023-08-25 21:03:30,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (1/1) ... [2023-08-25 21:03:30,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 21:03:30,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 21:03:30,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 21:03:30,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 21:03:30,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (1/1) ... [2023-08-25 21:03:30,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:03:30,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:03:30,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 21:03:30,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 21:03:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 21:03:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 21:03:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 21:03:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 21:03:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 21:03:30,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 21:03:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 21:03:30,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 21:03:30,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 21:03:30,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 21:03:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-25 21:03:30,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-25 21:03:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 21:03:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 21:03:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 21:03:30,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 21:03:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 21:03:30,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 21:03:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 21:03:30,296 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 21:03:30,406 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 21:03:30,407 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 21:03:31,044 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 21:03:31,447 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 21:03:31,448 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-25 21:03:31,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:03:31 BoogieIcfgContainer [2023-08-25 21:03:31,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 21:03:31,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 21:03:31,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 21:03:31,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 21:03:31,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 09:03:29" (1/3) ... [2023-08-25 21:03:31,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f70aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:03:31, skipping insertion in model container [2023-08-25 21:03:31,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:03:30" (2/3) ... [2023-08-25 21:03:31,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f70aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:03:31, skipping insertion in model container [2023-08-25 21:03:31,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:03:31" (3/3) ... [2023-08-25 21:03:31,459 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2023-08-25 21:03:31,475 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 21:03:31,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 73 error locations. [2023-08-25 21:03:31,476 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 21:03:31,609 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-25 21:03:31,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 388 places, 393 transitions, 818 flow [2023-08-25 21:03:31,824 INFO L124 PetriNetUnfolderBase]: 18/389 cut-off events. [2023-08-25 21:03:31,824 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-25 21:03:31,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 389 events. 18/389 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 491 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 326. Up to 3 conditions per place. [2023-08-25 21:03:31,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 388 places, 393 transitions, 818 flow [2023-08-25 21:03:31,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 371 places, 376 transitions, 776 flow [2023-08-25 21:03:31,845 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 21:03:31,858 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 371 places, 376 transitions, 776 flow [2023-08-25 21:03:31,862 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 371 places, 376 transitions, 776 flow [2023-08-25 21:03:31,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 371 places, 376 transitions, 776 flow [2023-08-25 21:03:31,927 INFO L124 PetriNetUnfolderBase]: 18/376 cut-off events. [2023-08-25 21:03:31,927 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-25 21:03:31,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 376 events. 18/376 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 490 event pairs, 0 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 326. Up to 3 conditions per place. [2023-08-25 21:03:31,937 INFO L119 LiptonReduction]: Number of co-enabled transitions 10944 [2023-08-25 21:03:43,975 INFO L134 LiptonReduction]: Checked pairs total: 62603 [2023-08-25 21:03:43,975 INFO L136 LiptonReduction]: Total number of compositions: 396 [2023-08-25 21:03:43,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 21:03:43,992 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@879ef96, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 21:03:43,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 126 error locations. [2023-08-25 21:03:43,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 21:03:43,993 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 21:03:43,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 21:03:43,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:43,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 21:03:43,994 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:43,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:43,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1972, now seen corresponding path program 1 times [2023-08-25 21:03:44,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:44,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293383865] [2023-08-25 21:03:44,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:44,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:03:44,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:44,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293383865] [2023-08-25 21:03:44,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293383865] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:44,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:44,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 21:03:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644372000] [2023-08-25 21:03:44,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:44,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 21:03:44,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:44,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 21:03:44,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 21:03:44,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 789 [2023-08-25 21:03:44,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 266 flow. Second operand has 2 states, 2 states have (on average 312.5) internal successors, (625), 2 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:44,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:44,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 789 [2023-08-25 21:03:44,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:44,612 INFO L124 PetriNetUnfolderBase]: 2173/3652 cut-off events. [2023-08-25 21:03:44,613 INFO L125 PetriNetUnfolderBase]: For 289/289 co-relation queries the response was YES. [2023-08-25 21:03:44,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6921 conditions, 3652 events. 2173/3652 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19682 event pairs, 1717 based on Foata normal form. 0/3026 useless extension candidates. Maximal degree in co-relation 5722. Up to 2951 conditions per place. [2023-08-25 21:03:44,636 INFO L140 encePairwiseOnDemand]: 721/789 looper letters, 36 selfloop transitions, 0 changer transitions 0/53 dead transitions. [2023-08-25 21:03:44,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 202 flow [2023-08-25 21:03:44,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 21:03:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 21:03:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 728 transitions. [2023-08-25 21:03:44,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46134347275031684 [2023-08-25 21:03:44,655 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 728 transitions. [2023-08-25 21:03:44,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 728 transitions. [2023-08-25 21:03:44,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:44,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 728 transitions. [2023-08-25 21:03:44,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 364.0) internal successors, (728), 2 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:44,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 789.0) internal successors, (2367), 3 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:44,674 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 789.0) internal successors, (2367), 3 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:44,676 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 266 flow. Second operand 2 states and 728 transitions. [2023-08-25 21:03:44,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 202 flow [2023-08-25 21:03:44,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 186 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-25 21:03:44,687 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 114 flow [2023-08-25 21:03:44,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2023-08-25 21:03:44,692 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -75 predicate places. [2023-08-25 21:03:44,693 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 114 flow [2023-08-25 21:03:44,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 312.5) internal successors, (625), 2 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:44,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:44,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 21:03:44,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 21:03:44,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:44,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:44,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1189152977, now seen corresponding path program 1 times [2023-08-25 21:03:44,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:44,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647684865] [2023-08-25 21:03:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:44,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:03:44,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:44,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647684865] [2023-08-25 21:03:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647684865] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:44,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:44,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:03:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805478573] [2023-08-25 21:03:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:44,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:03:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:44,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:03:44,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:03:44,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 789 [2023-08-25 21:03:44,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:44,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:44,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 789 [2023-08-25 21:03:44,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:45,284 INFO L124 PetriNetUnfolderBase]: 2645/4384 cut-off events. [2023-08-25 21:03:45,284 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-08-25 21:03:45,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8127 conditions, 4384 events. 2645/4384 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 23499 event pairs, 2127 based on Foata normal form. 0/3676 useless extension candidates. Maximal degree in co-relation 8124. Up to 3584 conditions per place. [2023-08-25 21:03:45,306 INFO L140 encePairwiseOnDemand]: 787/789 looper letters, 36 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-08-25 21:03:45,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 186 flow [2023-08-25 21:03:45,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:03:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:03:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 938 transitions. [2023-08-25 21:03:45,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39628221377270806 [2023-08-25 21:03:45,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 938 transitions. [2023-08-25 21:03:45,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 938 transitions. [2023-08-25 21:03:45,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:45,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 938 transitions. [2023-08-25 21:03:45,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:45,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:45,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:45,318 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 114 flow. Second operand 3 states and 938 transitions. [2023-08-25 21:03:45,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 186 flow [2023-08-25 21:03:45,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:03:45,319 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 114 flow [2023-08-25 21:03:45,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-08-25 21:03:45,320 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -74 predicate places. [2023-08-25 21:03:45,321 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 114 flow [2023-08-25 21:03:45,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:45,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:45,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:03:45,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 21:03:45,322 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:45,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash -602145056, now seen corresponding path program 1 times [2023-08-25 21:03:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:45,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416436504] [2023-08-25 21:03:45,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:45,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:03:45,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416436504] [2023-08-25 21:03:45,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416436504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:45,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:45,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:03:45,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147676001] [2023-08-25 21:03:45,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:45,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:03:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:45,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:03:45,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:03:45,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 789 [2023-08-25 21:03:45,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 272.5) internal successors, (1635), 6 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:45,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:45,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 789 [2023-08-25 21:03:45,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:46,812 INFO L124 PetriNetUnfolderBase]: 5673/7551 cut-off events. [2023-08-25 21:03:46,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 21:03:46,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15231 conditions, 7551 events. 5673/7551 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 30380 event pairs, 909 based on Foata normal form. 0/6405 useless extension candidates. Maximal degree in co-relation 15227. Up to 3208 conditions per place. [2023-08-25 21:03:46,848 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 106 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2023-08-25 21:03:46,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 111 transitions, 452 flow [2023-08-25 21:03:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:03:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:03:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1731 transitions. [2023-08-25 21:03:46,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3656527249683143 [2023-08-25 21:03:46,854 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1731 transitions. [2023-08-25 21:03:46,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1731 transitions. [2023-08-25 21:03:46,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:46,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1731 transitions. [2023-08-25 21:03:46,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 288.5) internal successors, (1731), 6 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:46,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:46,868 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:46,869 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 114 flow. Second operand 6 states and 1731 transitions. [2023-08-25 21:03:46,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 111 transitions, 452 flow [2023-08-25 21:03:46,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:03:46,871 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 119 flow [2023-08-25 21:03:46,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=119, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2023-08-25 21:03:46,872 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -71 predicate places. [2023-08-25 21:03:46,872 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 119 flow [2023-08-25 21:03:46,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 272.5) internal successors, (1635), 6 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:46,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:46,874 INFO L208 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] [2023-08-25 21:03:46,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 21:03:46,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:46,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:46,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1526995189, now seen corresponding path program 1 times [2023-08-25 21:03:46,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:46,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467918466] [2023-08-25 21:03:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:03:47,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:47,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467918466] [2023-08-25 21:03:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467918466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:47,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:47,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:03:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283861029] [2023-08-25 21:03:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:47,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:03:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:47,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:03:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:03:47,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 789 [2023-08-25 21:03:47,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 273.8333333333333) internal successors, (1643), 6 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:47,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:47,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 789 [2023-08-25 21:03:47,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:47,977 INFO L124 PetriNetUnfolderBase]: 5548/7376 cut-off events. [2023-08-25 21:03:47,977 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2023-08-25 21:03:47,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15681 conditions, 7376 events. 5548/7376 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 29355 event pairs, 3864 based on Foata normal form. 0/6300 useless extension candidates. Maximal degree in co-relation 15677. Up to 6318 conditions per place. [2023-08-25 21:03:48,013 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 89 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2023-08-25 21:03:48,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 391 flow [2023-08-25 21:03:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:03:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:03:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1714 transitions. [2023-08-25 21:03:48,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3620616814533164 [2023-08-25 21:03:48,018 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1714 transitions. [2023-08-25 21:03:48,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1714 transitions. [2023-08-25 21:03:48,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:48,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1714 transitions. [2023-08-25 21:03:48,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 285.6666666666667) internal successors, (1714), 6 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:48,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:48,032 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:48,032 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 119 flow. Second operand 6 states and 1714 transitions. [2023-08-25 21:03:48,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 391 flow [2023-08-25 21:03:48,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 94 transitions, 384 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 21:03:48,038 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 118 flow [2023-08-25 21:03:48,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-25 21:03:48,039 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -71 predicate places. [2023-08-25 21:03:48,040 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 118 flow [2023-08-25 21:03:48,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.8333333333333) internal successors, (1643), 6 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:48,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:48,041 INFO L208 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] [2023-08-25 21:03:48,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 21:03:48,041 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:48,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:48,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1633722716, now seen corresponding path program 1 times [2023-08-25 21:03:48,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:48,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196579291] [2023-08-25 21:03:48,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:48,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:03:48,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:48,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196579291] [2023-08-25 21:03:48,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196579291] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:48,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:48,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 21:03:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307190227] [2023-08-25 21:03:48,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:48,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 21:03:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:48,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 21:03:48,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 21:03:48,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 789 [2023-08-25 21:03:48,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:48,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:48,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 789 [2023-08-25 21:03:48,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:48,506 INFO L124 PetriNetUnfolderBase]: 2205/3192 cut-off events. [2023-08-25 21:03:48,506 INFO L125 PetriNetUnfolderBase]: For 117/142 co-relation queries the response was YES. [2023-08-25 21:03:48,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6456 conditions, 3192 events. 2205/3192 cut-off events. For 117/142 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14391 event pairs, 145 based on Foata normal form. 5/2774 useless extension candidates. Maximal degree in co-relation 6452. Up to 1160 conditions per place. [2023-08-25 21:03:48,521 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 79 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-08-25 21:03:48,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 393 flow [2023-08-25 21:03:48,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 21:03:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 21:03:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1621 transitions. [2023-08-25 21:03:48,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4108998732572877 [2023-08-25 21:03:48,526 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1621 transitions. [2023-08-25 21:03:48,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1621 transitions. [2023-08-25 21:03:48,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:48,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1621 transitions. [2023-08-25 21:03:48,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 324.2) internal successors, (1621), 5 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:48,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:48,535 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:48,535 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 118 flow. Second operand 5 states and 1621 transitions. [2023-08-25 21:03:48,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 393 flow [2023-08-25 21:03:48,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 98 transitions, 377 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 21:03:48,538 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 139 flow [2023-08-25 21:03:48,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-08-25 21:03:48,539 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -69 predicate places. [2023-08-25 21:03:48,539 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 139 flow [2023-08-25 21:03:48,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:48,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:48,540 INFO L208 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] [2023-08-25 21:03:48,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 21:03:48,540 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:48,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1840018890, now seen corresponding path program 1 times [2023-08-25 21:03:48,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:48,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986721367] [2023-08-25 21:03:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:03:48,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:48,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986721367] [2023-08-25 21:03:48,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986721367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:48,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:48,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:03:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731919956] [2023-08-25 21:03:48,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:48,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:03:48,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:48,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:03:48,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:03:48,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 789 [2023-08-25 21:03:48,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:48,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:48,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 789 [2023-08-25 21:03:48,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:49,779 INFO L124 PetriNetUnfolderBase]: 5985/8023 cut-off events. [2023-08-25 21:03:49,780 INFO L125 PetriNetUnfolderBase]: For 2856/2856 co-relation queries the response was YES. [2023-08-25 21:03:49,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18549 conditions, 8023 events. 5985/8023 cut-off events. For 2856/2856 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 33832 event pairs, 4657 based on Foata normal form. 0/7213 useless extension candidates. Maximal degree in co-relation 18542. Up to 7969 conditions per place. [2023-08-25 21:03:49,810 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 67 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2023-08-25 21:03:49,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 319 flow [2023-08-25 21:03:49,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:03:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:03:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1689 transitions. [2023-08-25 21:03:49,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3567807351077313 [2023-08-25 21:03:49,816 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1689 transitions. [2023-08-25 21:03:49,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1689 transitions. [2023-08-25 21:03:49,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:49,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1689 transitions. [2023-08-25 21:03:49,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:49,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:49,828 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:49,828 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 139 flow. Second operand 6 states and 1689 transitions. [2023-08-25 21:03:49,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 319 flow [2023-08-25 21:03:49,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:03:49,832 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 142 flow [2023-08-25 21:03:49,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-08-25 21:03:49,835 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -66 predicate places. [2023-08-25 21:03:49,838 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 142 flow [2023-08-25 21:03:49,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:49,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:49,839 INFO L208 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] [2023-08-25 21:03:49,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 21:03:49,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:49,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:49,840 INFO L85 PathProgramCache]: Analyzing trace with hash 925835819, now seen corresponding path program 1 times [2023-08-25 21:03:49,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:49,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609388120] [2023-08-25 21:03:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:49,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:03:49,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:49,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609388120] [2023-08-25 21:03:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609388120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:49,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:49,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 21:03:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320598735] [2023-08-25 21:03:49,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:49,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 21:03:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 21:03:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 21:03:49,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 789 [2023-08-25 21:03:49,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:49,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:49,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 789 [2023-08-25 21:03:49,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:50,370 INFO L124 PetriNetUnfolderBase]: 2555/3755 cut-off events. [2023-08-25 21:03:50,371 INFO L125 PetriNetUnfolderBase]: For 1013/1047 co-relation queries the response was YES. [2023-08-25 21:03:50,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8231 conditions, 3755 events. 2555/3755 cut-off events. For 1013/1047 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 17512 event pairs, 333 based on Foata normal form. 2/3425 useless extension candidates. Maximal degree in co-relation 8224. Up to 1507 conditions per place. [2023-08-25 21:03:50,392 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 79 selfloop transitions, 7 changer transitions 0/99 dead transitions. [2023-08-25 21:03:50,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 99 transitions, 437 flow [2023-08-25 21:03:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 21:03:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 21:03:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1619 transitions. [2023-08-25 21:03:50,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41039290240811155 [2023-08-25 21:03:50,397 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1619 transitions. [2023-08-25 21:03:50,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1619 transitions. [2023-08-25 21:03:50,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:50,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1619 transitions. [2023-08-25 21:03:50,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 323.8) internal successors, (1619), 5 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:50,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:50,407 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:50,407 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 142 flow. Second operand 5 states and 1619 transitions. [2023-08-25 21:03:50,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 99 transitions, 437 flow [2023-08-25 21:03:50,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 99 transitions, 428 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 21:03:50,418 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 179 flow [2023-08-25 21:03:50,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-08-25 21:03:50,421 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -63 predicate places. [2023-08-25 21:03:50,422 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 179 flow [2023-08-25 21:03:50,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:50,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:50,423 INFO L208 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] [2023-08-25 21:03:50,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 21:03:50,424 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:50,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1736758879, now seen corresponding path program 2 times [2023-08-25 21:03:50,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:50,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180707066] [2023-08-25 21:03:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:03:50,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:50,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180707066] [2023-08-25 21:03:50,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180707066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:50,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:50,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:03:50,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613083584] [2023-08-25 21:03:50,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:50,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:03:50,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:50,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:03:50,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:03:50,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 789 [2023-08-25 21:03:50,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 305.3333333333333) internal successors, (1832), 6 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:50,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:50,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 789 [2023-08-25 21:03:50,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:51,578 INFO L124 PetriNetUnfolderBase]: 4571/6859 cut-off events. [2023-08-25 21:03:51,578 INFO L125 PetriNetUnfolderBase]: For 3503/3530 co-relation queries the response was YES. [2023-08-25 21:03:51,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16237 conditions, 6859 events. 4571/6859 cut-off events. For 3503/3530 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 36904 event pairs, 449 based on Foata normal form. 168/6615 useless extension candidates. Maximal degree in co-relation 16227. Up to 2132 conditions per place. [2023-08-25 21:03:51,602 INFO L140 encePairwiseOnDemand]: 782/789 looper letters, 91 selfloop transitions, 7 changer transitions 21/132 dead transitions. [2023-08-25 21:03:51,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 132 transitions, 644 flow [2023-08-25 21:03:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 21:03:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 21:03:51,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2215 transitions. [2023-08-25 21:03:51,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40105015390186494 [2023-08-25 21:03:51,608 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2215 transitions. [2023-08-25 21:03:51,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2215 transitions. [2023-08-25 21:03:51,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:51,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2215 transitions. [2023-08-25 21:03:51,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 316.42857142857144) internal successors, (2215), 7 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:51,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 789.0) internal successors, (6312), 8 states have internal predecessors, (6312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:51,620 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 789.0) internal successors, (6312), 8 states have internal predecessors, (6312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:51,620 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 179 flow. Second operand 7 states and 2215 transitions. [2023-08-25 21:03:51,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 132 transitions, 644 flow [2023-08-25 21:03:51,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 132 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:03:51,626 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 186 flow [2023-08-25 21:03:51,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2023-08-25 21:03:51,627 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -56 predicate places. [2023-08-25 21:03:51,627 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 186 flow [2023-08-25 21:03:51,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 305.3333333333333) internal successors, (1832), 6 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:51,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:51,628 INFO L208 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] [2023-08-25 21:03:51,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 21:03:51,628 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:51,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1870030227, now seen corresponding path program 1 times [2023-08-25 21:03:51,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:51,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116870493] [2023-08-25 21:03:51,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:03:51,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:51,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116870493] [2023-08-25 21:03:51,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116870493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:51,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:51,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:03:51,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511908610] [2023-08-25 21:03:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:51,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:03:51,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:51,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:03:51,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:03:51,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 789 [2023-08-25 21:03:51,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:51,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:51,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 789 [2023-08-25 21:03:51,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:52,082 INFO L124 PetriNetUnfolderBase]: 2485/3633 cut-off events. [2023-08-25 21:03:52,082 INFO L125 PetriNetUnfolderBase]: For 3149/3149 co-relation queries the response was YES. [2023-08-25 21:03:52,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9418 conditions, 3633 events. 2485/3633 cut-off events. For 3149/3149 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16274 event pairs, 669 based on Foata normal form. 54/3467 useless extension candidates. Maximal degree in co-relation 9406. Up to 3093 conditions per place. [2023-08-25 21:03:52,104 INFO L140 encePairwiseOnDemand]: 786/789 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-25 21:03:52,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 316 flow [2023-08-25 21:03:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:03:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:03:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2023-08-25 21:03:52,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41191381495564006 [2023-08-25 21:03:52,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2023-08-25 21:03:52,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2023-08-25 21:03:52,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:52,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2023-08-25 21:03:52,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:52,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:52,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:52,113 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 186 flow. Second operand 3 states and 975 transitions. [2023-08-25 21:03:52,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 316 flow [2023-08-25 21:03:52,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 288 flow, removed 1 selfloop flow, removed 11 redundant places. [2023-08-25 21:03:52,119 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 160 flow [2023-08-25 21:03:52,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2023-08-25 21:03:52,120 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -64 predicate places. [2023-08-25 21:03:52,120 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 160 flow [2023-08-25 21:03:52,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:52,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:52,121 INFO L208 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] [2023-08-25 21:03:52,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 21:03:52,121 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:52,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:52,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1428632059, now seen corresponding path program 1 times [2023-08-25 21:03:52,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:52,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574156277] [2023-08-25 21:03:52,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:52,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:03:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:52,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574156277] [2023-08-25 21:03:52,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574156277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:52,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:52,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:03:52,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053932610] [2023-08-25 21:03:52,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:52,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:03:52,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:03:52,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:03:52,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 789 [2023-08-25 21:03:52,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:52,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:52,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 789 [2023-08-25 21:03:52,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:52,537 INFO L124 PetriNetUnfolderBase]: 2096/3332 cut-off events. [2023-08-25 21:03:52,537 INFO L125 PetriNetUnfolderBase]: For 1591/1625 co-relation queries the response was YES. [2023-08-25 21:03:52,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8230 conditions, 3332 events. 2096/3332 cut-off events. For 1591/1625 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15456 event pairs, 1003 based on Foata normal form. 48/3143 useless extension candidates. Maximal degree in co-relation 8220. Up to 2752 conditions per place. [2023-08-25 21:03:52,555 INFO L140 encePairwiseOnDemand]: 786/789 looper letters, 49 selfloop transitions, 2 changer transitions 3/67 dead transitions. [2023-08-25 21:03:52,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 67 transitions, 304 flow [2023-08-25 21:03:52,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:03:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:03:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2023-08-25 21:03:52,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41191381495564006 [2023-08-25 21:03:52,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2023-08-25 21:03:52,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2023-08-25 21:03:52,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:52,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2023-08-25 21:03:52,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:52,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:52,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:52,564 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 160 flow. Second operand 3 states and 975 transitions. [2023-08-25 21:03:52,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 67 transitions, 304 flow [2023-08-25 21:03:52,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:03:52,567 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 170 flow [2023-08-25 21:03:52,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2023-08-25 21:03:52,568 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -62 predicate places. [2023-08-25 21:03:52,568 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 170 flow [2023-08-25 21:03:52,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:52,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:52,569 INFO L208 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] [2023-08-25 21:03:52,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 21:03:52,569 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:52,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:52,569 INFO L85 PathProgramCache]: Analyzing trace with hash -480627784, now seen corresponding path program 1 times [2023-08-25 21:03:52,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:52,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911326472] [2023-08-25 21:03:52,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:03:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:52,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911326472] [2023-08-25 21:03:52,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911326472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:52,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:52,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 21:03:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005288991] [2023-08-25 21:03:52,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:52,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 21:03:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 21:03:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 21:03:52,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 789 [2023-08-25 21:03:52,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:52,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:52,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 789 [2023-08-25 21:03:52,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:53,093 INFO L124 PetriNetUnfolderBase]: 2228/3548 cut-off events. [2023-08-25 21:03:53,093 INFO L125 PetriNetUnfolderBase]: For 2012/2034 co-relation queries the response was YES. [2023-08-25 21:03:53,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9194 conditions, 3548 events. 2228/3548 cut-off events. For 2012/2034 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16788 event pairs, 1657 based on Foata normal form. 22/3307 useless extension candidates. Maximal degree in co-relation 9183. Up to 2984 conditions per place. [2023-08-25 21:03:53,108 INFO L140 encePairwiseOnDemand]: 785/789 looper letters, 40 selfloop transitions, 2 changer transitions 18/73 dead transitions. [2023-08-25 21:03:53,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 337 flow [2023-08-25 21:03:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 21:03:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 21:03:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1148 transitions. [2023-08-25 21:03:53,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3637515842839037 [2023-08-25 21:03:53,112 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1148 transitions. [2023-08-25 21:03:53,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1148 transitions. [2023-08-25 21:03:53,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:53,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1148 transitions. [2023-08-25 21:03:53,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:53,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:53,119 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:53,119 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 170 flow. Second operand 4 states and 1148 transitions. [2023-08-25 21:03:53,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 337 flow [2023-08-25 21:03:53,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:03:53,124 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 182 flow [2023-08-25 21:03:53,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-08-25 21:03:53,124 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -58 predicate places. [2023-08-25 21:03:53,124 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 182 flow [2023-08-25 21:03:53,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:53,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:53,125 INFO L208 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] [2023-08-25 21:03:53,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 21:03:53,125 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:53,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:53,125 INFO L85 PathProgramCache]: Analyzing trace with hash -622570275, now seen corresponding path program 1 times [2023-08-25 21:03:53,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:53,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202647252] [2023-08-25 21:03:53,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:53,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:03:53,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:53,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202647252] [2023-08-25 21:03:53,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202647252] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:03:53,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:03:53,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 21:03:53,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914731766] [2023-08-25 21:03:53,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:03:53,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 21:03:53,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:03:53,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 21:03:53,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 21:03:53,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 789 [2023-08-25 21:03:53,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 281.75) internal successors, (1127), 4 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:53,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:03:53,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 789 [2023-08-25 21:03:53,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:03:53,625 INFO L124 PetriNetUnfolderBase]: 2437/3937 cut-off events. [2023-08-25 21:03:53,625 INFO L125 PetriNetUnfolderBase]: For 2298/2320 co-relation queries the response was YES. [2023-08-25 21:03:53,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10107 conditions, 3937 events. 2437/3937 cut-off events. For 2298/2320 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 19353 event pairs, 1835 based on Foata normal form. 34/3675 useless extension candidates. Maximal degree in co-relation 10094. Up to 2985 conditions per place. [2023-08-25 21:03:53,671 INFO L140 encePairwiseOnDemand]: 785/789 looper letters, 41 selfloop transitions, 2 changer transitions 19/75 dead transitions. [2023-08-25 21:03:53,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 363 flow [2023-08-25 21:03:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 21:03:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 21:03:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1148 transitions. [2023-08-25 21:03:53,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3637515842839037 [2023-08-25 21:03:53,675 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1148 transitions. [2023-08-25 21:03:53,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1148 transitions. [2023-08-25 21:03:53,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:03:53,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1148 transitions. [2023-08-25 21:03:53,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:53,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:53,682 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:53,683 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 182 flow. Second operand 4 states and 1148 transitions. [2023-08-25 21:03:53,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 363 flow [2023-08-25 21:03:53,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 355 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-25 21:03:53,689 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 190 flow [2023-08-25 21:03:53,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2023-08-25 21:03:53,690 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -56 predicate places. [2023-08-25 21:03:53,690 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 190 flow [2023-08-25 21:03:53,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.75) internal successors, (1127), 4 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:03:53,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:03:53,690 INFO L208 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] [2023-08-25 21:03:53,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 21:03:53,691 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:03:53,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:03:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1396244327, now seen corresponding path program 1 times [2023-08-25 21:03:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:03:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120759227] [2023-08-25 21:03:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:03:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:03:57,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:03:57,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120759227] [2023-08-25 21:03:57,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120759227] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:03:57,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122220917] [2023-08-25 21:03:57,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:03:57,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:03:57,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:03:57,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:03:57,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 21:03:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:03:57,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-25 21:03:57,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:03:58,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:03:58,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-25 21:03:59,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-08-25 21:03:59,132 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 21:03:59,136 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:03:59,137 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-08-25 21:03:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:03:59,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:03:59,644 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:03:59,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 17 [2023-08-25 21:04:00,179 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:04:00,179 INFO L351 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 159 treesize of output 203 [2023-08-25 21:04:00,216 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:04:00,216 INFO L351 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 93 treesize of output 103 [2023-08-25 21:04:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:04:02,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122220917] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:04:02,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:04:02,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 50 [2023-08-25 21:04:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564755670] [2023-08-25 21:04:02,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:04:02,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-08-25 21:04:02,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:04:02,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-08-25 21:04:02,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2357, Unknown=7, NotChecked=0, Total=2550 [2023-08-25 21:04:02,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 789 [2023-08-25 21:04:02,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 190 flow. Second operand has 51 states, 51 states have (on average 188.23529411764707) internal successors, (9600), 51 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:04:02,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:04:02,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 789 [2023-08-25 21:04:02,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:04:20,239 WARN L234 SmtUtils]: Spent 11.01s on a formula simplification. DAG size of input: 177 DAG size of output: 143 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:04:33,853 WARN L234 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 175 DAG size of output: 138 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:04:38,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:04:40,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:04:47,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:05:06,449 WARN L234 SmtUtils]: Spent 17.64s on a formula simplification. DAG size of input: 120 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:05:23,216 WARN L234 SmtUtils]: Spent 12.43s on a formula simplification. DAG size of input: 114 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:05:34,112 WARN L234 SmtUtils]: Spent 10.63s on a formula simplification. DAG size of input: 145 DAG size of output: 114 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:05:37,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:05:41,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:05:44,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:05:46,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:05:47,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:05:57,412 WARN L234 SmtUtils]: Spent 8.89s on a formula simplification. DAG size of input: 183 DAG size of output: 144 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:05:59,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:06:14,210 WARN L234 SmtUtils]: Spent 7.89s on a formula simplification. DAG size of input: 103 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:06:20,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:06:30,691 WARN L234 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 181 DAG size of output: 139 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:06:32,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:06:35,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:06:38,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:06:41,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:06:43,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:06:45,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:06:47,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:06:49,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:06:56,137 WARN L234 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:07:02,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:07:04,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:07:11,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:07:29,551 WARN L234 SmtUtils]: Spent 16.91s on a formula simplification. DAG size of input: 126 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:07:31,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:07:33,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:07:38,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:07:43,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:07:46,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:07:48,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:07:50,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:07:52,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:07:56,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:08:04,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:08:06,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:08:08,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:08:10,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:08:18,889 WARN L234 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 110 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:08:21,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:08:23,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:08:27,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:08:29,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:08:31,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:08:33,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:08:35,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:08:38,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:08:41,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:08:42,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:08:45,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:08:47,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:08:49,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:08:51,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:08:53,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:09:00,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:09:02,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:09:05,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:09:10,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:09:13,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:09:16,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:09:18,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:09:20,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:09:46,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:09:48,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:09:56,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:09:57,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:09:58,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:01,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:03,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:05,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:08,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:10,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:11,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:14,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:16,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:17,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:19,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:21,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:22,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:25,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:31,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:33,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:35,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:37,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:39,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:41,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:43,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:46,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:10:50,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:10:52,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:10:55,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:00,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:11:07,984 WARN L234 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:11:11,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:12,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:14,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:16,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:18,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:21,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:25,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:27,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:34,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:36,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:38,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:41,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:44,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:46,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:50,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:52,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:54,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:56,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:11:58,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:00,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:04,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:06,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:09,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:12:13,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:15,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:17,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:12:19,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:12:21,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:12:25,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:28,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:30,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:12:33,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:12:35,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-08-25 21:12:39,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:43,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:47,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:49,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:55,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:12:59,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:13:04,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:06,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:08,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:10,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:12,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:13,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:16,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:18,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 21:13:20,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:22,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:24,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:26,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:28,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:31,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:36,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:37,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:40,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:42,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:46,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:50,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:13:53,820 INFO L124 PetriNetUnfolderBase]: 78137/107827 cut-off events. [2023-08-25 21:13:53,820 INFO L125 PetriNetUnfolderBase]: For 74211/74211 co-relation queries the response was YES. [2023-08-25 21:13:54,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300785 conditions, 107827 events. 78137/107827 cut-off events. For 74211/74211 co-relation queries the response was YES. Maximal size of possible extension queue 2245. Compared 678228 event pairs, 2332 based on Foata normal form. 1656/101955 useless extension candidates. Maximal degree in co-relation 300771. Up to 16904 conditions per place. [2023-08-25 21:13:54,645 INFO L140 encePairwiseOnDemand]: 768/789 looper letters, 4043 selfloop transitions, 805 changer transitions 158/5007 dead transitions. [2023-08-25 21:13:54,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 5007 transitions, 23653 flow [2023-08-25 21:13:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2023-08-25 21:13:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2023-08-25 21:13:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 54625 transitions. [2023-08-25 21:13:54,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25930039921580916 [2023-08-25 21:13:54,881 INFO L72 ComplementDD]: Start complementDD. Operand 267 states and 54625 transitions. [2023-08-25 21:13:54,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 54625 transitions. [2023-08-25 21:13:54,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:13:54,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 267 states and 54625 transitions. [2023-08-25 21:13:54,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 268 states, 267 states have (on average 204.5880149812734) internal successors, (54625), 267 states have internal predecessors, (54625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:13:55,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 268 states, 268 states have (on average 789.0) internal successors, (211452), 268 states have internal predecessors, (211452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:13:55,355 INFO L81 ComplementDD]: Finished complementDD. Result has 268 states, 268 states have (on average 789.0) internal successors, (211452), 268 states have internal predecessors, (211452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:13:55,356 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 190 flow. Second operand 267 states and 54625 transitions. [2023-08-25 21:13:55,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 5007 transitions, 23653 flow [2023-08-25 21:13:55,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 5007 transitions, 23556 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-08-25 21:13:55,878 INFO L231 Difference]: Finished difference. Result has 450 places, 1040 transitions, 6919 flow [2023-08-25 21:13:55,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=267, PETRI_FLOW=6919, PETRI_PLACES=450, PETRI_TRANSITIONS=1040} [2023-08-25 21:13:55,880 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, 321 predicate places. [2023-08-25 21:13:55,880 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 1040 transitions, 6919 flow [2023-08-25 21:13:55,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 188.23529411764707) internal successors, (9600), 51 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:13:55,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:13:55,882 INFO L208 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] [2023-08-25 21:13:55,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 21:13:56,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-25 21:13:56,089 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 21:13:56,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:13:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1604558203, now seen corresponding path program 2 times [2023-08-25 21:13:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:13:56,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534476777] [2023-08-25 21:13:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:13:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:13:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:14:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:14:00,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:14:00,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534476777] [2023-08-25 21:14:00,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534476777] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:14:00,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795691109] [2023-08-25 21:14:00,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 21:14:00,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:14:00,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:14:00,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:14:00,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 21:14:00,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 21:14:00,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:14:00,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-25 21:14:00,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:14:01,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:14:01,354 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-25 21:14:01,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-08-25 21:14:01,679 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:14:01,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 30 [2023-08-25 21:14:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:14:01,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:14:02,298 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:14:02,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 17 [2023-08-25 21:14:02,854 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:14:02,854 INFO L351 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 159 treesize of output 203 [2023-08-25 21:14:02,913 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:14:02,913 INFO L351 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 93 treesize of output 103 [2023-08-25 21:14:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:14:04,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795691109] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:14:04,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:14:04,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 44 [2023-08-25 21:14:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833444744] [2023-08-25 21:14:04,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:14:04,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-25 21:14:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:14:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-25 21:14:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1823, Unknown=3, NotChecked=0, Total=1980 [2023-08-25 21:14:04,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 789 [2023-08-25 21:14:04,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 1040 transitions, 6919 flow. Second operand has 45 states, 45 states have (on average 196.66666666666666) internal successors, (8850), 45 states have internal predecessors, (8850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:14:04,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:14:04,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 789 [2023-08-25 21:14:04,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:14:33,159 WARN L234 SmtUtils]: Spent 12.51s on a formula simplification. DAG size of input: 135 DAG size of output: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:14:47,921 WARN L234 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 107 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:15:01,549 WARN L234 SmtUtils]: Spent 12.57s on a formula simplification. DAG size of input: 134 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:15:16,672 WARN L234 SmtUtils]: Spent 12.57s on a formula simplification. DAG size of input: 96 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:15:25,571 WARN L234 SmtUtils]: Spent 8.49s on a formula simplification. DAG size of input: 89 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:15:35,411 WARN L234 SmtUtils]: Spent 8.50s on a formula simplification. DAG size of input: 105 DAG size of output: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:15:50,287 WARN L234 SmtUtils]: Spent 14.54s on a formula simplification. DAG size of input: 130 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:16:08,323 WARN L234 SmtUtils]: Spent 16.45s on a formula simplification. DAG size of input: 127 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:16:25,355 WARN L234 SmtUtils]: Spent 8.44s on a formula simplification. DAG size of input: 98 DAG size of output: 78 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:16:34,648 WARN L234 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 100 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:17:03,569 WARN L234 SmtUtils]: Spent 26.74s on a formula simplification. DAG size of input: 128 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:17:18,298 WARN L234 SmtUtils]: Spent 14.53s on a formula simplification. DAG size of input: 117 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-08-25 21:17:28,478 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 21:17:28,479 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 21:17:29,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 21:17:29,679 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-25 21:17:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2023-08-25 21:17:29,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-25 21:17:29,734 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-25 21:17:29,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-25 21:17:29,737 INFO L158 Benchmark]: Toolchain (without parser) took 839941.67ms. Allocated memory was 371.2MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 347.5MB in the beginning and 1.1GB in the end (delta: -730.7MB). Peak memory consumption was 738.7MB. Max. memory is 16.0GB. [2023-08-25 21:17:29,737 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 371.2MB. Free memory is still 347.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 21:17:29,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.15ms. Allocated memory is still 371.2MB. Free memory was 347.0MB in the beginning and 333.6MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-25 21:17:29,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.02ms. Allocated memory is still 371.2MB. Free memory was 333.6MB in the beginning and 330.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 21:17:29,738 INFO L158 Benchmark]: Boogie Preprocessor took 49.71ms. Allocated memory is still 371.2MB. Free memory was 330.1MB in the beginning and 326.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 21:17:29,738 INFO L158 Benchmark]: RCFGBuilder took 1223.44ms. Allocated memory was 371.2MB in the beginning and 455.1MB in the end (delta: 83.9MB). Free memory was 326.9MB in the beginning and 415.5MB in the end (delta: -88.6MB). Peak memory consumption was 64.6MB. Max. memory is 16.0GB. [2023-08-25 21:17:29,738 INFO L158 Benchmark]: TraceAbstraction took 838282.98ms. Allocated memory was 455.1MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 414.4MB in the beginning and 1.1GB in the end (delta: -663.8MB). Peak memory consumption was 720.3MB. Max. memory is 16.0GB. [2023-08-25 21:17:29,739 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.13ms. Allocated memory is still 371.2MB. Free memory is still 347.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 320.15ms. Allocated memory is still 371.2MB. Free memory was 347.0MB in the beginning and 333.6MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.02ms. Allocated memory is still 371.2MB. Free memory was 333.6MB in the beginning and 330.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.71ms. Allocated memory is still 371.2MB. Free memory was 330.1MB in the beginning and 326.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1223.44ms. Allocated memory was 371.2MB in the beginning and 455.1MB in the end (delta: 83.9MB). Free memory was 326.9MB in the beginning and 415.5MB in the end (delta: -88.6MB). Peak memory consumption was 64.6MB. Max. memory is 16.0GB. * TraceAbstraction took 838282.98ms. Allocated memory was 455.1MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 414.4MB in the beginning and 1.1GB in the end (delta: -663.8MB). Peak memory consumption was 720.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.1s, 371 PlacesBefore, 129 PlacesAfterwards, 376 TransitionsBefore, 121 TransitionsAfterwards, 10944 CoEnabledTransitionPairs, 9 FixpointIterations, 268 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 8 ConcurrentYvCompositions, 13 ChoiceCompositions, 396 TotalNumberOfCompositions, 62603 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24514, independent: 23598, independent conditional: 0, independent unconditional: 23598, dependent: 916, dependent conditional: 0, dependent unconditional: 916, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4700, independent: 4588, independent conditional: 0, independent unconditional: 4588, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 24514, independent: 19010, independent conditional: 0, independent unconditional: 19010, dependent: 804, dependent conditional: 0, dependent unconditional: 804, unknown: 4700, unknown conditional: 0, unknown unconditional: 4700] , Statistics on independence cache: Total cache size (in pairs): 1336, Positive cache size: 1266, Positive conditional cache size: 0, Positive unconditional cache size: 1266, Negative cache size: 70, Negative conditional cache size: 0, Negative unconditional cache size: 70, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown