/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:17:12,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:17:12,470 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-26 21:17:12,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:17:12,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:17:12,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:17:12,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:17:12,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:17:12,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:17:12,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:17:12,513 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:17:12,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:17:12,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:17:12,513 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:17:12,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:17:12,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:17:12,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:17:12,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:17:12,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:17:12,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:17:12,515 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:17:12,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:17:12,516 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:17:12,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:17:12,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:17:12,516 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:17:12,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:17:12,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:17:12,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:17:12,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:17:12,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:17:12,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:17:12,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:17:12,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:17:12,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:17:12,519 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.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:17:12,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:17:12,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:17:12,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:17:12,782 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:17:12,784 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:17:12,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-08-26 21:17:13,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:17:14,076 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:17:14,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-08-26 21:17:14,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbd1e49f/487ad1bc9be04f25bd3181fb2f74d1c7/FLAG20479cbb1 [2023-08-26 21:17:14,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbd1e49f/487ad1bc9be04f25bd3181fb2f74d1c7 [2023-08-26 21:17:14,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:17:14,100 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:17:14,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:17:14,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:17:14,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:17:14,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aaaef83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14, skipping insertion in model container [2023-08-26 21:17:14,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,131 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:17:14,428 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:17:14,441 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:17:14,464 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:17:14,465 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:17:14,491 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:17:14,518 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:17:14,519 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:17:14,523 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:17:14,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14 WrapperNode [2023-08-26 21:17:14,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:17:14,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:17:14,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:17:14,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:17:14,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,572 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145 [2023-08-26 21:17:14,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:17:14,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:17:14,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:17:14,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:17:14,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:17:14,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:17:14,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:17:14,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:17:14,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (1/1) ... [2023-08-26 21:17:14,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:17:14,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:17:14,632 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-26 21:17:14,679 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-26 21:17:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:17:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:17:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:17:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:17:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:17:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:17:14,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:17:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:17:14,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:17:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:17:14,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:17:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:17:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:17:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:17:14,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:17:14,706 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:17:14,800 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:17:14,801 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:17:15,111 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:17:15,221 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:17:15,221 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:17:15,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:17:15 BoogieIcfgContainer [2023-08-26 21:17:15,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:17:15,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:17:15,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:17:15,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:17:15,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:17:14" (1/3) ... [2023-08-26 21:17:15,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0f170e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:17:15, skipping insertion in model container [2023-08-26 21:17:15,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:14" (2/3) ... [2023-08-26 21:17:15,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0f170e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:17:15, skipping insertion in model container [2023-08-26 21:17:15,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:17:15" (3/3) ... [2023-08-26 21:17:15,230 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2023-08-26 21:17:15,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:17:15,241 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 21:17:15,241 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:17:15,288 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:17:15,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 121 transitions, 257 flow [2023-08-26 21:17:15,371 INFO L124 PetriNetUnfolderBase]: 3/118 cut-off events. [2023-08-26 21:17:15,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:15,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-26 21:17:15,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 121 transitions, 257 flow [2023-08-26 21:17:15,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 118 transitions, 245 flow [2023-08-26 21:17:15,386 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:17:15,391 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 118 transitions, 245 flow [2023-08-26 21:17:15,393 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 118 transitions, 245 flow [2023-08-26 21:17:15,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 245 flow [2023-08-26 21:17:15,416 INFO L124 PetriNetUnfolderBase]: 3/118 cut-off events. [2023-08-26 21:17:15,416 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:15,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-26 21:17:15,419 INFO L119 LiptonReduction]: Number of co-enabled transitions 2696 [2023-08-26 21:17:18,155 INFO L134 LiptonReduction]: Checked pairs total: 9158 [2023-08-26 21:17:18,155 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-26 21:17:18,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:17:18,167 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;@2bb13083, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:17:18,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-26 21:17:18,169 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:17:18,169 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:17:18,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:18,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:18,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:17:18,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:18,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash 507380440, now seen corresponding path program 1 times [2023-08-26 21:17:18,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:18,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58808644] [2023-08-26 21:17:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:18,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:18,313 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-26 21:17:18,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:18,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58808644] [2023-08-26 21:17:18,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58808644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:18,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:18,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:17:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921476802] [2023-08-26 21:17:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:18,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:17:18,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:17:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:17:18,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-08-26 21:17:18,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:18,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:18,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-08-26 21:17:18,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:18,650 INFO L124 PetriNetUnfolderBase]: 1371/2183 cut-off events. [2023-08-26 21:17:18,650 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-26 21:17:18,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4398 conditions, 2183 events. 1371/2183 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 11480 event pairs, 583 based on Foata normal form. 130/1532 useless extension candidates. Maximal degree in co-relation 4387. Up to 1989 conditions per place. [2023-08-26 21:17:18,665 INFO L140 encePairwiseOnDemand]: 214/226 looper letters, 39 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-26 21:17:18,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 191 flow [2023-08-26 21:17:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:17:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:17:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-26 21:17:18,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103244837758112 [2023-08-26 21:17:18,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-26 21:17:18,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-26 21:17:18,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:18,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-26 21:17:18,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:18,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:18,690 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:18,691 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 346 transitions. [2023-08-26 21:17:18,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 191 flow [2023-08-26 21:17:18,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:17:18,695 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 104 flow [2023-08-26 21:17:18,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-26 21:17:18,699 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-26 21:17:18,699 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 104 flow [2023-08-26 21:17:18,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:18,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:18,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:18,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:17:18,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:18,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:18,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1984723904, now seen corresponding path program 1 times [2023-08-26 21:17:18,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:18,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222281722] [2023-08-26 21:17:18,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:18,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:18,900 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-26 21:17:18,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:18,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222281722] [2023-08-26 21:17:18,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222281722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:18,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:18,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:17:18,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293087494] [2023-08-26 21:17:18,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:18,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:17:18,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:18,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:17:18,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:17:18,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 226 [2023-08-26 21:17:18,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:18,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:18,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 226 [2023-08-26 21:17:18,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:19,144 INFO L124 PetriNetUnfolderBase]: 1033/1805 cut-off events. [2023-08-26 21:17:19,144 INFO L125 PetriNetUnfolderBase]: For 209/241 co-relation queries the response was YES. [2023-08-26 21:17:19,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4275 conditions, 1805 events. 1033/1805 cut-off events. For 209/241 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10549 event pairs, 211 based on Foata normal form. 0/1464 useless extension candidates. Maximal degree in co-relation 4264. Up to 1372 conditions per place. [2023-08-26 21:17:19,170 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 40 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-26 21:17:19,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 232 flow [2023-08-26 21:17:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:17:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:17:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-08-26 21:17:19,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073746312684366 [2023-08-26 21:17:19,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-08-26 21:17:19,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-08-26 21:17:19,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:19,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-08-26 21:17:19,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,186 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 104 flow. Second operand 3 states and 344 transitions. [2023-08-26 21:17:19,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 232 flow [2023-08-26 21:17:19,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:17:19,188 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 102 flow [2023-08-26 21:17:19,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-08-26 21:17:19,189 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-26 21:17:19,189 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 102 flow [2023-08-26 21:17:19,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:19,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:19,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:17:19,190 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:19,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:19,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1852920151, now seen corresponding path program 1 times [2023-08-26 21:17:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:19,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478731806] [2023-08-26 21:17:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:19,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:19,257 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-26 21:17:19,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478731806] [2023-08-26 21:17:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478731806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:19,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:19,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:17:19,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932162943] [2023-08-26 21:17:19,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:19,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:19,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:19,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:19,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-08-26 21:17:19,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:19,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-08-26 21:17:19,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:19,413 INFO L124 PetriNetUnfolderBase]: 845/1361 cut-off events. [2023-08-26 21:17:19,413 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2023-08-26 21:17:19,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3329 conditions, 1361 events. 845/1361 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6511 event pairs, 304 based on Foata normal form. 0/1107 useless extension candidates. Maximal degree in co-relation 3317. Up to 1198 conditions per place. [2023-08-26 21:17:19,419 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 34 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-26 21:17:19,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 194 flow [2023-08-26 21:17:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2023-08-26 21:17:19,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47898230088495575 [2023-08-26 21:17:19,421 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2023-08-26 21:17:19,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2023-08-26 21:17:19,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:19,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2023-08-26 21:17:19,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,424 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,424 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 102 flow. Second operand 4 states and 433 transitions. [2023-08-26 21:17:19,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 194 flow [2023-08-26 21:17:19,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:19,425 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 94 flow [2023-08-26 21:17:19,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-26 21:17:19,426 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-26 21:17:19,426 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 94 flow [2023-08-26 21:17:19,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:19,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:19,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:17:19,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:19,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:19,427 INFO L85 PathProgramCache]: Analyzing trace with hash -964946198, now seen corresponding path program 1 times [2023-08-26 21:17:19,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:19,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689918440] [2023-08-26 21:17:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:19,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:19,466 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-26 21:17:19,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:19,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689918440] [2023-08-26 21:17:19,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689918440] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:19,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:19,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:17:19,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729469568] [2023-08-26 21:17:19,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:19,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:19,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:19,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:19,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:19,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-08-26 21:17:19,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:19,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-08-26 21:17:19,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:19,551 INFO L124 PetriNetUnfolderBase]: 308/543 cut-off events. [2023-08-26 21:17:19,551 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2023-08-26 21:17:19,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 543 events. 308/543 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2115 event pairs, 105 based on Foata normal form. 26/534 useless extension candidates. Maximal degree in co-relation 1322. Up to 205 conditions per place. [2023-08-26 21:17:19,553 INFO L140 encePairwiseOnDemand]: 218/226 looper letters, 43 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2023-08-26 21:17:19,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 252 flow [2023-08-26 21:17:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-08-26 21:17:19,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49336283185840707 [2023-08-26 21:17:19,555 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-08-26 21:17:19,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-08-26 21:17:19,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:19,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-08-26 21:17:19,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,558 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,558 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 94 flow. Second operand 4 states and 446 transitions. [2023-08-26 21:17:19,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 252 flow [2023-08-26 21:17:19,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:19,559 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 135 flow [2023-08-26 21:17:19,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-08-26 21:17:19,559 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-26 21:17:19,560 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 135 flow [2023-08-26 21:17:19,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:19,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:19,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:17:19,560 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:19,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1917913614, now seen corresponding path program 1 times [2023-08-26 21:17:19,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:19,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984157444] [2023-08-26 21:17:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:19,757 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-26 21:17:19,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:19,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984157444] [2023-08-26 21:17:19,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984157444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:19,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:19,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:19,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112800334] [2023-08-26 21:17:19,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:19,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:19,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:19,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:19,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:19,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 226 [2023-08-26 21:17:19,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:19,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 226 [2023-08-26 21:17:19,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:19,880 INFO L124 PetriNetUnfolderBase]: 482/799 cut-off events. [2023-08-26 21:17:19,880 INFO L125 PetriNetUnfolderBase]: For 592/592 co-relation queries the response was YES. [2023-08-26 21:17:19,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 799 events. 482/799 cut-off events. For 592/592 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2934 event pairs, 163 based on Foata normal form. 0/764 useless extension candidates. Maximal degree in co-relation 2172. Up to 496 conditions per place. [2023-08-26 21:17:19,885 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 52 selfloop transitions, 5 changer transitions 3/60 dead transitions. [2023-08-26 21:17:19,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 361 flow [2023-08-26 21:17:19,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-26 21:17:19,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504424778761062 [2023-08-26 21:17:19,887 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-26 21:17:19,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-26 21:17:19,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:19,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-26 21:17:19,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,891 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,891 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 135 flow. Second operand 5 states and 509 transitions. [2023-08-26 21:17:19,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 361 flow [2023-08-26 21:17:19,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 339 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:19,895 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 155 flow [2023-08-26 21:17:19,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-08-26 21:17:19,898 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-26 21:17:19,898 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 155 flow [2023-08-26 21:17:19,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:19,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:19,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:19,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:17:19,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:19,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:19,900 INFO L85 PathProgramCache]: Analyzing trace with hash -444314730, now seen corresponding path program 1 times [2023-08-26 21:17:19,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:19,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127739883] [2023-08-26 21:17:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:20,005 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-26 21:17:20,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127739883] [2023-08-26 21:17:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127739883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:20,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:20,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:20,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071715731] [2023-08-26 21:17:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:20,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:20,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:20,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:20,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-08-26 21:17:20,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:20,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-08-26 21:17:20,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:20,119 INFO L124 PetriNetUnfolderBase]: 245/414 cut-off events. [2023-08-26 21:17:20,119 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2023-08-26 21:17:20,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 414 events. 245/414 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1512 event pairs, 85 based on Foata normal form. 9/422 useless extension candidates. Maximal degree in co-relation 1145. Up to 176 conditions per place. [2023-08-26 21:17:20,121 INFO L140 encePairwiseOnDemand]: 218/226 looper letters, 33 selfloop transitions, 10 changer transitions 5/50 dead transitions. [2023-08-26 21:17:20,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 273 flow [2023-08-26 21:17:20,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2023-08-26 21:17:20,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.479646017699115 [2023-08-26 21:17:20,123 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2023-08-26 21:17:20,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2023-08-26 21:17:20,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:20,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2023-08-26 21:17:20,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,125 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 155 flow. Second operand 5 states and 542 transitions. [2023-08-26 21:17:20,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 273 flow [2023-08-26 21:17:20,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 248 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-26 21:17:20,127 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 127 flow [2023-08-26 21:17:20,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-26 21:17:20,128 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-26 21:17:20,128 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 127 flow [2023-08-26 21:17:20,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:20,128 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] [2023-08-26 21:17:20,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:17:20,128 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:20,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:20,129 INFO L85 PathProgramCache]: Analyzing trace with hash -577210870, now seen corresponding path program 1 times [2023-08-26 21:17:20,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:20,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758099908] [2023-08-26 21:17:20,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:20,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:20,286 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-26 21:17:20,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:20,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758099908] [2023-08-26 21:17:20,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758099908] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:20,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:20,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:17:20,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934271517] [2023-08-26 21:17:20,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:20,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:17:20,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:20,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:17:20,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:17:20,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 226 [2023-08-26 21:17:20,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:20,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 226 [2023-08-26 21:17:20,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:20,408 INFO L124 PetriNetUnfolderBase]: 233/425 cut-off events. [2023-08-26 21:17:20,408 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2023-08-26 21:17:20,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 425 events. 233/425 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1640 event pairs, 17 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 1324. Up to 214 conditions per place. [2023-08-26 21:17:20,410 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 41 selfloop transitions, 4 changer transitions 29/74 dead transitions. [2023-08-26 21:17:20,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 466 flow [2023-08-26 21:17:20,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:17:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:17:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 684 transitions. [2023-08-26 21:17:20,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43236409608091025 [2023-08-26 21:17:20,412 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 684 transitions. [2023-08-26 21:17:20,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 684 transitions. [2023-08-26 21:17:20,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:20,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 684 transitions. [2023-08-26 21:17:20,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,415 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,415 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 127 flow. Second operand 7 states and 684 transitions. [2023-08-26 21:17:20,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 466 flow [2023-08-26 21:17:20,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 74 transitions, 410 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-26 21:17:20,418 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 133 flow [2023-08-26 21:17:20,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2023-08-26 21:17:20,418 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-26 21:17:20,418 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 133 flow [2023-08-26 21:17:20,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:20,419 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] [2023-08-26 21:17:20,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:17:20,419 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:20,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash -239797026, now seen corresponding path program 2 times [2023-08-26 21:17:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:20,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289814761] [2023-08-26 21:17:20,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:20,540 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-26 21:17:20,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:20,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289814761] [2023-08-26 21:17:20,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289814761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:20,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:20,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502735368] [2023-08-26 21:17:20,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:20,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:20,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:20,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:20,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:20,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 226 [2023-08-26 21:17:20,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:20,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 226 [2023-08-26 21:17:20,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:20,622 INFO L124 PetriNetUnfolderBase]: 143/299 cut-off events. [2023-08-26 21:17:20,623 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2023-08-26 21:17:20,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 299 events. 143/299 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1144 event pairs, 31 based on Foata normal form. 1/300 useless extension candidates. Maximal degree in co-relation 998. Up to 179 conditions per place. [2023-08-26 21:17:20,623 INFO L140 encePairwiseOnDemand]: 222/226 looper letters, 27 selfloop transitions, 1 changer transitions 29/58 dead transitions. [2023-08-26 21:17:20,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 379 flow [2023-08-26 21:17:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-26 21:17:20,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45309734513274336 [2023-08-26 21:17:20,625 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-26 21:17:20,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-26 21:17:20,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:20,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-26 21:17:20,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,627 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,627 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 133 flow. Second operand 5 states and 512 transitions. [2023-08-26 21:17:20,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 379 flow [2023-08-26 21:17:20,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 373 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:20,629 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 127 flow [2023-08-26 21:17:20,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-26 21:17:20,630 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-26 21:17:20,630 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 127 flow [2023-08-26 21:17:20,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:20,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:20,630 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] [2023-08-26 21:17:20,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:17:20,630 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:20,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1450928142, now seen corresponding path program 3 times [2023-08-26 21:17:20,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:20,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346776752] [2023-08-26 21:17:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:20,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:21,326 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-26 21:17:21,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346776752] [2023-08-26 21:17:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346776752] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:21,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:21,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:17:21,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653618050] [2023-08-26 21:17:21,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:21,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:17:21,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:21,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:17:21,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:17:21,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2023-08-26 21:17:21,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 127 flow. Second operand has 8 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:21,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:21,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2023-08-26 21:17:21,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:21,452 INFO L124 PetriNetUnfolderBase]: 66/161 cut-off events. [2023-08-26 21:17:21,453 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2023-08-26 21:17:21,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 161 events. 66/161 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 543 event pairs, 18 based on Foata normal form. 1/156 useless extension candidates. Maximal degree in co-relation 562. Up to 73 conditions per place. [2023-08-26 21:17:21,453 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 23 selfloop transitions, 3 changer transitions 22/50 dead transitions. [2023-08-26 21:17:21,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 347 flow [2023-08-26 21:17:21,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:17:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:17:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 665 transitions. [2023-08-26 21:17:21,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42035398230088494 [2023-08-26 21:17:21,455 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 665 transitions. [2023-08-26 21:17:21,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 665 transitions. [2023-08-26 21:17:21,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:21,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 665 transitions. [2023-08-26 21:17:21,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:21,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:21,460 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:21,460 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 127 flow. Second operand 7 states and 665 transitions. [2023-08-26 21:17:21,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 347 flow [2023-08-26 21:17:21,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 329 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-26 21:17:21,462 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 130 flow [2023-08-26 21:17:21,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2023-08-26 21:17:21,463 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-08-26 21:17:21,463 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 130 flow [2023-08-26 21:17:21,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:21,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:21,464 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] [2023-08-26 21:17:21,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:17:21,464 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:17:21,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:21,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1883009558, now seen corresponding path program 4 times [2023-08-26 21:17:21,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:21,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647752500] [2023-08-26 21:17:21,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:17:21,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:17:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:17:21,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:17:21,556 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:17:21,557 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-26 21:17:21,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-26 21:17:21,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-26 21:17:21,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-26 21:17:21,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-26 21:17:21,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (12 of 18 remaining) [2023-08-26 21:17:21,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-26 21:17:21,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-26 21:17:21,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-26 21:17:21,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-26 21:17:21,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-26 21:17:21,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-26 21:17:21,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-26 21:17:21,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-26 21:17:21,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-26 21:17:21,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (2 of 18 remaining) [2023-08-26 21:17:21,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-26 21:17:21,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-26 21:17:21,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:17:21,564 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:21,568 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:17:21,568 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:17:21,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:17:21 BasicIcfg [2023-08-26 21:17:21,634 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:17:21,634 INFO L158 Benchmark]: Toolchain (without parser) took 7534.35ms. Allocated memory was 369.1MB in the beginning and 576.7MB in the end (delta: 207.6MB). Free memory was 343.3MB in the beginning and 289.8MB in the end (delta: 53.4MB). Peak memory consumption was 262.1MB. Max. memory is 16.0GB. [2023-08-26 21:17:21,634 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 369.1MB. Free memory is still 346.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:17:21,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.76ms. Allocated memory is still 369.1MB. Free memory was 343.3MB in the beginning and 320.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:17:21,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.14ms. Allocated memory is still 369.1MB. Free memory was 320.2MB in the beginning and 318.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:17:21,635 INFO L158 Benchmark]: Boogie Preprocessor took 35.29ms. Allocated memory is still 369.1MB. Free memory was 318.1MB in the beginning and 316.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:17:21,635 INFO L158 Benchmark]: RCFGBuilder took 614.91ms. Allocated memory is still 369.1MB. Free memory was 316.0MB in the beginning and 282.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-26 21:17:21,635 INFO L158 Benchmark]: TraceAbstraction took 6408.49ms. Allocated memory was 369.1MB in the beginning and 576.7MB in the end (delta: 207.6MB). Free memory was 281.5MB in the beginning and 289.8MB in the end (delta: -8.4MB). Peak memory consumption was 201.3MB. Max. memory is 16.0GB. [2023-08-26 21:17:21,636 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 369.1MB. Free memory is still 346.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 424.76ms. Allocated memory is still 369.1MB. Free memory was 343.3MB in the beginning and 320.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.14ms. Allocated memory is still 369.1MB. Free memory was 320.2MB in the beginning and 318.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.29ms. Allocated memory is still 369.1MB. Free memory was 318.1MB in the beginning and 316.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 614.91ms. Allocated memory is still 369.1MB. Free memory was 316.0MB in the beginning and 282.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 6408.49ms. Allocated memory was 369.1MB in the beginning and 576.7MB in the end (delta: 207.6MB). Free memory was 281.5MB in the beginning and 289.8MB in the end (delta: -8.4MB). Peak memory consumption was 201.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 125 PlacesBefore, 40 PlacesAfterwards, 118 TransitionsBefore, 31 TransitionsAfterwards, 2696 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 105 TotalNumberOfCompositions, 9158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3956, independent: 3693, independent conditional: 0, independent unconditional: 3693, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1458, independent: 1420, independent conditional: 0, independent unconditional: 1420, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3956, independent: 2273, independent conditional: 0, independent unconditional: 2273, dependent: 225, dependent conditional: 0, dependent unconditional: 225, unknown: 1458, unknown conditional: 0, unknown unconditional: 1458] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=-2, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923, ((void *)0), P1, ((void *)0))=-1, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924, ((void *)0), P2, ((void *)0))=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] EXPR 1 __unbuffered_cnt + 1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L785] EXPR 2 __unbuffered_cnt + 1 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L820] EXPR 3 __unbuffered_cnt + 1 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix035_pso.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 757]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 780 IncrementalHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 12 mSDtfsCounter, 780 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:17:21,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...