/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:18:52,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:18:52,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:18:52,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:18:52,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:18:52,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:18:52,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:18:52,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:18:52,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:18:52,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:18:52,587 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:18:52,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:18:52,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:18:52,589 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:18:52,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:18:52,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:18:52,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:18:52,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:18:52,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:18:52,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:18:52,590 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:18:52,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:18:52,592 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:18:52,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:18:52,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:18:52,593 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:18:52,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:18:52,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:18:52,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:18:52,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:18:52,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:18:52,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:18:52,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:18:52,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:18:52,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:18:52,596 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:18:52,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:18:52,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:18:52,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:18:52,933 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:18:52,934 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:18:52,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2023-08-26 21:18:54,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:18:54,431 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:18:54,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2023-08-26 21:18:54,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db90fc6f1/2da78868bc924025acad961a007bb194/FLAG14af5faaa [2023-08-26 21:18:54,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db90fc6f1/2da78868bc924025acad961a007bb194 [2023-08-26 21:18:54,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:18:54,470 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:18:54,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:18:54,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:18:54,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:18:54,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:18:54" (1/1) ... [2023-08-26 21:18:54,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7370994a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:54, skipping insertion in model container [2023-08-26 21:18:54,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:18:54" (1/1) ... [2023-08-26 21:18:54,522 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:18:54,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:18:54,939 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:18:54,967 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:18:54,969 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:18:55,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:18:55,050 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:18:55,050 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:18:55,056 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:18:55,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55 WrapperNode [2023-08-26 21:18:55,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:18:55,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:18:55,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:18:55,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:18:55,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (1/1) ... [2023-08-26 21:18:55,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (1/1) ... [2023-08-26 21:18:55,135 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 170 [2023-08-26 21:18:55,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:18:55,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:18:55,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:18:55,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:18:55,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (1/1) ... [2023-08-26 21:18:55,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (1/1) ... [2023-08-26 21:18:55,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (1/1) ... [2023-08-26 21:18:55,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (1/1) ... [2023-08-26 21:18:55,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (1/1) ... [2023-08-26 21:18:55,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (1/1) ... [2023-08-26 21:18:55,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (1/1) ... [2023-08-26 21:18:55,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (1/1) ... [2023-08-26 21:18:55,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:18:55,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:18:55,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:18:55,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:18:55,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (1/1) ... [2023-08-26 21:18:55,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:18:55,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:18:55,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:18:55,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:18:55,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:18:55,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:18:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:18:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:18:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:18:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:18:55,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:18:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:18:55,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:18:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:18:55,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:18:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:18:55,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:18:55,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:18:55,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:18:55,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:18:55,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:18:55,273 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:18:55,398 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:18:55,400 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:18:55,753 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:18:55,879 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:18:55,879 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:18:55,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:18:55 BoogieIcfgContainer [2023-08-26 21:18:55,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:18:55,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:18:55,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:18:55,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:18:55,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:18:54" (1/3) ... [2023-08-26 21:18:55,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a9af2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:18:55, skipping insertion in model container [2023-08-26 21:18:55,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:18:55" (2/3) ... [2023-08-26 21:18:55,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a9af2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:18:55, skipping insertion in model container [2023-08-26 21:18:55,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:18:55" (3/3) ... [2023-08-26 21:18:55,890 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2023-08-26 21:18:55,906 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:18:55,907 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:18:55,907 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:18:55,971 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:18:56,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 144 transitions, 308 flow [2023-08-26 21:18:56,081 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-08-26 21:18:56,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:18:56,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:18:56,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 144 transitions, 308 flow [2023-08-26 21:18:56,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 140 transitions, 292 flow [2023-08-26 21:18:56,099 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:18:56,111 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 140 transitions, 292 flow [2023-08-26 21:18:56,118 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 140 transitions, 292 flow [2023-08-26 21:18:56,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 292 flow [2023-08-26 21:18:56,168 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-08-26 21:18:56,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:18:56,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:18:56,174 INFO L119 LiptonReduction]: Number of co-enabled transitions 4652 [2023-08-26 21:19:01,136 INFO L134 LiptonReduction]: Checked pairs total: 17199 [2023-08-26 21:19:01,136 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-26 21:19:01,147 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:19:01,152 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;@6b3ddb1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:19:01,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:19:01,158 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:19:01,159 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-26 21:19:01,159 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:19:01,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:01,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:19:01,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:01,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:01,165 INFO L85 PathProgramCache]: Analyzing trace with hash 608015250, now seen corresponding path program 1 times [2023-08-26 21:19:01,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:01,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145808347] [2023-08-26 21:19:01,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:01,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:01,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:01,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145808347] [2023-08-26 21:19:01,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145808347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:01,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:01,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:19:01,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342107268] [2023-08-26 21:19:01,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:01,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:19:01,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:01,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:19:01,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:19:01,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 266 [2023-08-26 21:19:01,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:01,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:01,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 266 [2023-08-26 21:19:01,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:03,699 INFO L124 PetriNetUnfolderBase]: 12064/17407 cut-off events. [2023-08-26 21:19:03,700 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-08-26 21:19:03,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33850 conditions, 17407 events. 12064/17407 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 106453 event pairs, 4562 based on Foata normal form. 0/13569 useless extension candidates. Maximal degree in co-relation 33838. Up to 13533 conditions per place. [2023-08-26 21:19:03,845 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 48 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-26 21:19:03,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 234 flow [2023-08-26 21:19:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:19:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:19:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-26 21:19:03,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5112781954887218 [2023-08-26 21:19:03,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-26 21:19:03,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-26 21:19:03,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:03,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-26 21:19:03,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:03,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:03,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:03,871 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 3 states and 408 transitions. [2023-08-26 21:19:03,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 234 flow [2023-08-26 21:19:03,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 228 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:19:03,877 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 86 flow [2023-08-26 21:19:03,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-26 21:19:03,881 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-08-26 21:19:03,881 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 86 flow [2023-08-26 21:19:03,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:03,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:03,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:19:03,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:19:03,882 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:03,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1666836983, now seen corresponding path program 1 times [2023-08-26 21:19:03,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:03,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715604582] [2023-08-26 21:19:03,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:03,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:03,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:03,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715604582] [2023-08-26 21:19:03,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715604582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:03,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:03,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:19:03,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717416737] [2023-08-26 21:19:03,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:03,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:19:03,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:03,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:19:03,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:19:03,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:19:03,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:03,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:03,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:19:03,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:05,871 INFO L124 PetriNetUnfolderBase]: 12225/16936 cut-off events. [2023-08-26 21:19:05,872 INFO L125 PetriNetUnfolderBase]: For 735/735 co-relation queries the response was YES. [2023-08-26 21:19:05,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34824 conditions, 16936 events. 12225/16936 cut-off events. For 735/735 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 95424 event pairs, 3437 based on Foata normal form. 0/11898 useless extension candidates. Maximal degree in co-relation 34814. Up to 14728 conditions per place. [2023-08-26 21:19:05,971 INFO L140 encePairwiseOnDemand]: 253/266 looper letters, 51 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-08-26 21:19:05,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 252 flow [2023-08-26 21:19:05,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:19:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:19:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-26 21:19:05,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-08-26 21:19:05,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-26 21:19:05,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-26 21:19:05,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:05,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-26 21:19:05,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:05,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:05,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:05,980 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 86 flow. Second operand 3 states and 406 transitions. [2023-08-26 21:19:05,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 252 flow [2023-08-26 21:19:05,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:19:05,983 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 129 flow [2023-08-26 21:19:05,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-26 21:19:05,985 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-26 21:19:05,988 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 129 flow [2023-08-26 21:19:05,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:05,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:05,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:05,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:19:05,995 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:05,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1573152072, now seen corresponding path program 1 times [2023-08-26 21:19:05,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:05,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842336651] [2023-08-26 21:19:05,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:05,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:06,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842336651] [2023-08-26 21:19:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842336651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:06,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:06,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:19:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113366871] [2023-08-26 21:19:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:06,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:06,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 266 [2023-08-26 21:19:06,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:06,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:06,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 266 [2023-08-26 21:19:06,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:09,286 INFO L124 PetriNetUnfolderBase]: 23363/32923 cut-off events. [2023-08-26 21:19:09,287 INFO L125 PetriNetUnfolderBase]: For 3550/4444 co-relation queries the response was YES. [2023-08-26 21:19:09,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77685 conditions, 32923 events. 23363/32923 cut-off events. For 3550/4444 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 197370 event pairs, 4540 based on Foata normal form. 0/27720 useless extension candidates. Maximal degree in co-relation 77674. Up to 24274 conditions per place. [2023-08-26 21:19:09,489 INFO L140 encePairwiseOnDemand]: 252/266 looper letters, 72 selfloop transitions, 15 changer transitions 0/91 dead transitions. [2023-08-26 21:19:09,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 91 transitions, 449 flow [2023-08-26 21:19:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:19:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:19:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-08-26 21:19:09,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46146616541353386 [2023-08-26 21:19:09,491 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-08-26 21:19:09,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-08-26 21:19:09,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:09,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-08-26 21:19:09,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:09,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:09,495 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:09,495 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 129 flow. Second operand 4 states and 491 transitions. [2023-08-26 21:19:09,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 91 transitions, 449 flow [2023-08-26 21:19:09,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 91 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:19:09,500 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 240 flow [2023-08-26 21:19:09,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2023-08-26 21:19:09,501 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-26 21:19:09,501 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 240 flow [2023-08-26 21:19:09,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:09,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:09,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:09,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:19:09,502 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:09,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:09,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1630712751, now seen corresponding path program 1 times [2023-08-26 21:19:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:09,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559846613] [2023-08-26 21:19:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:09,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:09,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559846613] [2023-08-26 21:19:09,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559846613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:09,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:09,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:19:09,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780910588] [2023-08-26 21:19:09,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:09,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:09,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:09,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:09,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:09,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:19:09,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:09,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:09,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:19:09,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:11,757 INFO L124 PetriNetUnfolderBase]: 15311/21081 cut-off events. [2023-08-26 21:19:11,758 INFO L125 PetriNetUnfolderBase]: For 15170/15881 co-relation queries the response was YES. [2023-08-26 21:19:11,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64515 conditions, 21081 events. 15311/21081 cut-off events. For 15170/15881 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 121325 event pairs, 3555 based on Foata normal form. 293/18586 useless extension candidates. Maximal degree in co-relation 64500. Up to 15134 conditions per place. [2023-08-26 21:19:11,907 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 67 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2023-08-26 21:19:11,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 80 transitions, 494 flow [2023-08-26 21:19:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:19:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:19:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-26 21:19:11,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48120300751879697 [2023-08-26 21:19:11,910 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-26 21:19:11,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-26 21:19:11,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:11,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-26 21:19:11,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:11,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:11,918 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:11,918 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 240 flow. Second operand 4 states and 512 transitions. [2023-08-26 21:19:11,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 80 transitions, 494 flow [2023-08-26 21:19:11,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 494 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:19:11,927 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 234 flow [2023-08-26 21:19:11,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2023-08-26 21:19:11,928 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-08-26 21:19:11,928 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 234 flow [2023-08-26 21:19:11,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:11,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:11,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:11,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:19:11,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:11,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash -988770682, now seen corresponding path program 1 times [2023-08-26 21:19:11,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:11,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121432058] [2023-08-26 21:19:11,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:11,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:11,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121432058] [2023-08-26 21:19:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121432058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:11,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:11,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:19:11,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048337737] [2023-08-26 21:19:11,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:11,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:11,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:11,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:11,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:11,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:19:12,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:12,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:12,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:19:12,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:13,633 INFO L124 PetriNetUnfolderBase]: 11373/15645 cut-off events. [2023-08-26 21:19:13,633 INFO L125 PetriNetUnfolderBase]: For 13596/14053 co-relation queries the response was YES. [2023-08-26 21:19:13,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49230 conditions, 15645 events. 11373/15645 cut-off events. For 13596/14053 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 86516 event pairs, 2687 based on Foata normal form. 176/15022 useless extension candidates. Maximal degree in co-relation 49213. Up to 8443 conditions per place. [2023-08-26 21:19:13,754 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 94 selfloop transitions, 9 changer transitions 0/111 dead transitions. [2023-08-26 21:19:13,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 111 transitions, 702 flow [2023-08-26 21:19:13,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:19:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:19:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-26 21:19:13,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009398496240601 [2023-08-26 21:19:13,761 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-26 21:19:13,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-26 21:19:13,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:13,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-26 21:19:13,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:13,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:13,769 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:13,770 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 234 flow. Second operand 4 states and 533 transitions. [2023-08-26 21:19:13,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 111 transitions, 702 flow [2023-08-26 21:19:13,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 111 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:19:13,780 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 286 flow [2023-08-26 21:19:13,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2023-08-26 21:19:13,783 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-26 21:19:13,783 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 286 flow [2023-08-26 21:19:13,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:13,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:13,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:13,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:19:13,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:13,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1521962597, now seen corresponding path program 1 times [2023-08-26 21:19:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:13,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620697806] [2023-08-26 21:19:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:14,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:14,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620697806] [2023-08-26 21:19:14,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620697806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:14,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:14,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:19:14,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080847258] [2023-08-26 21:19:14,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:14,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:14,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:14,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:14,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:14,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 266 [2023-08-26 21:19:14,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:14,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:14,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 266 [2023-08-26 21:19:14,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:15,801 INFO L124 PetriNetUnfolderBase]: 15219/20693 cut-off events. [2023-08-26 21:19:15,801 INFO L125 PetriNetUnfolderBase]: For 20838/20838 co-relation queries the response was YES. [2023-08-26 21:19:15,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70958 conditions, 20693 events. 15219/20693 cut-off events. For 20838/20838 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 104085 event pairs, 3632 based on Foata normal form. 206/20485 useless extension candidates. Maximal degree in co-relation 70940. Up to 12077 conditions per place. [2023-08-26 21:19:15,956 INFO L140 encePairwiseOnDemand]: 253/266 looper letters, 94 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2023-08-26 21:19:15,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 107 transitions, 785 flow [2023-08-26 21:19:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:19:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:19:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-08-26 21:19:15,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4567669172932331 [2023-08-26 21:19:15,958 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-08-26 21:19:15,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-08-26 21:19:15,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:15,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-08-26 21:19:15,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:15,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:15,964 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:15,964 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 286 flow. Second operand 4 states and 486 transitions. [2023-08-26 21:19:15,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 107 transitions, 785 flow [2023-08-26 21:19:15,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 107 transitions, 739 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-26 21:19:15,991 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 386 flow [2023-08-26 21:19:15,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=386, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2023-08-26 21:19:15,993 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2023-08-26 21:19:15,996 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 386 flow [2023-08-26 21:19:15,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:15,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:15,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:15,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:19:15,997 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:15,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash -63802227, now seen corresponding path program 1 times [2023-08-26 21:19:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:16,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173481943] [2023-08-26 21:19:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:16,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173481943] [2023-08-26 21:19:16,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173481943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:16,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:16,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:19:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693195287] [2023-08-26 21:19:16,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:16,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:16,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:16,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:16,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:16,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 266 [2023-08-26 21:19:16,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 386 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:16,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:16,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 266 [2023-08-26 21:19:16,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:18,082 INFO L124 PetriNetUnfolderBase]: 12908/18104 cut-off events. [2023-08-26 21:19:18,082 INFO L125 PetriNetUnfolderBase]: For 27040/27439 co-relation queries the response was YES. [2023-08-26 21:19:18,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66430 conditions, 18104 events. 12908/18104 cut-off events. For 27040/27439 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 102786 event pairs, 2724 based on Foata normal form. 258/17318 useless extension candidates. Maximal degree in co-relation 66409. Up to 15129 conditions per place. [2023-08-26 21:19:18,221 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 82 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2023-08-26 21:19:18,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 96 transitions, 744 flow [2023-08-26 21:19:18,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:19:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:19:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-08-26 21:19:18,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487468671679198 [2023-08-26 21:19:18,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-08-26 21:19:18,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-08-26 21:19:18,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:18,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-08-26 21:19:18,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 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-26 21:19:18,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:18,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:18,226 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 386 flow. Second operand 3 states and 389 transitions. [2023-08-26 21:19:18,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 96 transitions, 744 flow [2023-08-26 21:19:18,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 96 transitions, 733 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 21:19:18,296 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 427 flow [2023-08-26 21:19:18,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2023-08-26 21:19:18,297 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-26 21:19:18,297 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 427 flow [2023-08-26 21:19:18,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:18,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:18,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:18,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:19:18,297 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:18,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:18,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1980637924, now seen corresponding path program 1 times [2023-08-26 21:19:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:18,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080137778] [2023-08-26 21:19:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:18,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:18,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:18,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080137778] [2023-08-26 21:19:18,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080137778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:18,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:19:18,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276210618] [2023-08-26 21:19:18,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:18,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:18,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:18,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:18,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:18,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:19:18,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 427 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:18,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:18,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:19:18,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:20,808 INFO L124 PetriNetUnfolderBase]: 13436/18733 cut-off events. [2023-08-26 21:19:20,808 INFO L125 PetriNetUnfolderBase]: For 28109/28632 co-relation queries the response was YES. [2023-08-26 21:19:20,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70434 conditions, 18733 events. 13436/18733 cut-off events. For 28109/28632 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 102794 event pairs, 3759 based on Foata normal form. 445/18338 useless extension candidates. Maximal degree in co-relation 70412. Up to 15916 conditions per place. [2023-08-26 21:19:20,954 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 89 selfloop transitions, 25 changer transitions 0/123 dead transitions. [2023-08-26 21:19:20,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 123 transitions, 981 flow [2023-08-26 21:19:20,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:19:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:19:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2023-08-26 21:19:20,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48778195488721804 [2023-08-26 21:19:20,963 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 519 transitions. [2023-08-26 21:19:20,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 519 transitions. [2023-08-26 21:19:20,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:20,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 519 transitions. [2023-08-26 21:19:20,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:20,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:20,966 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:20,967 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 427 flow. Second operand 4 states and 519 transitions. [2023-08-26 21:19:20,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 123 transitions, 981 flow [2023-08-26 21:19:21,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 123 transitions, 972 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:19:21,045 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 714 flow [2023-08-26 21:19:21,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=714, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2023-08-26 21:19:21,047 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-26 21:19:21,048 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 714 flow [2023-08-26 21:19:21,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:21,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:21,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:21,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:19:21,048 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:21,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1980689074, now seen corresponding path program 2 times [2023-08-26 21:19:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:21,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593319149] [2023-08-26 21:19:21,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:21,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593319149] [2023-08-26 21:19:21,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593319149] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:21,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:21,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:19:21,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706864404] [2023-08-26 21:19:21,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:21,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:21,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:21,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:21,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:21,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-26 21:19:21,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 91 transitions, 714 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:21,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:21,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-26 21:19:21,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:23,404 INFO L124 PetriNetUnfolderBase]: 13248/18455 cut-off events. [2023-08-26 21:19:23,404 INFO L125 PetriNetUnfolderBase]: For 43294/43985 co-relation queries the response was YES. [2023-08-26 21:19:23,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77226 conditions, 18455 events. 13248/18455 cut-off events. For 43294/43985 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 101221 event pairs, 4012 based on Foata normal form. 527/18014 useless extension candidates. Maximal degree in co-relation 77201. Up to 15409 conditions per place. [2023-08-26 21:19:23,517 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 86 selfloop transitions, 25 changer transitions 0/120 dead transitions. [2023-08-26 21:19:23,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 120 transitions, 1127 flow [2023-08-26 21:19:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:19:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:19:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-26 21:19:23,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974937343358396 [2023-08-26 21:19:23,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-26 21:19:23,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-26 21:19:23,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:23,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-26 21:19:23,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:23,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:23,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:23,522 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 714 flow. Second operand 3 states and 397 transitions. [2023-08-26 21:19:23,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 120 transitions, 1127 flow [2023-08-26 21:19:23,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 120 transitions, 1125 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 21:19:23,584 INFO L231 Difference]: Finished difference. Result has 67 places, 100 transitions, 887 flow [2023-08-26 21:19:23,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=887, PETRI_PLACES=67, PETRI_TRANSITIONS=100} [2023-08-26 21:19:23,585 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-26 21:19:23,585 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 100 transitions, 887 flow [2023-08-26 21:19:23,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:23,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:23,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:23,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:19:23,586 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:23,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:23,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1782183701, now seen corresponding path program 1 times [2023-08-26 21:19:23,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:23,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845328137] [2023-08-26 21:19:23,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:23,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:23,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:23,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845328137] [2023-08-26 21:19:23,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845328137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:23,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:23,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:19:23,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534811858] [2023-08-26 21:19:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:23,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:23,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:23,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:23,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-26 21:19:23,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 100 transitions, 887 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:23,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:23,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-26 21:19:23,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:25,785 INFO L124 PetriNetUnfolderBase]: 13575/18991 cut-off events. [2023-08-26 21:19:25,786 INFO L125 PetriNetUnfolderBase]: For 55505/56184 co-relation queries the response was YES. [2023-08-26 21:19:25,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84980 conditions, 18991 events. 13575/18991 cut-off events. For 55505/56184 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 105866 event pairs, 2394 based on Foata normal form. 572/18798 useless extension candidates. Maximal degree in co-relation 84952. Up to 13917 conditions per place. [2023-08-26 21:19:25,940 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 135 selfloop transitions, 29 changer transitions 0/173 dead transitions. [2023-08-26 21:19:25,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 173 transitions, 1716 flow [2023-08-26 21:19:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:19:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:19:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-08-26 21:19:25,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028195488721805 [2023-08-26 21:19:25,942 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-08-26 21:19:25,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-08-26 21:19:25,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:25,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-08-26 21:19:25,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:25,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:25,945 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:25,945 INFO L175 Difference]: Start difference. First operand has 67 places, 100 transitions, 887 flow. Second operand 4 states and 535 transitions. [2023-08-26 21:19:25,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 173 transitions, 1716 flow [2023-08-26 21:19:26,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 173 transitions, 1661 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-26 21:19:26,071 INFO L231 Difference]: Finished difference. Result has 70 places, 117 transitions, 1111 flow [2023-08-26 21:19:26,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1111, PETRI_PLACES=70, PETRI_TRANSITIONS=117} [2023-08-26 21:19:26,072 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2023-08-26 21:19:26,072 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 117 transitions, 1111 flow [2023-08-26 21:19:26,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:26,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:26,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:26,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:19:26,073 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:26,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:26,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1780814741, now seen corresponding path program 2 times [2023-08-26 21:19:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:26,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837567550] [2023-08-26 21:19:26,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:26,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:26,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:26,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837567550] [2023-08-26 21:19:26,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837567550] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:26,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:26,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:19:26,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728214551] [2023-08-26 21:19:26,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:26,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:26,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:26,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:26,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:19:26,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 117 transitions, 1111 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:26,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:26,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:19:26,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:28,328 INFO L124 PetriNetUnfolderBase]: 13688/19130 cut-off events. [2023-08-26 21:19:28,329 INFO L125 PetriNetUnfolderBase]: For 69683/70543 co-relation queries the response was YES. [2023-08-26 21:19:28,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90466 conditions, 19130 events. 13688/19130 cut-off events. For 69683/70543 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 106933 event pairs, 1876 based on Foata normal form. 743/19013 useless extension candidates. Maximal degree in co-relation 90436. Up to 13962 conditions per place. [2023-08-26 21:19:28,493 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 154 selfloop transitions, 45 changer transitions 0/208 dead transitions. [2023-08-26 21:19:28,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 208 transitions, 2131 flow [2023-08-26 21:19:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:19:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:19:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-08-26 21:19:28,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007518796992482 [2023-08-26 21:19:28,495 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-08-26 21:19:28,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-08-26 21:19:28,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:28,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-08-26 21:19:28,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:28,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:28,499 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:28,500 INFO L175 Difference]: Start difference. First operand has 70 places, 117 transitions, 1111 flow. Second operand 5 states and 666 transitions. [2023-08-26 21:19:28,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 208 transitions, 2131 flow [2023-08-26 21:19:28,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 208 transitions, 2087 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-08-26 21:19:28,606 INFO L231 Difference]: Finished difference. Result has 74 places, 128 transitions, 1320 flow [2023-08-26 21:19:28,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1320, PETRI_PLACES=74, PETRI_TRANSITIONS=128} [2023-08-26 21:19:28,607 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-08-26 21:19:28,607 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 128 transitions, 1320 flow [2023-08-26 21:19:28,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:28,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:28,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:28,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:19:28,607 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:28,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash -586883990, now seen corresponding path program 1 times [2023-08-26 21:19:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:28,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380763439] [2023-08-26 21:19:28,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:28,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:28,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:28,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380763439] [2023-08-26 21:19:28,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380763439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:28,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:28,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:19:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007754879] [2023-08-26 21:19:28,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:28,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:28,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:28,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:28,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:28,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:19:28,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 128 transitions, 1320 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:28,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:28,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:19:28,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:30,984 INFO L124 PetriNetUnfolderBase]: 14429/20078 cut-off events. [2023-08-26 21:19:30,984 INFO L125 PetriNetUnfolderBase]: For 93628/94730 co-relation queries the response was YES. [2023-08-26 21:19:31,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99314 conditions, 20078 events. 14429/20078 cut-off events. For 93628/94730 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 110849 event pairs, 2969 based on Foata normal form. 1012/20238 useless extension candidates. Maximal degree in co-relation 99282. Up to 14495 conditions per place. [2023-08-26 21:19:31,127 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 154 selfloop transitions, 43 changer transitions 0/206 dead transitions. [2023-08-26 21:19:31,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 206 transitions, 2309 flow [2023-08-26 21:19:31,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:19:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:19:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2023-08-26 21:19:31,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49906015037593987 [2023-08-26 21:19:31,129 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2023-08-26 21:19:31,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2023-08-26 21:19:31,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:31,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2023-08-26 21:19:31,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:31,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:31,133 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:31,133 INFO L175 Difference]: Start difference. First operand has 74 places, 128 transitions, 1320 flow. Second operand 4 states and 531 transitions. [2023-08-26 21:19:31,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 206 transitions, 2309 flow [2023-08-26 21:19:31,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 206 transitions, 2221 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 21:19:31,251 INFO L231 Difference]: Finished difference. Result has 74 places, 142 transitions, 1543 flow [2023-08-26 21:19:31,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1543, PETRI_PLACES=74, PETRI_TRANSITIONS=142} [2023-08-26 21:19:31,252 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-08-26 21:19:31,252 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 142 transitions, 1543 flow [2023-08-26 21:19:31,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:31,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:31,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:31,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:19:31,252 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:31,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash -633428630, now seen corresponding path program 2 times [2023-08-26 21:19:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373886330] [2023-08-26 21:19:31,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:31,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:31,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:31,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373886330] [2023-08-26 21:19:31,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373886330] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:31,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:31,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:19:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696315469] [2023-08-26 21:19:31,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:31,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:19:31,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:31,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:19:31,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:19:31,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:19:31,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 142 transitions, 1543 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 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-26 21:19:31,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:31,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:19:31,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:33,940 INFO L124 PetriNetUnfolderBase]: 14602/20352 cut-off events. [2023-08-26 21:19:33,941 INFO L125 PetriNetUnfolderBase]: For 113869/115092 co-relation queries the response was YES. [2023-08-26 21:19:34,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105555 conditions, 20352 events. 14602/20352 cut-off events. For 113869/115092 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 113049 event pairs, 2955 based on Foata normal form. 1171/20670 useless extension candidates. Maximal degree in co-relation 105523. Up to 14598 conditions per place. [2023-08-26 21:19:34,080 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 162 selfloop transitions, 53 changer transitions 0/224 dead transitions. [2023-08-26 21:19:34,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 224 transitions, 2664 flow [2023-08-26 21:19:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:19:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:19:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-26 21:19:34,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981203007518797 [2023-08-26 21:19:34,081 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-26 21:19:34,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-26 21:19:34,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:34,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-26 21:19:34,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 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-26 21:19:34,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:34,085 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:34,085 INFO L175 Difference]: Start difference. First operand has 74 places, 142 transitions, 1543 flow. Second operand 4 states and 530 transitions. [2023-08-26 21:19:34,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 224 transitions, 2664 flow [2023-08-26 21:19:34,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 224 transitions, 2601 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-26 21:19:34,198 INFO L231 Difference]: Finished difference. Result has 78 places, 158 transitions, 1913 flow [2023-08-26 21:19:34,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1913, PETRI_PLACES=78, PETRI_TRANSITIONS=158} [2023-08-26 21:19:34,199 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2023-08-26 21:19:34,199 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 158 transitions, 1913 flow [2023-08-26 21:19:34,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 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-26 21:19:34,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:34,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:34,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:19:34,200 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:34,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:34,201 INFO L85 PathProgramCache]: Analyzing trace with hash -586881324, now seen corresponding path program 1 times [2023-08-26 21:19:34,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:34,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064976710] [2023-08-26 21:19:34,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:34,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:34,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:34,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064976710] [2023-08-26 21:19:34,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064976710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:34,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:34,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:19:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10337498] [2023-08-26 21:19:34,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:34,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:34,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:34,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-26 21:19:34,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 158 transitions, 1913 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:34,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:34,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-26 21:19:34,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:37,517 INFO L124 PetriNetUnfolderBase]: 15541/21583 cut-off events. [2023-08-26 21:19:37,517 INFO L125 PetriNetUnfolderBase]: For 142991/144810 co-relation queries the response was YES. [2023-08-26 21:19:37,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116384 conditions, 21583 events. 15541/21583 cut-off events. For 142991/144810 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 120203 event pairs, 3244 based on Foata normal form. 1447/22227 useless extension candidates. Maximal degree in co-relation 116349. Up to 15270 conditions per place. [2023-08-26 21:19:37,657 INFO L140 encePairwiseOnDemand]: 256/266 looper letters, 178 selfloop transitions, 58 changer transitions 0/245 dead transitions. [2023-08-26 21:19:37,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 245 transitions, 3081 flow [2023-08-26 21:19:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:19:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:19:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-26 21:19:37,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-26 21:19:37,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-26 21:19:37,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-26 21:19:37,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:37,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-26 21:19:37,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:37,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:37,662 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:37,662 INFO L175 Difference]: Start difference. First operand has 78 places, 158 transitions, 1913 flow. Second operand 5 states and 646 transitions. [2023-08-26 21:19:37,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 245 transitions, 3081 flow [2023-08-26 21:19:37,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 245 transitions, 3024 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-26 21:19:37,785 INFO L231 Difference]: Finished difference. Result has 82 places, 175 transitions, 2262 flow [2023-08-26 21:19:37,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2262, PETRI_PLACES=82, PETRI_TRANSITIONS=175} [2023-08-26 21:19:37,785 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2023-08-26 21:19:37,785 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 175 transitions, 2262 flow [2023-08-26 21:19:37,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:37,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:37,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:37,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:19:37,786 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:37,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:37,786 INFO L85 PathProgramCache]: Analyzing trace with hash -591026334, now seen corresponding path program 2 times [2023-08-26 21:19:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:37,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582434613] [2023-08-26 21:19:37,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:37,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582434613] [2023-08-26 21:19:38,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582434613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:38,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:38,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:19:38,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556102113] [2023-08-26 21:19:38,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:38,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:19:38,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:38,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:19:38,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:19:38,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:19:38,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 175 transitions, 2262 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 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-26 21:19:38,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:38,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:19:38,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:41,078 INFO L124 PetriNetUnfolderBase]: 16088/22319 cut-off events. [2023-08-26 21:19:41,078 INFO L125 PetriNetUnfolderBase]: For 186614/188421 co-relation queries the response was YES. [2023-08-26 21:19:41,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128896 conditions, 22319 events. 16088/22319 cut-off events. For 186614/188421 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 124747 event pairs, 3253 based on Foata normal form. 1423/22868 useless extension candidates. Maximal degree in co-relation 128859. Up to 15442 conditions per place. [2023-08-26 21:19:41,239 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 185 selfloop transitions, 68 changer transitions 0/262 dead transitions. [2023-08-26 21:19:41,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 262 transitions, 3517 flow [2023-08-26 21:19:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:19:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:19:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-08-26 21:19:41,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4932330827067669 [2023-08-26 21:19:41,241 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-08-26 21:19:41,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-08-26 21:19:41,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:41,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-08-26 21:19:41,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:41,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:41,245 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:41,245 INFO L175 Difference]: Start difference. First operand has 82 places, 175 transitions, 2262 flow. Second operand 5 states and 656 transitions. [2023-08-26 21:19:41,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 262 transitions, 3517 flow [2023-08-26 21:19:41,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 262 transitions, 3311 flow, removed 55 selfloop flow, removed 3 redundant places. [2023-08-26 21:19:41,415 INFO L231 Difference]: Finished difference. Result has 85 places, 189 transitions, 2490 flow [2023-08-26 21:19:41,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=2056, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2490, PETRI_PLACES=85, PETRI_TRANSITIONS=189} [2023-08-26 21:19:41,415 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2023-08-26 21:19:41,416 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 189 transitions, 2490 flow [2023-08-26 21:19:41,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 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-26 21:19:41,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:41,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:41,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:19:41,416 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:41,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:41,416 INFO L85 PathProgramCache]: Analyzing trace with hash -629319084, now seen corresponding path program 3 times [2023-08-26 21:19:41,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:41,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544068761] [2023-08-26 21:19:41,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:41,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:41,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544068761] [2023-08-26 21:19:41,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544068761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:41,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:41,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:19:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619115596] [2023-08-26 21:19:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:41,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:19:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:41,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:19:41,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:19:41,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-26 21:19:41,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 189 transitions, 2490 flow. Second operand has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 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-26 21:19:41,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:41,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-26 21:19:41,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:45,536 INFO L124 PetriNetUnfolderBase]: 18971/26498 cut-off events. [2023-08-26 21:19:45,537 INFO L125 PetriNetUnfolderBase]: For 255698/257558 co-relation queries the response was YES. [2023-08-26 21:19:45,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157583 conditions, 26498 events. 18971/26498 cut-off events. For 255698/257558 co-relation queries the response was YES. Maximal size of possible extension queue 1039. Compared 154889 event pairs, 3198 based on Foata normal form. 1623/27109 useless extension candidates. Maximal degree in co-relation 157544. Up to 14805 conditions per place. [2023-08-26 21:19:45,746 INFO L140 encePairwiseOnDemand]: 256/266 looper letters, 187 selfloop transitions, 90 changer transitions 0/286 dead transitions. [2023-08-26 21:19:45,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 286 transitions, 3897 flow [2023-08-26 21:19:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:19:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:19:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-26 21:19:45,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015037593984962 [2023-08-26 21:19:45,748 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-26 21:19:45,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-26 21:19:45,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:45,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-26 21:19:45,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:45,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:45,752 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:45,752 INFO L175 Difference]: Start difference. First operand has 85 places, 189 transitions, 2490 flow. Second operand 5 states and 667 transitions. [2023-08-26 21:19:45,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 286 transitions, 3897 flow [2023-08-26 21:19:46,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 286 transitions, 3774 flow, removed 21 selfloop flow, removed 2 redundant places. [2023-08-26 21:19:46,159 INFO L231 Difference]: Finished difference. Result has 88 places, 200 transitions, 2842 flow [2023-08-26 21:19:46,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=2367, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2842, PETRI_PLACES=88, PETRI_TRANSITIONS=200} [2023-08-26 21:19:46,160 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2023-08-26 21:19:46,160 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 200 transitions, 2842 flow [2023-08-26 21:19:46,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 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-26 21:19:46,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:46,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:46,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:19:46,160 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:46,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:46,161 INFO L85 PathProgramCache]: Analyzing trace with hash -722647813, now seen corresponding path program 1 times [2023-08-26 21:19:46,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:46,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573041573] [2023-08-26 21:19:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:46,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:46,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:46,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573041573] [2023-08-26 21:19:46,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573041573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:46,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:46,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:19:46,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951311494] [2023-08-26 21:19:46,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:46,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:19:46,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:46,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:19:46,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:19:46,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-26 21:19:46,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 200 transitions, 2842 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:46,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:46,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-26 21:19:46,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:48,711 INFO L124 PetriNetUnfolderBase]: 13019/18619 cut-off events. [2023-08-26 21:19:48,711 INFO L125 PetriNetUnfolderBase]: For 276954/280176 co-relation queries the response was YES. [2023-08-26 21:19:48,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118615 conditions, 18619 events. 13019/18619 cut-off events. For 276954/280176 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 112533 event pairs, 1901 based on Foata normal form. 3033/20460 useless extension candidates. Maximal degree in co-relation 118575. Up to 11549 conditions per place. [2023-08-26 21:19:48,838 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 369 selfloop transitions, 10 changer transitions 0/392 dead transitions. [2023-08-26 21:19:48,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 392 transitions, 6562 flow [2023-08-26 21:19:48,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:19:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:19:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-26 21:19:48,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48195488721804514 [2023-08-26 21:19:48,840 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-26 21:19:48,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-26 21:19:48,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:48,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-26 21:19:48,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:48,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:48,843 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:48,843 INFO L175 Difference]: Start difference. First operand has 88 places, 200 transitions, 2842 flow. Second operand 5 states and 641 transitions. [2023-08-26 21:19:48,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 392 transitions, 6562 flow [2023-08-26 21:19:49,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 392 transitions, 6079 flow, removed 96 selfloop flow, removed 5 redundant places. [2023-08-26 21:19:49,105 INFO L231 Difference]: Finished difference. Result has 90 places, 183 transitions, 2466 flow [2023-08-26 21:19:49,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=2359, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2466, PETRI_PLACES=90, PETRI_TRANSITIONS=183} [2023-08-26 21:19:49,106 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 39 predicate places. [2023-08-26 21:19:49,106 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 183 transitions, 2466 flow [2023-08-26 21:19:49,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:49,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:49,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:49,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:19:49,106 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:49,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2114241045, now seen corresponding path program 1 times [2023-08-26 21:19:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:49,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086674308] [2023-08-26 21:19:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:49,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086674308] [2023-08-26 21:19:49,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086674308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:49,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:49,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:19:49,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394921835] [2023-08-26 21:19:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:49,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:49,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:49,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:49,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-26 21:19:49,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 183 transitions, 2466 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:49,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:49,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-26 21:19:49,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:51,236 INFO L124 PetriNetUnfolderBase]: 8873/12976 cut-off events. [2023-08-26 21:19:51,236 INFO L125 PetriNetUnfolderBase]: For 193050/196122 co-relation queries the response was YES. [2023-08-26 21:19:51,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78749 conditions, 12976 events. 8873/12976 cut-off events. For 193050/196122 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 78093 event pairs, 1050 based on Foata normal form. 2294/14166 useless extension candidates. Maximal degree in co-relation 78708. Up to 6964 conditions per place. [2023-08-26 21:19:51,499 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 403 selfloop transitions, 19 changer transitions 0/435 dead transitions. [2023-08-26 21:19:51,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 435 transitions, 6719 flow [2023-08-26 21:19:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:19:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:19:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 896 transitions. [2023-08-26 21:19:51,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48120300751879697 [2023-08-26 21:19:51,502 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 896 transitions. [2023-08-26 21:19:51,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 896 transitions. [2023-08-26 21:19:51,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:51,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 896 transitions. [2023-08-26 21:19:51,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:51,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:51,507 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:51,507 INFO L175 Difference]: Start difference. First operand has 90 places, 183 transitions, 2466 flow. Second operand 7 states and 896 transitions. [2023-08-26 21:19:51,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 435 transitions, 6719 flow [2023-08-26 21:19:51,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 435 transitions, 6705 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:19:51,752 INFO L231 Difference]: Finished difference. Result has 97 places, 154 transitions, 2023 flow [2023-08-26 21:19:51,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2023, PETRI_PLACES=97, PETRI_TRANSITIONS=154} [2023-08-26 21:19:51,752 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 46 predicate places. [2023-08-26 21:19:51,752 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 154 transitions, 2023 flow [2023-08-26 21:19:51,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:51,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:51,753 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-26 21:19:51,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:19:51,753 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:51,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -711805558, now seen corresponding path program 1 times [2023-08-26 21:19:51,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:51,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868180993] [2023-08-26 21:19:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:51,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:51,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:51,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868180993] [2023-08-26 21:19:51,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868180993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:51,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:51,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:19:51,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124151074] [2023-08-26 21:19:51,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:51,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:19:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:51,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:19:51,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:19:51,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-26 21:19:51,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 154 transitions, 2023 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:51,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:51,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-26 21:19:51,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:53,264 INFO L124 PetriNetUnfolderBase]: 8003/11701 cut-off events. [2023-08-26 21:19:53,264 INFO L125 PetriNetUnfolderBase]: For 151282/153259 co-relation queries the response was YES. [2023-08-26 21:19:53,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73805 conditions, 11701 events. 8003/11701 cut-off events. For 151282/153259 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 69374 event pairs, 1244 based on Foata normal form. 986/12179 useless extension candidates. Maximal degree in co-relation 73761. Up to 6539 conditions per place. [2023-08-26 21:19:53,340 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 262 selfloop transitions, 21 changer transitions 0/296 dead transitions. [2023-08-26 21:19:53,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 296 transitions, 4495 flow [2023-08-26 21:19:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:19:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:19:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-26 21:19:53,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2023-08-26 21:19:53,346 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-26 21:19:53,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-26 21:19:53,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:53,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-26 21:19:53,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:53,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:53,350 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:53,350 INFO L175 Difference]: Start difference. First operand has 97 places, 154 transitions, 2023 flow. Second operand 5 states and 660 transitions. [2023-08-26 21:19:53,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 296 transitions, 4495 flow [2023-08-26 21:19:53,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 296 transitions, 4461 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-26 21:19:53,704 INFO L231 Difference]: Finished difference. Result has 98 places, 158 transitions, 2083 flow [2023-08-26 21:19:53,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1989, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2083, PETRI_PLACES=98, PETRI_TRANSITIONS=158} [2023-08-26 21:19:53,705 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 47 predicate places. [2023-08-26 21:19:53,705 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 158 transitions, 2083 flow [2023-08-26 21:19:53,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:53,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:53,705 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] [2023-08-26 21:19:53,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:19:53,705 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:53,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1678710106, now seen corresponding path program 1 times [2023-08-26 21:19:53,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:53,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556323043] [2023-08-26 21:19:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:53,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:53,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556323043] [2023-08-26 21:19:53,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556323043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:53,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:53,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:19:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290586955] [2023-08-26 21:19:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:53,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:19:53,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:53,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:19:53,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:19:53,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-26 21:19:53,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 158 transitions, 2083 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:53,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:53,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-26 21:19:53,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:55,288 INFO L124 PetriNetUnfolderBase]: 7362/10497 cut-off events. [2023-08-26 21:19:55,289 INFO L125 PetriNetUnfolderBase]: For 157313/160005 co-relation queries the response was YES. [2023-08-26 21:19:55,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66867 conditions, 10497 events. 7362/10497 cut-off events. For 157313/160005 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 60356 event pairs, 572 based on Foata normal form. 1474/11429 useless extension candidates. Maximal degree in co-relation 66822. Up to 5869 conditions per place. [2023-08-26 21:19:55,427 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 404 selfloop transitions, 28 changer transitions 4/449 dead transitions. [2023-08-26 21:19:55,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 449 transitions, 6851 flow [2023-08-26 21:19:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:19:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:19:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1149 transitions. [2023-08-26 21:19:55,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4799498746867168 [2023-08-26 21:19:55,430 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1149 transitions. [2023-08-26 21:19:55,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1149 transitions. [2023-08-26 21:19:55,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:55,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1149 transitions. [2023-08-26 21:19:55,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.66666666666667) internal successors, (1149), 9 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:55,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:55,435 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:55,435 INFO L175 Difference]: Start difference. First operand has 98 places, 158 transitions, 2083 flow. Second operand 9 states and 1149 transitions. [2023-08-26 21:19:55,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 449 transitions, 6851 flow [2023-08-26 21:19:56,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 449 transitions, 6182 flow, removed 110 selfloop flow, removed 10 redundant places. [2023-08-26 21:19:56,116 INFO L231 Difference]: Finished difference. Result has 99 places, 143 transitions, 1672 flow [2023-08-26 21:19:56,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1672, PETRI_PLACES=99, PETRI_TRANSITIONS=143} [2023-08-26 21:19:56,116 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 48 predicate places. [2023-08-26 21:19:56,116 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 143 transitions, 1672 flow [2023-08-26 21:19:56,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:56,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:19:56,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:19:56,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 21:19:56,117 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:19:56,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:19:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1895903439, now seen corresponding path program 1 times [2023-08-26 21:19:56,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:19:56,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017530746] [2023-08-26 21:19:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:19:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:19:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:19:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:19:56,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:19:56,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017530746] [2023-08-26 21:19:56,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017530746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:19:56,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:19:56,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:19:56,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166111008] [2023-08-26 21:19:56,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:19:56,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:19:56,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:19:56,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:19:56,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:19:56,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 266 [2023-08-26 21:19:56,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 143 transitions, 1672 flow. Second operand has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:56,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:19:56,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 266 [2023-08-26 21:19:56,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:19:59,184 INFO L124 PetriNetUnfolderBase]: 13527/19379 cut-off events. [2023-08-26 21:19:59,184 INFO L125 PetriNetUnfolderBase]: For 140227/140227 co-relation queries the response was YES. [2023-08-26 21:19:59,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113730 conditions, 19379 events. 13527/19379 cut-off events. For 140227/140227 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 112267 event pairs, 1443 based on Foata normal form. 17/19327 useless extension candidates. Maximal degree in co-relation 113686. Up to 9213 conditions per place. [2023-08-26 21:19:59,319 INFO L140 encePairwiseOnDemand]: 250/266 looper letters, 425 selfloop transitions, 157 changer transitions 7/589 dead transitions. [2023-08-26 21:19:59,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 589 transitions, 7392 flow [2023-08-26 21:19:59,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 21:19:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 21:19:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1619 transitions. [2023-08-26 21:19:59,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43474758324382384 [2023-08-26 21:19:59,322 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1619 transitions. [2023-08-26 21:19:59,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1619 transitions. [2023-08-26 21:19:59,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:19:59,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1619 transitions. [2023-08-26 21:19:59,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.64285714285714) internal successors, (1619), 14 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:59,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 266.0) internal successors, (3990), 15 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:59,329 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 266.0) internal successors, (3990), 15 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:19:59,329 INFO L175 Difference]: Start difference. First operand has 99 places, 143 transitions, 1672 flow. Second operand 14 states and 1619 transitions. [2023-08-26 21:19:59,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 589 transitions, 7392 flow [2023-08-26 21:20:00,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 589 transitions, 6936 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-26 21:20:00,446 INFO L231 Difference]: Finished difference. Result has 112 places, 260 transitions, 3672 flow [2023-08-26 21:20:00,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1618, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3672, PETRI_PLACES=112, PETRI_TRANSITIONS=260} [2023-08-26 21:20:00,446 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 61 predicate places. [2023-08-26 21:20:00,446 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 260 transitions, 3672 flow [2023-08-26 21:20:00,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:00,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:20:00,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:20:00,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 21:20:00,447 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:20:00,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:20:00,447 INFO L85 PathProgramCache]: Analyzing trace with hash 694532011, now seen corresponding path program 2 times [2023-08-26 21:20:00,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:20:00,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190929495] [2023-08-26 21:20:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:20:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:20:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:20:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:20:00,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:20:00,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190929495] [2023-08-26 21:20:00,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190929495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:20:00,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:20:00,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:20:00,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897625916] [2023-08-26 21:20:00,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:20:00,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:20:00,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:20:00,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:20:00,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:20:00,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-26 21:20:00,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 260 transitions, 3672 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:00,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:20:00,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-26 21:20:00,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:20:03,197 INFO L124 PetriNetUnfolderBase]: 10638/15045 cut-off events. [2023-08-26 21:20:03,197 INFO L125 PetriNetUnfolderBase]: For 224823/228905 co-relation queries the response was YES. [2023-08-26 21:20:03,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98787 conditions, 15045 events. 10638/15045 cut-off events. For 224823/228905 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 91178 event pairs, 474 based on Foata normal form. 1401/15637 useless extension candidates. Maximal degree in co-relation 98737. Up to 8557 conditions per place. [2023-08-26 21:20:03,264 INFO L140 encePairwiseOnDemand]: 255/266 looper letters, 409 selfloop transitions, 33 changer transitions 321/786 dead transitions. [2023-08-26 21:20:03,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 786 transitions, 13186 flow [2023-08-26 21:20:03,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:20:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:20:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1374 transitions. [2023-08-26 21:20:03,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46958304853041694 [2023-08-26 21:20:03,268 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1374 transitions. [2023-08-26 21:20:03,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1374 transitions. [2023-08-26 21:20:03,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:20:03,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1374 transitions. [2023-08-26 21:20:03,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:03,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:03,273 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:03,273 INFO L175 Difference]: Start difference. First operand has 112 places, 260 transitions, 3672 flow. Second operand 11 states and 1374 transitions. [2023-08-26 21:20:03,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 786 transitions, 13186 flow [2023-08-26 21:20:04,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 786 transitions, 11641 flow, removed 291 selfloop flow, removed 5 redundant places. [2023-08-26 21:20:04,736 INFO L231 Difference]: Finished difference. Result has 116 places, 161 transitions, 1941 flow [2023-08-26 21:20:04,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=3008, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1941, PETRI_PLACES=116, PETRI_TRANSITIONS=161} [2023-08-26 21:20:04,736 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 65 predicate places. [2023-08-26 21:20:04,736 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 161 transitions, 1941 flow [2023-08-26 21:20:04,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:04,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:20:04,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:20:04,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 21:20:04,737 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:20:04,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:20:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1741403374, now seen corresponding path program 1 times [2023-08-26 21:20:04,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:20:04,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613817563] [2023-08-26 21:20:04,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:20:04,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:20:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:20:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:20:05,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:20:05,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613817563] [2023-08-26 21:20:05,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613817563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:20:05,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:20:05,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:20:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331163110] [2023-08-26 21:20:05,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:20:05,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:20:05,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:20:05,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:20:05,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:20:05,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 266 [2023-08-26 21:20:05,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 161 transitions, 1941 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:05,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:20:05,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 266 [2023-08-26 21:20:05,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:20:06,900 INFO L124 PetriNetUnfolderBase]: 11620/17069 cut-off events. [2023-08-26 21:20:06,900 INFO L125 PetriNetUnfolderBase]: For 123717/123717 co-relation queries the response was YES. [2023-08-26 21:20:06,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101177 conditions, 17069 events. 11620/17069 cut-off events. For 123717/123717 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 103446 event pairs, 2741 based on Foata normal form. 1/17070 useless extension candidates. Maximal degree in co-relation 101138. Up to 8821 conditions per place. [2023-08-26 21:20:07,016 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 90 selfloop transitions, 7 changer transitions 152/249 dead transitions. [2023-08-26 21:20:07,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 249 transitions, 3278 flow [2023-08-26 21:20:07,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:20:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:20:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-08-26 21:20:07,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44548872180451127 [2023-08-26 21:20:07,017 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-08-26 21:20:07,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-08-26 21:20:07,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:20:07,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-08-26 21:20:07,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:07,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:07,019 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:07,019 INFO L175 Difference]: Start difference. First operand has 116 places, 161 transitions, 1941 flow. Second operand 4 states and 474 transitions. [2023-08-26 21:20:07,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 249 transitions, 3278 flow [2023-08-26 21:20:08,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 249 transitions, 3015 flow, removed 35 selfloop flow, removed 13 redundant places. [2023-08-26 21:20:08,981 INFO L231 Difference]: Finished difference. Result has 103 places, 79 transitions, 719 flow [2023-08-26 21:20:08,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=719, PETRI_PLACES=103, PETRI_TRANSITIONS=79} [2023-08-26 21:20:08,982 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 52 predicate places. [2023-08-26 21:20:08,982 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 79 transitions, 719 flow [2023-08-26 21:20:08,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:08,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:20:08,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:20:08,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 21:20:08,982 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:20:08,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:20:08,983 INFO L85 PathProgramCache]: Analyzing trace with hash -991043814, now seen corresponding path program 2 times [2023-08-26 21:20:08,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:20:08,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138101804] [2023-08-26 21:20:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:20:08,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:20:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:20:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:20:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:20:09,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138101804] [2023-08-26 21:20:09,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138101804] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:20:09,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:20:09,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:20:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13736448] [2023-08-26 21:20:09,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:20:09,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:20:09,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:20:09,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:20:09,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:20:09,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-26 21:20:09,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 79 transitions, 719 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:09,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:20:09,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-26 21:20:09,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:20:09,643 INFO L124 PetriNetUnfolderBase]: 2568/3955 cut-off events. [2023-08-26 21:20:09,643 INFO L125 PetriNetUnfolderBase]: For 22496/22650 co-relation queries the response was YES. [2023-08-26 21:20:09,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20840 conditions, 3955 events. 2568/3955 cut-off events. For 22496/22650 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20736 event pairs, 542 based on Foata normal form. 37/3949 useless extension candidates. Maximal degree in co-relation 20808. Up to 1933 conditions per place. [2023-08-26 21:20:09,661 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 51 selfloop transitions, 1 changer transitions 78/134 dead transitions. [2023-08-26 21:20:09,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 134 transitions, 1444 flow [2023-08-26 21:20:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:20:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:20:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-08-26 21:20:09,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830827067669173 [2023-08-26 21:20:09,663 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-08-26 21:20:09,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-08-26 21:20:09,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:20:09,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-08-26 21:20:09,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:09,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:09,665 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:09,665 INFO L175 Difference]: Start difference. First operand has 103 places, 79 transitions, 719 flow. Second operand 4 states and 514 transitions. [2023-08-26 21:20:09,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 134 transitions, 1444 flow [2023-08-26 21:20:09,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 134 transitions, 1311 flow, removed 43 selfloop flow, removed 16 redundant places. [2023-08-26 21:20:09,726 INFO L231 Difference]: Finished difference. Result has 81 places, 52 transitions, 379 flow [2023-08-26 21:20:09,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=379, PETRI_PLACES=81, PETRI_TRANSITIONS=52} [2023-08-26 21:20:09,726 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2023-08-26 21:20:09,726 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 52 transitions, 379 flow [2023-08-26 21:20:09,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:20:09,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:20:09,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:20:09,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 21:20:09,727 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:20:09,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:20:09,727 INFO L85 PathProgramCache]: Analyzing trace with hash -750297276, now seen corresponding path program 3 times [2023-08-26 21:20:09,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:20:09,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653695589] [2023-08-26 21:20:09,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:20:09,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:20:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:20:09,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:20:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:20:09,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:20:09,825 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:20:09,826 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:20:09,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-26 21:20:09,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:20:09,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (19 of 23 remaining) [2023-08-26 21:20:09,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:20:09,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:20:09,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:20:09,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-26 21:20:09,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:20:09,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:20:09,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:20:09,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:20:09,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:20:09,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:20:09,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-26 21:20:09,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:20:09,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (6 of 23 remaining) [2023-08-26 21:20:09,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:20:09,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:20:09,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:20:09,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-26 21:20:09,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:20:09,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:20:09,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 21:20:09,831 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:20:09,836 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:20:09,836 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:20:09,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:20:09 BasicIcfg [2023-08-26 21:20:09,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:20:09,900 INFO L158 Benchmark]: Toolchain (without parser) took 75429.90ms. Allocated memory was 360.7MB in the beginning and 8.5GB in the end (delta: 8.1GB). Free memory was 335.5MB in the beginning and 6.3GB in the end (delta: -6.0GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2023-08-26 21:20:09,900 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory was 337.6MB in the beginning and 337.4MB in the end (delta: 131.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:20:09,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.77ms. Allocated memory is still 360.7MB. Free memory was 335.5MB in the beginning and 311.0MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:20:09,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.37ms. Allocated memory is still 360.7MB. Free memory was 311.0MB in the beginning and 308.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:20:09,900 INFO L158 Benchmark]: Boogie Preprocessor took 49.39ms. Allocated memory is still 360.7MB. Free memory was 308.3MB in the beginning and 306.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:20:09,901 INFO L158 Benchmark]: RCFGBuilder took 694.64ms. Allocated memory is still 360.7MB. Free memory was 306.2MB in the beginning and 262.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-08-26 21:20:09,901 INFO L158 Benchmark]: TraceAbstraction took 74015.99ms. Allocated memory was 360.7MB in the beginning and 8.5GB in the end (delta: 8.1GB). Free memory was 261.5MB in the beginning and 6.3GB in the end (delta: -6.0GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2023-08-26 21:20:09,902 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory was 337.6MB in the beginning and 337.4MB in the end (delta: 131.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 584.77ms. Allocated memory is still 360.7MB. Free memory was 335.5MB in the beginning and 311.0MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 77.37ms. Allocated memory is still 360.7MB. Free memory was 311.0MB in the beginning and 308.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.39ms. Allocated memory is still 360.7MB. Free memory was 308.3MB in the beginning and 306.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 694.64ms. Allocated memory is still 360.7MB. Free memory was 306.2MB in the beginning and 262.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 74015.99ms. Allocated memory was 360.7MB in the beginning and 8.5GB in the end (delta: 8.1GB). Free memory was 261.5MB in the beginning and 6.3GB in the end (delta: -6.0GB). Peak memory consumption was 2.1GB. 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: 5.0s, 150 PlacesBefore, 51 PlacesAfterwards, 140 TransitionsBefore, 38 TransitionsAfterwards, 4652 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 3 ChoiceCompositions, 122 TotalNumberOfCompositions, 17199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6287, independent: 5912, independent conditional: 0, independent unconditional: 5912, dependent: 375, dependent conditional: 0, dependent unconditional: 375, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2552, independent: 2468, independent conditional: 0, independent unconditional: 2468, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6287, independent: 3444, independent conditional: 0, independent unconditional: 3444, dependent: 291, dependent conditional: 0, dependent unconditional: 291, unknown: 2552, unknown conditional: 0, unknown unconditional: 2552] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 226, Positive conditional cache size: 0, Positive unconditional cache size: 226, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-1, t1185={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=0, t1185={5:0}, t1186={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t1187; [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=1, t1185={5:0}, t1186={6:0}, t1187={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=2, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L815] EXPR 3 __unbuffered_cnt + 1 [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L795] EXPR 2 __unbuffered_cnt + 1 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L765] EXPR 1 __unbuffered_cnt + 1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L841] EXPR 4 __unbuffered_cnt + 1 [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L891] 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", "mix044_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 765]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 765]: 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: 795]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 863]: 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: 859]: 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: 857]: 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 9 procedures, 189 locations, 23 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: 73.8s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 61.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1066 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1066 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3240 IncrementalHoareTripleChecker+Invalid, 3406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 46 mSDtfsCounter, 3240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3672occurred in iteration=21, InterpolantAutomatonStates: 123, 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.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 2826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:20:09,924 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...