/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -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/mix006.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 09:59:29,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 09:59:29,807 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-27 09:59:29,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 09:59:29,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 09:59:29,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 09:59:29,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 09:59:29,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 09:59:29,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 09:59:29,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 09:59:29,834 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 09:59:29,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 09:59:29,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 09:59:29,835 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 09:59:29,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 09:59:29,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 09:59:29,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 09:59:29,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 09:59:29,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 09:59:29,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 09:59:29,837 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 09:59:29,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 09:59:29,843 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 09:59:29,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 09:59:29,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 09:59:29,847 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 09:59:29,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 09:59:29,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:59:29,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 09:59:29,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 09:59:29,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 09:59:29,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 09:59:29,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 09:59:29,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 09:59:29,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 09:59:29,851 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 09:59:30,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 09:59:30,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 09:59:30,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 09:59:30,179 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 09:59:30,180 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 09:59:30,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2023-08-27 09:59:31,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 09:59:31,644 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 09:59:31,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2023-08-27 09:59:31,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddbf2f770/1f82b4ae3e71480dbf975824aee9c04e/FLAG628236006 [2023-08-27 09:59:31,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddbf2f770/1f82b4ae3e71480dbf975824aee9c04e [2023-08-27 09:59:31,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 09:59:31,671 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 09:59:31,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 09:59:31,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 09:59:31,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 09:59:31,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:59:31" (1/1) ... [2023-08-27 09:59:31,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e23c4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:31, skipping insertion in model container [2023-08-27 09:59:31,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:59:31" (1/1) ... [2023-08-27 09:59:31,735 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 09:59:32,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:59:32,120 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 09:59:32,146 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 09:59:32,147 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 09:59:32,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:59:32,225 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 09:59:32,226 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 09:59:32,232 INFO L206 MainTranslator]: Completed translation [2023-08-27 09:59:32,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32 WrapperNode [2023-08-27 09:59:32,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 09:59:32,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 09:59:32,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 09:59:32,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 09:59:32,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (1/1) ... [2023-08-27 09:59:32,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (1/1) ... [2023-08-27 09:59:32,279 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2023-08-27 09:59:32,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 09:59:32,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 09:59:32,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 09:59:32,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 09:59:32,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (1/1) ... [2023-08-27 09:59:32,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (1/1) ... [2023-08-27 09:59:32,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (1/1) ... [2023-08-27 09:59:32,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (1/1) ... [2023-08-27 09:59:32,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (1/1) ... [2023-08-27 09:59:32,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (1/1) ... [2023-08-27 09:59:32,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (1/1) ... [2023-08-27 09:59:32,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (1/1) ... [2023-08-27 09:59:32,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 09:59:32,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 09:59:32,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 09:59:32,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 09:59:32,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (1/1) ... [2023-08-27 09:59:32,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:59:32,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:59:32,339 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-27 09:59:32,379 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-27 09:59:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 09:59:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 09:59:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 09:59:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 09:59:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 09:59:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 09:59:32,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 09:59:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 09:59:32,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 09:59:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 09:59:32,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 09:59:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 09:59:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 09:59:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 09:59:32,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 09:59:32,398 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 09:59:32,538 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 09:59:32,540 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 09:59:32,866 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 09:59:32,988 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 09:59:32,988 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 09:59:32,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:59:32 BoogieIcfgContainer [2023-08-27 09:59:32,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 09:59:32,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 09:59:32,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 09:59:32,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 09:59:32,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:59:31" (1/3) ... [2023-08-27 09:59:32,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1d88b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:59:32, skipping insertion in model container [2023-08-27 09:59:32,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:32" (2/3) ... [2023-08-27 09:59:32,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1d88b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:59:32, skipping insertion in model container [2023-08-27 09:59:32,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:59:32" (3/3) ... [2023-08-27 09:59:32,996 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2023-08-27 09:59:33,010 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 09:59:33,010 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 09:59:33,010 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 09:59:33,051 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 09:59:33,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 120 transitions, 255 flow [2023-08-27 09:59:33,118 INFO L124 PetriNetUnfolderBase]: 3/117 cut-off events. [2023-08-27 09:59:33,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:59:33,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 09:59:33,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 120 transitions, 255 flow [2023-08-27 09:59:33,127 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 117 transitions, 243 flow [2023-08-27 09:59:33,129 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 09:59:33,136 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 117 transitions, 243 flow [2023-08-27 09:59:33,139 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 117 transitions, 243 flow [2023-08-27 09:59:33,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 243 flow [2023-08-27 09:59:33,160 INFO L124 PetriNetUnfolderBase]: 3/117 cut-off events. [2023-08-27 09:59:33,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:59:33,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 09:59:33,163 INFO L119 LiptonReduction]: Number of co-enabled transitions 2716 [2023-08-27 09:59:36,470 INFO L134 LiptonReduction]: Checked pairs total: 8853 [2023-08-27 09:59:36,471 INFO L136 LiptonReduction]: Total number of compositions: 102 [2023-08-27 09:59:36,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 09:59:36,488 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;@2fd60b72, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 09:59:36,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 09:59:36,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 09:59:36,492 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-27 09:59:36,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:59:36,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:36,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 09:59:36,494 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-27 09:59:36,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash 535148598, now seen corresponding path program 1 times [2023-08-27 09:59:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:36,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584004161] [2023-08-27 09:59:36,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:36,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:36,763 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-27 09:59:36,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:36,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584004161] [2023-08-27 09:59:36,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584004161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:36,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:36,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 09:59:36,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142503838] [2023-08-27 09:59:36,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:36,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:59:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:36,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:59:36,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:59:36,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-27 09:59:36,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 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-27 09:59:36,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:36,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-27 09:59:36,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:37,177 INFO L124 PetriNetUnfolderBase]: 1549/2386 cut-off events. [2023-08-27 09:59:37,177 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-27 09:59:37,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 2386 events. 1549/2386 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12181 event pairs, 455 based on Foata normal form. 0/1723 useless extension candidates. Maximal degree in co-relation 4788. Up to 1831 conditions per place. [2023-08-27 09:59:37,194 INFO L140 encePairwiseOnDemand]: 211/222 looper letters, 42 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-08-27 09:59:37,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 205 flow [2023-08-27 09:59:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:59:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:59:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-27 09:59:37,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2023-08-27 09:59:37,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-27 09:59:37,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-27 09:59:37,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:37,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-27 09:59:37,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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-27 09:59:37,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 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-27 09:59:37,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 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-27 09:59:37,218 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 342 transitions. [2023-08-27 09:59:37,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 205 flow [2023-08-27 09:59:37,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 09:59:37,222 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 102 flow [2023-08-27 09:59:37,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, 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=102, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-27 09:59:37,226 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-27 09:59:37,226 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 102 flow [2023-08-27 09:59:37,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 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-27 09:59:37,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:37,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:37,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 09:59:37,227 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-27 09:59:37,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1069323934, now seen corresponding path program 1 times [2023-08-27 09:59:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:37,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021259766] [2023-08-27 09:59:37,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:37,416 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-27 09:59:37,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:37,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021259766] [2023-08-27 09:59:37,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021259766] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:37,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:37,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 09:59:37,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287959218] [2023-08-27 09:59:37,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:37,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:59:37,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:37,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:59:37,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:59:37,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-08-27 09:59:37,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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-27 09:59:37,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:37,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-08-27 09:59:37,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:37,652 INFO L124 PetriNetUnfolderBase]: 1127/1897 cut-off events. [2023-08-27 09:59:37,653 INFO L125 PetriNetUnfolderBase]: For 197/237 co-relation queries the response was YES. [2023-08-27 09:59:37,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4483 conditions, 1897 events. 1127/1897 cut-off events. For 197/237 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10960 event pairs, 195 based on Foata normal form. 0/1581 useless extension candidates. Maximal degree in co-relation 4472. Up to 1387 conditions per place. [2023-08-27 09:59:37,666 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 38 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-27 09:59:37,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 222 flow [2023-08-27 09:59:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:59:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:59:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-27 09:59:37,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2023-08-27 09:59:37,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-27 09:59:37,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-27 09:59:37,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:37,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-27 09:59:37,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 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-27 09:59:37,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 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-27 09:59:37,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 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-27 09:59:37,679 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 102 flow. Second operand 3 states and 336 transitions. [2023-08-27 09:59:37,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 222 flow [2023-08-27 09:59:37,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:59:37,686 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 100 flow [2023-08-27 09:59:37,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=96, 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=100, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-08-27 09:59:37,687 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-27 09:59:37,688 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 100 flow [2023-08-27 09:59:37,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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-27 09:59:37,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:37,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:37,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 09:59:37,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:37,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -455548888, now seen corresponding path program 1 times [2023-08-27 09:59:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:37,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285324499] [2023-08-27 09:59:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:37,970 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-27 09:59:37,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:37,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285324499] [2023-08-27 09:59:37,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285324499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:37,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:37,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:59:37,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18600866] [2023-08-27 09:59:37,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:37,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:37,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:37,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:37,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:37,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 222 [2023-08-27 09:59:37,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 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-27 09:59:37,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:37,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 222 [2023-08-27 09:59:37,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:38,653 INFO L124 PetriNetUnfolderBase]: 3581/5571 cut-off events. [2023-08-27 09:59:38,653 INFO L125 PetriNetUnfolderBase]: For 855/1007 co-relation queries the response was YES. [2023-08-27 09:59:38,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13028 conditions, 5571 events. 3581/5571 cut-off events. For 855/1007 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 31554 event pairs, 1034 based on Foata normal form. 6/4772 useless extension candidates. Maximal degree in co-relation 13016. Up to 2520 conditions per place. [2023-08-27 09:59:38,689 INFO L140 encePairwiseOnDemand]: 212/222 looper letters, 76 selfloop transitions, 16 changer transitions 0/95 dead transitions. [2023-08-27 09:59:38,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 95 transitions, 472 flow [2023-08-27 09:59:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 09:59:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 09:59:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2023-08-27 09:59:38,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657657657657658 [2023-08-27 09:59:38,691 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 517 transitions. [2023-08-27 09:59:38,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 517 transitions. [2023-08-27 09:59:38,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:38,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 517 transitions. [2023-08-27 09:59:38,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 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-27 09:59:38,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 09:59:38,695 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 09:59:38,695 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 100 flow. Second operand 5 states and 517 transitions. [2023-08-27 09:59:38,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 95 transitions, 472 flow [2023-08-27 09:59:38,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 95 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:59:38,699 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 224 flow [2023-08-27 09:59:38,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2023-08-27 09:59:38,700 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-27 09:59:38,700 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 224 flow [2023-08-27 09:59:38,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 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-27 09:59:38,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:38,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:38,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 09:59:38,701 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:38,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1518029276, now seen corresponding path program 1 times [2023-08-27 09:59:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:38,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599445122] [2023-08-27 09:59:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:38,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:38,769 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-27 09:59:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599445122] [2023-08-27 09:59:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599445122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:38,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:38,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:59:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626991776] [2023-08-27 09:59:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:38,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:38,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:38,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:38,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-27 09:59:38,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 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-27 09:59:38,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:38,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-27 09:59:38,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:39,268 INFO L124 PetriNetUnfolderBase]: 2716/4220 cut-off events. [2023-08-27 09:59:39,269 INFO L125 PetriNetUnfolderBase]: For 4447/4641 co-relation queries the response was YES. [2023-08-27 09:59:39,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13239 conditions, 4220 events. 2716/4220 cut-off events. For 4447/4641 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 24125 event pairs, 582 based on Foata normal form. 43/3748 useless extension candidates. Maximal degree in co-relation 13223. Up to 2949 conditions per place. [2023-08-27 09:59:39,306 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 55 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2023-08-27 09:59:39,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 440 flow [2023-08-27 09:59:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:59:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:59:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-08-27 09:59:39,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481981981981982 [2023-08-27 09:59:39,308 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-08-27 09:59:39,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-08-27 09:59:39,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:39,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-08-27 09:59:39,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 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-27 09:59:39,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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-27 09:59:39,312 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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-27 09:59:39,312 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 224 flow. Second operand 4 states and 428 transitions. [2023-08-27 09:59:39,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 440 flow [2023-08-27 09:59:39,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 09:59:39,317 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 220 flow [2023-08-27 09:59:39,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2023-08-27 09:59:39,318 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-27 09:59:39,318 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 220 flow [2023-08-27 09:59:39,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 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-27 09:59:39,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:39,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:39,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 09:59:39,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:39,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1503315747, now seen corresponding path program 1 times [2023-08-27 09:59:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584966723] [2023-08-27 09:59:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:39,362 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-27 09:59:39,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:39,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584966723] [2023-08-27 09:59:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584966723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:39,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:39,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:59:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491534641] [2023-08-27 09:59:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:39,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:39,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-27 09:59:39,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 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-27 09:59:39,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:39,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-27 09:59:39,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:39,791 INFO L124 PetriNetUnfolderBase]: 2130/3290 cut-off events. [2023-08-27 09:59:39,791 INFO L125 PetriNetUnfolderBase]: For 4458/4650 co-relation queries the response was YES. [2023-08-27 09:59:39,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10810 conditions, 3290 events. 2130/3290 cut-off events. For 4458/4650 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17930 event pairs, 484 based on Foata normal form. 41/3206 useless extension candidates. Maximal degree in co-relation 10792. Up to 1369 conditions per place. [2023-08-27 09:59:39,818 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 77 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2023-08-27 09:59:39,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 93 transitions, 614 flow [2023-08-27 09:59:39,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:59:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:59:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2023-08-27 09:59:39,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-27 09:59:39,820 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 444 transitions. [2023-08-27 09:59:39,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 444 transitions. [2023-08-27 09:59:39,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:39,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 444 transitions. [2023-08-27 09:59:39,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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-27 09:59:39,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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-27 09:59:39,824 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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-27 09:59:39,824 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 220 flow. Second operand 4 states and 444 transitions. [2023-08-27 09:59:39,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 93 transitions, 614 flow [2023-08-27 09:59:39,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 93 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:59:39,830 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 259 flow [2023-08-27 09:59:39,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-08-27 09:59:39,831 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-27 09:59:39,831 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 259 flow [2023-08-27 09:59:39,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 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-27 09:59:39,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:39,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:39,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 09:59:39,832 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:39,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash -179051600, now seen corresponding path program 1 times [2023-08-27 09:59:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:39,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072411325] [2023-08-27 09:59:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:39,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:39,942 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-27 09:59:39,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:39,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072411325] [2023-08-27 09:59:39,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072411325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:39,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:39,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:59:39,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881038238] [2023-08-27 09:59:39,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:39,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:59:39,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:39,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:59:39,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:59:39,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 222 [2023-08-27 09:59:39,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 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-27 09:59:39,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:39,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 222 [2023-08-27 09:59:39,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:40,480 INFO L124 PetriNetUnfolderBase]: 2831/4208 cut-off events. [2023-08-27 09:59:40,480 INFO L125 PetriNetUnfolderBase]: For 7253/7253 co-relation queries the response was YES. [2023-08-27 09:59:40,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15588 conditions, 4208 events. 2831/4208 cut-off events. For 7253/7253 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 20314 event pairs, 441 based on Foata normal form. 150/4310 useless extension candidates. Maximal degree in co-relation 15569. Up to 1501 conditions per place. [2023-08-27 09:59:40,509 INFO L140 encePairwiseOnDemand]: 212/222 looper letters, 106 selfloop transitions, 25 changer transitions 6/137 dead transitions. [2023-08-27 09:59:40,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 137 transitions, 1066 flow [2023-08-27 09:59:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:59:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:59:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 700 transitions. [2023-08-27 09:59:40,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2023-08-27 09:59:40,512 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 700 transitions. [2023-08-27 09:59:40,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 700 transitions. [2023-08-27 09:59:40,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:40,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 700 transitions. [2023-08-27 09:59:40,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 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-27 09:59:40,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 09:59:40,516 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 09:59:40,517 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 259 flow. Second operand 7 states and 700 transitions. [2023-08-27 09:59:40,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 137 transitions, 1066 flow [2023-08-27 09:59:40,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 137 transitions, 1000 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-27 09:59:40,528 INFO L231 Difference]: Finished difference. Result has 58 places, 65 transitions, 485 flow [2023-08-27 09:59:40,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=485, PETRI_PLACES=58, PETRI_TRANSITIONS=65} [2023-08-27 09:59:40,529 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2023-08-27 09:59:40,529 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 65 transitions, 485 flow [2023-08-27 09:59:40,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 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-27 09:59:40,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:40,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:40,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 09:59:40,530 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-27 09:59:40,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash -477963899, now seen corresponding path program 1 times [2023-08-27 09:59:40,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:40,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603714615] [2023-08-27 09:59:40,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:40,667 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-27 09:59:40,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:40,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603714615] [2023-08-27 09:59:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603714615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:40,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:40,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:59:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071004376] [2023-08-27 09:59:40,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:40,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:59:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:59:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:59:40,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 222 [2023-08-27 09:59:40,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 65 transitions, 485 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 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-27 09:59:40,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:40,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 222 [2023-08-27 09:59:40,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:41,325 INFO L124 PetriNetUnfolderBase]: 3018/4487 cut-off events. [2023-08-27 09:59:41,325 INFO L125 PetriNetUnfolderBase]: For 13458/13458 co-relation queries the response was YES. [2023-08-27 09:59:41,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18654 conditions, 4487 events. 3018/4487 cut-off events. For 13458/13458 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 22239 event pairs, 488 based on Foata normal form. 124/4557 useless extension candidates. Maximal degree in co-relation 18629. Up to 1941 conditions per place. [2023-08-27 09:59:41,359 INFO L140 encePairwiseOnDemand]: 212/222 looper letters, 102 selfloop transitions, 48 changer transitions 6/156 dead transitions. [2023-08-27 09:59:41,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 156 transitions, 1320 flow [2023-08-27 09:59:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:59:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:59:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 712 transitions. [2023-08-27 09:59:41,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45817245817245816 [2023-08-27 09:59:41,362 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 712 transitions. [2023-08-27 09:59:41,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 712 transitions. [2023-08-27 09:59:41,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:41,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 712 transitions. [2023-08-27 09:59:41,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 0 states have call successors, (0), 0 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-27 09:59:41,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 09:59:41,366 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 09:59:41,366 INFO L175 Difference]: Start difference. First operand has 58 places, 65 transitions, 485 flow. Second operand 7 states and 712 transitions. [2023-08-27 09:59:41,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 156 transitions, 1320 flow [2023-08-27 09:59:41,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 156 transitions, 1320 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 09:59:41,422 INFO L231 Difference]: Finished difference. Result has 70 places, 84 transitions, 867 flow [2023-08-27 09:59:41,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=867, PETRI_PLACES=70, PETRI_TRANSITIONS=84} [2023-08-27 09:59:41,422 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-08-27 09:59:41,423 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 84 transitions, 867 flow [2023-08-27 09:59:41,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 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-27 09:59:41,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:41,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:41,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 09:59:41,423 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-27 09:59:41,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1930565271, now seen corresponding path program 1 times [2023-08-27 09:59:41,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:41,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447282567] [2023-08-27 09:59:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:41,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:41,563 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-27 09:59:41,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:41,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447282567] [2023-08-27 09:59:41,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447282567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:41,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:41,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:59:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220058855] [2023-08-27 09:59:41,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:41,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:59:41,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:41,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:59:41,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:59:41,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 222 [2023-08-27 09:59:41,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 84 transitions, 867 flow. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 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-27 09:59:41,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:41,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 222 [2023-08-27 09:59:41,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:42,166 INFO L124 PetriNetUnfolderBase]: 3338/4967 cut-off events. [2023-08-27 09:59:42,166 INFO L125 PetriNetUnfolderBase]: For 29084/29084 co-relation queries the response was YES. [2023-08-27 09:59:42,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23913 conditions, 4967 events. 3338/4967 cut-off events. For 29084/29084 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 25191 event pairs, 385 based on Foata normal form. 110/5011 useless extension candidates. Maximal degree in co-relation 23880. Up to 1734 conditions per place. [2023-08-27 09:59:42,220 INFO L140 encePairwiseOnDemand]: 213/222 looper letters, 145 selfloop transitions, 51 changer transitions 6/202 dead transitions. [2023-08-27 09:59:42,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 202 transitions, 2216 flow [2023-08-27 09:59:42,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:59:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:59:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 706 transitions. [2023-08-27 09:59:42,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543114543114543 [2023-08-27 09:59:42,222 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 706 transitions. [2023-08-27 09:59:42,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 706 transitions. [2023-08-27 09:59:42,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:42,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 706 transitions. [2023-08-27 09:59:42,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 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-27 09:59:42,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 09:59:42,227 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 09:59:42,227 INFO L175 Difference]: Start difference. First operand has 70 places, 84 transitions, 867 flow. Second operand 7 states and 706 transitions. [2023-08-27 09:59:42,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 202 transitions, 2216 flow [2023-08-27 09:59:42,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 202 transitions, 2154 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-27 09:59:42,377 INFO L231 Difference]: Finished difference. Result has 81 places, 117 transitions, 1501 flow [2023-08-27 09:59:42,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1501, PETRI_PLACES=81, PETRI_TRANSITIONS=117} [2023-08-27 09:59:42,379 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2023-08-27 09:59:42,379 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 117 transitions, 1501 flow [2023-08-27 09:59:42,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 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-27 09:59:42,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:42,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:42,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 09:59:42,380 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-27 09:59:42,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:42,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1746335945, now seen corresponding path program 1 times [2023-08-27 09:59:42,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:42,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050260898] [2023-08-27 09:59:42,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:42,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:42,598 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-27 09:59:42,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:42,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050260898] [2023-08-27 09:59:42,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050260898] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:42,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:42,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:59:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405845853] [2023-08-27 09:59:42,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:42,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:42,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 222 [2023-08-27 09:59:42,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 117 transitions, 1501 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 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-27 09:59:42,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:42,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 222 [2023-08-27 09:59:42,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:42,892 INFO L124 PetriNetUnfolderBase]: 1320/2272 cut-off events. [2023-08-27 09:59:42,892 INFO L125 PetriNetUnfolderBase]: For 15334/15690 co-relation queries the response was YES. [2023-08-27 09:59:42,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10695 conditions, 2272 events. 1320/2272 cut-off events. For 15334/15690 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13069 event pairs, 234 based on Foata normal form. 220/2365 useless extension candidates. Maximal degree in co-relation 10655. Up to 1631 conditions per place. [2023-08-27 09:59:42,910 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 114 selfloop transitions, 8 changer transitions 3/154 dead transitions. [2023-08-27 09:59:42,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 154 transitions, 1925 flow [2023-08-27 09:59:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 09:59:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 09:59:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2023-08-27 09:59:42,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2023-08-27 09:59:42,913 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2023-08-27 09:59:42,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2023-08-27 09:59:42,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:42,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2023-08-27 09:59:42,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:42,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 09:59:42,916 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 09:59:42,916 INFO L175 Difference]: Start difference. First operand has 81 places, 117 transitions, 1501 flow. Second operand 5 states and 530 transitions. [2023-08-27 09:59:42,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 154 transitions, 1925 flow [2023-08-27 09:59:42,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 154 transitions, 1919 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-27 09:59:42,979 INFO L231 Difference]: Finished difference. Result has 88 places, 100 transitions, 1227 flow [2023-08-27 09:59:42,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1227, PETRI_PLACES=88, PETRI_TRANSITIONS=100} [2023-08-27 09:59:42,980 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2023-08-27 09:59:42,980 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 100 transitions, 1227 flow [2023-08-27 09:59:42,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 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-27 09:59:42,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:42,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:42,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 09:59:42,981 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-27 09:59:42,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1075150272, now seen corresponding path program 1 times [2023-08-27 09:59:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:42,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118211615] [2023-08-27 09:59:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:43,142 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-27 09:59:43,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:43,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118211615] [2023-08-27 09:59:43,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118211615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:43,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:43,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:59:43,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080664682] [2023-08-27 09:59:43,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:43,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:59:43,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:43,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:59:43,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:59:43,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 222 [2023-08-27 09:59:43,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 100 transitions, 1227 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 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-27 09:59:43,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:43,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 222 [2023-08-27 09:59:43,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:43,420 INFO L124 PetriNetUnfolderBase]: 676/1266 cut-off events. [2023-08-27 09:59:43,420 INFO L125 PetriNetUnfolderBase]: For 7892/8162 co-relation queries the response was YES. [2023-08-27 09:59:43,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5970 conditions, 1266 events. 676/1266 cut-off events. For 7892/8162 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7077 event pairs, 93 based on Foata normal form. 162/1343 useless extension candidates. Maximal degree in co-relation 5925. Up to 397 conditions per place. [2023-08-27 09:59:43,428 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 112 selfloop transitions, 15 changer transitions 3/146 dead transitions. [2023-08-27 09:59:43,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 146 transitions, 1697 flow [2023-08-27 09:59:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:59:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:59:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 739 transitions. [2023-08-27 09:59:43,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47554697554697556 [2023-08-27 09:59:43,435 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 739 transitions. [2023-08-27 09:59:43,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 739 transitions. [2023-08-27 09:59:43,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:43,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 739 transitions. [2023-08-27 09:59:43,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 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-27 09:59:43,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 09:59:43,442 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 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-27 09:59:43,442 INFO L175 Difference]: Start difference. First operand has 88 places, 100 transitions, 1227 flow. Second operand 7 states and 739 transitions. [2023-08-27 09:59:43,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 146 transitions, 1697 flow [2023-08-27 09:59:43,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 146 transitions, 1572 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-08-27 09:59:43,464 INFO L231 Difference]: Finished difference. Result has 87 places, 75 transitions, 775 flow [2023-08-27 09:59:43,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=775, PETRI_PLACES=87, PETRI_TRANSITIONS=75} [2023-08-27 09:59:43,466 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2023-08-27 09:59:43,466 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 75 transitions, 775 flow [2023-08-27 09:59:43,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 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-27 09:59:43,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:43,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:43,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 09:59:43,467 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:43,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:43,467 INFO L85 PathProgramCache]: Analyzing trace with hash -93188178, now seen corresponding path program 1 times [2023-08-27 09:59:43,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:43,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797134784] [2023-08-27 09:59:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:43,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:43,559 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-27 09:59:43,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:43,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797134784] [2023-08-27 09:59:43,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797134784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:43,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:43,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:59:43,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308738101] [2023-08-27 09:59:43,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:43,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:59:43,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:43,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:59:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:59:43,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-08-27 09:59:43,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 75 transitions, 775 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-27 09:59:43,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:43,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-08-27 09:59:43,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:43,763 INFO L124 PetriNetUnfolderBase]: 625/1170 cut-off events. [2023-08-27 09:59:43,763 INFO L125 PetriNetUnfolderBase]: For 6557/6776 co-relation queries the response was YES. [2023-08-27 09:59:43,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 1170 events. 625/1170 cut-off events. For 6557/6776 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6469 event pairs, 127 based on Foata normal form. 51/1185 useless extension candidates. Maximal degree in co-relation 5859. Up to 426 conditions per place. [2023-08-27 09:59:43,771 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 58 selfloop transitions, 14 changer transitions 26/110 dead transitions. [2023-08-27 09:59:43,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 110 transitions, 1278 flow [2023-08-27 09:59:43,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 09:59:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 09:59:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-27 09:59:43,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2023-08-27 09:59:43,773 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-27 09:59:43,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-27 09:59:43,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:43,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-27 09:59:43,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-27 09:59:43,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 09:59:43,776 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 09:59:43,776 INFO L175 Difference]: Start difference. First operand has 87 places, 75 transitions, 775 flow. Second operand 5 states and 534 transitions. [2023-08-27 09:59:43,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 110 transitions, 1278 flow [2023-08-27 09:59:43,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 110 transitions, 1251 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 09:59:43,793 INFO L231 Difference]: Finished difference. Result has 84 places, 52 transitions, 516 flow [2023-08-27 09:59:43,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=516, PETRI_PLACES=84, PETRI_TRANSITIONS=52} [2023-08-27 09:59:43,794 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 44 predicate places. [2023-08-27 09:59:43,794 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 52 transitions, 516 flow [2023-08-27 09:59:43,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-27 09:59:43,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:43,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:43,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 09:59:43,795 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:43,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:43,795 INFO L85 PathProgramCache]: Analyzing trace with hash -699077083, now seen corresponding path program 1 times [2023-08-27 09:59:43,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:43,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791639314] [2023-08-27 09:59:43,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:43,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:44,004 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-27 09:59:44,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791639314] [2023-08-27 09:59:44,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791639314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:44,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:44,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 09:59:44,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369794784] [2023-08-27 09:59:44,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:44,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:59:44,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:44,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:59:44,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 09:59:44,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 222 [2023-08-27 09:59:44,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 52 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 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-27 09:59:44,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:44,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 222 [2023-08-27 09:59:44,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:44,238 INFO L124 PetriNetUnfolderBase]: 508/926 cut-off events. [2023-08-27 09:59:44,238 INFO L125 PetriNetUnfolderBase]: For 5017/5253 co-relation queries the response was YES. [2023-08-27 09:59:44,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 926 events. 508/926 cut-off events. For 5017/5253 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4944 event pairs, 53 based on Foata normal form. 81/977 useless extension candidates. Maximal degree in co-relation 4506. Up to 307 conditions per place. [2023-08-27 09:59:44,245 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 74 selfloop transitions, 17 changer transitions 18/121 dead transitions. [2023-08-27 09:59:44,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 1318 flow [2023-08-27 09:59:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 09:59:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 09:59:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 919 transitions. [2023-08-27 09:59:44,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45995995995996 [2023-08-27 09:59:44,248 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 919 transitions. [2023-08-27 09:59:44,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 919 transitions. [2023-08-27 09:59:44,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:44,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 919 transitions. [2023-08-27 09:59:44,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 0 states have call successors, (0), 0 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-27 09:59:44,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 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-27 09:59:44,253 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 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-27 09:59:44,254 INFO L175 Difference]: Start difference. First operand has 84 places, 52 transitions, 516 flow. Second operand 9 states and 919 transitions. [2023-08-27 09:59:44,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 1318 flow [2023-08-27 09:59:44,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 121 transitions, 1127 flow, removed 32 selfloop flow, removed 17 redundant places. [2023-08-27 09:59:44,267 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 457 flow [2023-08-27 09:59:44,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=457, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2023-08-27 09:59:44,268 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-08-27 09:59:44,268 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 457 flow [2023-08-27 09:59:44,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 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-27 09:59:44,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:44,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:44,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 09:59:44,269 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:44,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1382276766, now seen corresponding path program 1 times [2023-08-27 09:59:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:44,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721337271] [2023-08-27 09:59:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:44,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:44,526 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-27 09:59:44,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:44,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721337271] [2023-08-27 09:59:44,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721337271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:44,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:44,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:59:44,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776426067] [2023-08-27 09:59:44,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:44,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:59:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:44,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:59:44,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:59:44,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 222 [2023-08-27 09:59:44,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 457 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 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-27 09:59:44,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:44,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 222 [2023-08-27 09:59:44,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:44,784 INFO L124 PetriNetUnfolderBase]: 681/1304 cut-off events. [2023-08-27 09:59:44,784 INFO L125 PetriNetUnfolderBase]: For 6024/6147 co-relation queries the response was YES. [2023-08-27 09:59:44,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6508 conditions, 1304 events. 681/1304 cut-off events. For 6024/6147 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7692 event pairs, 135 based on Foata normal form. 17/1296 useless extension candidates. Maximal degree in co-relation 6475. Up to 690 conditions per place. [2023-08-27 09:59:44,789 INFO L140 encePairwiseOnDemand]: 218/222 looper letters, 37 selfloop transitions, 1 changer transitions 56/99 dead transitions. [2023-08-27 09:59:44,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 99 transitions, 990 flow [2023-08-27 09:59:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 09:59:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 09:59:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-08-27 09:59:44,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45315315315315313 [2023-08-27 09:59:44,791 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-08-27 09:59:44,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-08-27 09:59:44,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:44,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-08-27 09:59:44,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 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-27 09:59:44,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 09:59:44,794 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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-27 09:59:44,794 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 457 flow. Second operand 5 states and 503 transitions. [2023-08-27 09:59:44,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 99 transitions, 990 flow [2023-08-27 09:59:44,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 858 flow, removed 23 selfloop flow, removed 9 redundant places. [2023-08-27 09:59:44,817 INFO L231 Difference]: Finished difference. Result has 67 places, 38 transitions, 259 flow [2023-08-27 09:59:44,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=67, PETRI_TRANSITIONS=38} [2023-08-27 09:59:44,817 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-08-27 09:59:44,818 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 38 transitions, 259 flow [2023-08-27 09:59:44,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 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-27 09:59:44,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:44,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:44,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 09:59:44,818 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:44,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -795217104, now seen corresponding path program 2 times [2023-08-27 09:59:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013011952] [2023-08-27 09:59:44,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:45,026 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-27 09:59:45,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:45,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013011952] [2023-08-27 09:59:45,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013011952] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:45,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:45,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:59:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841203811] [2023-08-27 09:59:45,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:45,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:45,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:45,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:45,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:45,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 222 [2023-08-27 09:59:45,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 38 transitions, 259 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 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-27 09:59:45,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:45,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 222 [2023-08-27 09:59:45,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:45,150 INFO L124 PetriNetUnfolderBase]: 369/706 cut-off events. [2023-08-27 09:59:45,150 INFO L125 PetriNetUnfolderBase]: For 2125/2125 co-relation queries the response was YES. [2023-08-27 09:59:45,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2955 conditions, 706 events. 369/706 cut-off events. For 2125/2125 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3340 event pairs, 221 based on Foata normal form. 1/706 useless extension candidates. Maximal degree in co-relation 2931. Up to 450 conditions per place. [2023-08-27 09:59:45,153 INFO L140 encePairwiseOnDemand]: 218/222 looper letters, 30 selfloop transitions, 2 changer transitions 22/55 dead transitions. [2023-08-27 09:59:45,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 467 flow [2023-08-27 09:59:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:59:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:59:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2023-08-27 09:59:45,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2023-08-27 09:59:45,156 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 400 transitions. [2023-08-27 09:59:45,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 400 transitions. [2023-08-27 09:59:45,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:45,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 400 transitions. [2023-08-27 09:59:45,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-27 09:59:45,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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-27 09:59:45,159 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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-27 09:59:45,159 INFO L175 Difference]: Start difference. First operand has 67 places, 38 transitions, 259 flow. Second operand 4 states and 400 transitions. [2023-08-27 09:59:45,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 467 flow [2023-08-27 09:59:45,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 421 flow, removed 6 selfloop flow, removed 10 redundant places. [2023-08-27 09:59:45,165 INFO L231 Difference]: Finished difference. Result has 59 places, 28 transitions, 153 flow [2023-08-27 09:59:45,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=59, PETRI_TRANSITIONS=28} [2023-08-27 09:59:45,166 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-27 09:59:45,166 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 28 transitions, 153 flow [2023-08-27 09:59:45,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 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-27 09:59:45,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:45,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:45,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 09:59:45,167 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:45,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash -811859814, now seen corresponding path program 3 times [2023-08-27 09:59:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:45,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203441439] [2023-08-27 09:59:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:45,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 09:59:45,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 09:59:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 09:59:45,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 09:59:45,309 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 09:59:45,310 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 09:59:45,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 09:59:45,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 09:59:45,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-27 09:59:45,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 09:59:45,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (12 of 18 remaining) [2023-08-27 09:59:45,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 09:59:45,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 09:59:45,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 09:59:45,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 09:59:45,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 09:59:45,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 09:59:45,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 09:59:45,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-27 09:59:45,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 09:59:45,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (2 of 18 remaining) [2023-08-27 09:59:45,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 09:59:45,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 09:59:45,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 09:59:45,317 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:45,322 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 09:59:45,322 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 09:59:45,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:59:45 BasicIcfg [2023-08-27 09:59:45,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 09:59:45,405 INFO L158 Benchmark]: Toolchain (without parser) took 13734.04ms. Allocated memory was 360.7MB in the beginning and 799.0MB in the end (delta: 438.3MB). Free memory was 335.8MB in the beginning and 446.1MB in the end (delta: -110.4MB). Peak memory consumption was 329.5MB. Max. memory is 16.0GB. [2023-08-27 09:59:45,406 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 360.7MB. Free memory is still 337.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 09:59:45,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.55ms. Allocated memory is still 360.7MB. Free memory was 335.8MB in the beginning and 311.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 09:59:45,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.92ms. Allocated memory is still 360.7MB. Free memory was 311.7MB in the beginning and 309.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 09:59:45,406 INFO L158 Benchmark]: Boogie Preprocessor took 30.28ms. Allocated memory is still 360.7MB. Free memory was 309.0MB in the beginning and 307.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 09:59:45,407 INFO L158 Benchmark]: RCFGBuilder took 679.39ms. Allocated memory is still 360.7MB. Free memory was 307.0MB in the beginning and 316.2MB in the end (delta: -9.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.0GB. [2023-08-27 09:59:45,407 INFO L158 Benchmark]: TraceAbstraction took 12413.34ms. Allocated memory was 360.7MB in the beginning and 799.0MB in the end (delta: 438.3MB). Free memory was 315.3MB in the beginning and 446.1MB in the end (delta: -130.9MB). Peak memory consumption was 308.3MB. Max. memory is 16.0GB. [2023-08-27 09:59:45,408 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.16ms. Allocated memory is still 360.7MB. Free memory is still 337.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 560.55ms. Allocated memory is still 360.7MB. Free memory was 335.8MB in the beginning and 311.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.92ms. Allocated memory is still 360.7MB. Free memory was 311.7MB in the beginning and 309.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.28ms. Allocated memory is still 360.7MB. Free memory was 309.0MB in the beginning and 307.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 679.39ms. Allocated memory is still 360.7MB. Free memory was 307.0MB in the beginning and 316.2MB in the end (delta: -9.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.0GB. * TraceAbstraction took 12413.34ms. Allocated memory was 360.7MB in the beginning and 799.0MB in the end (delta: 438.3MB). Free memory was 315.3MB in the beginning and 446.1MB in the end (delta: -130.9MB). Peak memory consumption was 308.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: 3.3s, 124 PlacesBefore, 40 PlacesAfterwards, 117 TransitionsBefore, 31 TransitionsAfterwards, 2716 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 8853 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3435, independent: 3199, independent conditional: 0, independent unconditional: 3199, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1494, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3435, independent: 1742, independent conditional: 0, independent unconditional: 1742, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 1494, unknown conditional: 0, unknown unconditional: 1494] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 166, Positive conditional cache size: 0, Positive unconditional cache size: 166, 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L846] 0 pthread_t t156; [L847] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t156, ((void *)0), P0, ((void *)0))=-3, t156={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] [L848] 0 pthread_t t157; [L849] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t157, ((void *)0), P1, ((void *)0))=-2, t156={5:0}, t157={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] [L850] 0 pthread_t t158; [L851] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t158, ((void *)0), P2, ((void *)0))=-1, t156={5:0}, t157={6:0}, t158={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] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EAX = y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=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] [L821] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=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] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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] [L765] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 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) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 2 __unbuffered_p1_EBX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, 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] [L786] EXPR 2 __unbuffered_cnt + 1 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L824] 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) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=0, x=2, 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] [L755] EXPR 1 __unbuffered_cnt + 1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L831] EXPR 3 __unbuffered_cnt + 1 [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 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 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice2=0, x=2, 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] [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L866] 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", "mix006.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, 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: 755]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 786]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 786]: 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: 831]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 851]: 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, 152 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: 12.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 430 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1427 IncrementalHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 34 mSDtfsCounter, 1427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1501occurred in iteration=8, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-27 09:59:45,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...