/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:19:44,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:19:44,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 10:19:44,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:19:44,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:19:44,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:19:44,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:19:44,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:19:44,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:19:44,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:19:44,726 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:19:44,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:19:44,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:19:44,726 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:19:44,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:19:44,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:19:44,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:19:44,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:19:44,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:19:44,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:19:44,728 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:19:44,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:19:44,733 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:19:44,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:19:44,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:19:44,734 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:19:44,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:19:44,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:19:44,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:19:44,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:19:44,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:19:44,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:19:44,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:19:44,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:19:44,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:19:44,736 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:19:45,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:19:45,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:19:45,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:19:45,040 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:19:45,040 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:19:45,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-08-27 10:19:45,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:19:46,181 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:19:46,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-08-27 10:19:46,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f1adcc8/7dcd4733b81b488dbc622fb41fa2f089/FLAGd62668d5a [2023-08-27 10:19:46,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f1adcc8/7dcd4733b81b488dbc622fb41fa2f089 [2023-08-27 10:19:46,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:19:46,202 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:19:46,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:19:46,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:19:46,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:19:46,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28afc3c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46, skipping insertion in model container [2023-08-27 10:19:46,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,256 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:19:46,555 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:19:46,566 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:19:46,599 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:19:46,600 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:19:46,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:19:46,657 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:19:46,658 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:19:46,662 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:19:46,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46 WrapperNode [2023-08-27 10:19:46,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:19:46,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:19:46,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:19:46,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:19:46,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,720 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-08-27 10:19:46,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:19:46,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:19:46,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:19:46,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:19:46,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:19:46,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:19:46,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:19:46,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:19:46,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (1/1) ... [2023-08-27 10:19:46,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:19:46,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:19:46,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 10:19:46,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 10:19:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:19:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:19:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:19:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:19:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:19:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:19:46,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:19:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:19:46,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:19:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:19:46,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:19:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:19:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:19:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:19:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:19:46,814 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:19:46,903 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:19:46,905 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:19:47,168 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:19:47,264 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:19:47,264 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:19:47,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:19:47 BoogieIcfgContainer [2023-08-27 10:19:47,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:19:47,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:19:47,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:19:47,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:19:47,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:19:46" (1/3) ... [2023-08-27 10:19:47,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2e3e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:19:47, skipping insertion in model container [2023-08-27 10:19:47,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:46" (2/3) ... [2023-08-27 10:19:47,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2e3e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:19:47, skipping insertion in model container [2023-08-27 10:19:47,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:19:47" (3/3) ... [2023-08-27 10:19:47,271 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2023-08-27 10:19:47,281 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:19:47,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 10:19:47,282 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:19:47,339 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:19:47,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 115 transitions, 245 flow [2023-08-27 10:19:47,416 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2023-08-27 10:19:47,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:19:47,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-27 10:19:47,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 115 transitions, 245 flow [2023-08-27 10:19:47,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 112 transitions, 233 flow [2023-08-27 10:19:47,426 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:19:47,432 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 112 transitions, 233 flow [2023-08-27 10:19:47,434 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 112 transitions, 233 flow [2023-08-27 10:19:47,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 112 transitions, 233 flow [2023-08-27 10:19:47,463 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2023-08-27 10:19:47,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:19:47,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-27 10:19:47,465 INFO L119 LiptonReduction]: Number of co-enabled transitions 2616 [2023-08-27 10:19:50,637 INFO L134 LiptonReduction]: Checked pairs total: 9246 [2023-08-27 10:19:50,637 INFO L136 LiptonReduction]: Total number of compositions: 102 [2023-08-27 10:19:50,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:19:50,650 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;@2e155540, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:19:50,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 10:19:50,653 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:19:50,653 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-27 10:19:50,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:19:50,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:50,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:19:50,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:50,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 497066860, now seen corresponding path program 1 times [2023-08-27 10:19:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:50,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652110441] [2023-08-27 10:19:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:50,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:50,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652110441] [2023-08-27 10:19:50,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652110441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:50,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:50,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:19:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206982916] [2023-08-27 10:19:50,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:50,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:19:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:50,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:19:50,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:19:50,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-27 10:19:50,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:50,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:50,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-27 10:19:50,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:51,126 INFO L124 PetriNetUnfolderBase]: 1108/1726 cut-off events. [2023-08-27 10:19:51,127 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-27 10:19:51,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3488 conditions, 1726 events. 1108/1726 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8634 event pairs, 318 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 3477. Up to 1358 conditions per place. [2023-08-27 10:19:51,140 INFO L140 encePairwiseOnDemand]: 207/217 looper letters, 38 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-27 10:19:51,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 189 flow [2023-08-27 10:19:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:19:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:19:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-27 10:19:51,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930875576036866 [2023-08-27 10:19:51,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-27 10:19:51,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-27 10:19:51,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:51,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-27 10:19:51,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,165 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 65 flow. Second operand 3 states and 321 transitions. [2023-08-27 10:19:51,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 189 flow [2023-08-27 10:19:51,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:19:51,169 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 98 flow [2023-08-27 10:19:51,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-27 10:19:51,174 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-08-27 10:19:51,174 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 98 flow [2023-08-27 10:19:51,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:51,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:51,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:19:51,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:51,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash 996193508, now seen corresponding path program 1 times [2023-08-27 10:19:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:51,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763166179] [2023-08-27 10:19:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763166179] [2023-08-27 10:19:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763166179] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:51,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:19:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602592523] [2023-08-27 10:19:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:51,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:19:51,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:19:51,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:19:51,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217 [2023-08-27 10:19:51,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:51,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217 [2023-08-27 10:19:51,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:51,528 INFO L124 PetriNetUnfolderBase]: 781/1355 cut-off events. [2023-08-27 10:19:51,528 INFO L125 PetriNetUnfolderBase]: For 134/159 co-relation queries the response was YES. [2023-08-27 10:19:51,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 1355 events. 781/1355 cut-off events. For 134/159 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7706 event pairs, 167 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 3218. Up to 923 conditions per place. [2023-08-27 10:19:51,533 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 35 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-27 10:19:51,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 210 flow [2023-08-27 10:19:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:19:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:19:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-08-27 10:19:51,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48847926267281105 [2023-08-27 10:19:51,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-08-27 10:19:51,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-08-27 10:19:51,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:51,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-08-27 10:19:51,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,538 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 98 flow. Second operand 3 states and 318 transitions. [2023-08-27 10:19:51,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 210 flow [2023-08-27 10:19:51,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:19:51,539 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 96 flow [2023-08-27 10:19:51,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-27 10:19:51,540 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-08-27 10:19:51,540 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 96 flow [2023-08-27 10:19:51,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:51,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:51,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:19:51,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:51,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash -435710053, now seen corresponding path program 1 times [2023-08-27 10:19:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:51,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483239900] [2023-08-27 10:19:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:52,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:52,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483239900] [2023-08-27 10:19:52,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483239900] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:52,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:52,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300978074] [2023-08-27 10:19:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:52,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:52,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:52,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:52,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:52,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 217 [2023-08-27 10:19:52,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:52,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:52,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 217 [2023-08-27 10:19:52,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:52,554 INFO L124 PetriNetUnfolderBase]: 2269/3677 cut-off events. [2023-08-27 10:19:52,554 INFO L125 PetriNetUnfolderBase]: For 496/527 co-relation queries the response was YES. [2023-08-27 10:19:52,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8679 conditions, 3677 events. 2269/3677 cut-off events. For 496/527 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 21025 event pairs, 287 based on Foata normal form. 9/3183 useless extension candidates. Maximal degree in co-relation 8667. Up to 2013 conditions per place. [2023-08-27 10:19:52,569 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 53 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2023-08-27 10:19:52,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 68 transitions, 334 flow [2023-08-27 10:19:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2023-08-27 10:19:52,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44815668202764974 [2023-08-27 10:19:52,570 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 389 transitions. [2023-08-27 10:19:52,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 389 transitions. [2023-08-27 10:19:52,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:52,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 389 transitions. [2023-08-27 10:19:52,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:52,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:52,573 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:52,574 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 96 flow. Second operand 4 states and 389 transitions. [2023-08-27 10:19:52,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 68 transitions, 334 flow [2023-08-27 10:19:52,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 68 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:52,576 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 184 flow [2023-08-27 10:19:52,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2023-08-27 10:19:52,577 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2023-08-27 10:19:52,578 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 184 flow [2023-08-27 10:19:52,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:52,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:52,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:52,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:19:52,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:52,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash -622111219, now seen corresponding path program 1 times [2023-08-27 10:19:52,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:52,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104268322] [2023-08-27 10:19:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104268322] [2023-08-27 10:19:53,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104268322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:53,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:53,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:53,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221893170] [2023-08-27 10:19:53,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:53,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:53,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:53,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:53,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:53,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 217 [2023-08-27 10:19:53,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:53,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 217 [2023-08-27 10:19:53,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:53,447 INFO L124 PetriNetUnfolderBase]: 2244/3613 cut-off events. [2023-08-27 10:19:53,447 INFO L125 PetriNetUnfolderBase]: For 2255/2310 co-relation queries the response was YES. [2023-08-27 10:19:53,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11158 conditions, 3613 events. 2244/3613 cut-off events. For 2255/2310 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 20541 event pairs, 296 based on Foata normal form. 14/3237 useless extension candidates. Maximal degree in co-relation 11143. Up to 2002 conditions per place. [2023-08-27 10:19:53,465 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 61 selfloop transitions, 19 changer transitions 0/83 dead transitions. [2023-08-27 10:19:53,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 524 flow [2023-08-27 10:19:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 386 transitions. [2023-08-27 10:19:53,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4447004608294931 [2023-08-27 10:19:53,467 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 386 transitions. [2023-08-27 10:19:53,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 386 transitions. [2023-08-27 10:19:53,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:53,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 386 transitions. [2023-08-27 10:19:53,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,470 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,470 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 184 flow. Second operand 4 states and 386 transitions. [2023-08-27 10:19:53,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 83 transitions, 524 flow [2023-08-27 10:19:53,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 83 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:19:53,475 INFO L231 Difference]: Finished difference. Result has 48 places, 56 transitions, 368 flow [2023-08-27 10:19:53,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=368, PETRI_PLACES=48, PETRI_TRANSITIONS=56} [2023-08-27 10:19:53,476 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-08-27 10:19:53,476 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 56 transitions, 368 flow [2023-08-27 10:19:53,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:53,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:53,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:19:53,477 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:53,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1256247725, now seen corresponding path program 1 times [2023-08-27 10:19:53,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:53,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416113099] [2023-08-27 10:19:53,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:53,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:53,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416113099] [2023-08-27 10:19:53,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416113099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:53,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:53,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:53,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160198359] [2023-08-27 10:19:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:53,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:53,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:53,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:53,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:53,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-27 10:19:53,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 56 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:53,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-27 10:19:53,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:53,777 INFO L124 PetriNetUnfolderBase]: 1470/2331 cut-off events. [2023-08-27 10:19:53,777 INFO L125 PetriNetUnfolderBase]: For 5784/5961 co-relation queries the response was YES. [2023-08-27 10:19:53,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9101 conditions, 2331 events. 1470/2331 cut-off events. For 5784/5961 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12886 event pairs, 218 based on Foata normal form. 136/2169 useless extension candidates. Maximal degree in co-relation 9081. Up to 1612 conditions per place. [2023-08-27 10:19:53,789 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 67 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2023-08-27 10:19:53,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 81 transitions, 694 flow [2023-08-27 10:19:53,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2023-08-27 10:19:53,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46543778801843316 [2023-08-27 10:19:53,792 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 404 transitions. [2023-08-27 10:19:53,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 404 transitions. [2023-08-27 10:19:53,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:53,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 404 transitions. [2023-08-27 10:19:53,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,794 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,794 INFO L175 Difference]: Start difference. First operand has 48 places, 56 transitions, 368 flow. Second operand 4 states and 404 transitions. [2023-08-27 10:19:53,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 81 transitions, 694 flow [2023-08-27 10:19:53,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 694 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:19:53,797 INFO L231 Difference]: Finished difference. Result has 48 places, 53 transitions, 364 flow [2023-08-27 10:19:53,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=48, PETRI_TRANSITIONS=53} [2023-08-27 10:19:53,798 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-08-27 10:19:53,798 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 53 transitions, 364 flow [2023-08-27 10:19:53,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:53,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:53,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:19:53,798 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:53,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1284694564, now seen corresponding path program 1 times [2023-08-27 10:19:53,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:53,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925435465] [2023-08-27 10:19:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:53,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:53,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925435465] [2023-08-27 10:19:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925435465] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:53,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:53,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:53,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098703695] [2023-08-27 10:19:53,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:53,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:53,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:53,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:53,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:53,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-27 10:19:53,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 53 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:53,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-27 10:19:53,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:54,034 INFO L124 PetriNetUnfolderBase]: 1137/1794 cut-off events. [2023-08-27 10:19:54,034 INFO L125 PetriNetUnfolderBase]: For 5035/5184 co-relation queries the response was YES. [2023-08-27 10:19:54,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7427 conditions, 1794 events. 1137/1794 cut-off events. For 5035/5184 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9449 event pairs, 148 based on Foata normal form. 108/1838 useless extension candidates. Maximal degree in co-relation 7405. Up to 807 conditions per place. [2023-08-27 10:19:54,044 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 85 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2023-08-27 10:19:54,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 102 transitions, 878 flow [2023-08-27 10:19:54,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2023-08-27 10:19:54,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4815668202764977 [2023-08-27 10:19:54,046 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2023-08-27 10:19:54,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2023-08-27 10:19:54,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:54,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2023-08-27 10:19:54,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,048 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,048 INFO L175 Difference]: Start difference. First operand has 48 places, 53 transitions, 364 flow. Second operand 4 states and 418 transitions. [2023-08-27 10:19:54,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 102 transitions, 878 flow [2023-08-27 10:19:54,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 102 transitions, 873 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:54,052 INFO L231 Difference]: Finished difference. Result has 50 places, 56 transitions, 403 flow [2023-08-27 10:19:54,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=403, PETRI_PLACES=50, PETRI_TRANSITIONS=56} [2023-08-27 10:19:54,053 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-08-27 10:19:54,053 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 56 transitions, 403 flow [2023-08-27 10:19:54,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:54,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:54,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:19:54,054 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:54,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1647642153, now seen corresponding path program 1 times [2023-08-27 10:19:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28080933] [2023-08-27 10:19:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:54,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:54,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28080933] [2023-08-27 10:19:54,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28080933] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:54,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:54,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:19:54,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636441502] [2023-08-27 10:19:54,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:54,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:54,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 217 [2023-08-27 10:19:54,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 56 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:54,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 217 [2023-08-27 10:19:54,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:54,833 INFO L124 PetriNetUnfolderBase]: 2048/3189 cut-off events. [2023-08-27 10:19:54,833 INFO L125 PetriNetUnfolderBase]: For 7809/7809 co-relation queries the response was YES. [2023-08-27 10:19:54,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14098 conditions, 3189 events. 2048/3189 cut-off events. For 7809/7809 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16489 event pairs, 359 based on Foata normal form. 53/3194 useless extension candidates. Maximal degree in co-relation 14075. Up to 1435 conditions per place. [2023-08-27 10:19:54,848 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 75 selfloop transitions, 32 changer transitions 3/110 dead transitions. [2023-08-27 10:19:54,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 110 transitions, 947 flow [2023-08-27 10:19:54,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-08-27 10:19:54,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45276497695852536 [2023-08-27 10:19:54,850 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-08-27 10:19:54,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-08-27 10:19:54,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:54,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-08-27 10:19:54,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,852 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,852 INFO L175 Difference]: Start difference. First operand has 50 places, 56 transitions, 403 flow. Second operand 4 states and 393 transitions. [2023-08-27 10:19:54,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 110 transitions, 947 flow [2023-08-27 10:19:54,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 110 transitions, 909 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:54,859 INFO L231 Difference]: Finished difference. Result has 54 places, 68 transitions, 643 flow [2023-08-27 10:19:54,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=643, PETRI_PLACES=54, PETRI_TRANSITIONS=68} [2023-08-27 10:19:54,860 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2023-08-27 10:19:54,860 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 68 transitions, 643 flow [2023-08-27 10:19:54,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:54,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:54,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:19:54,861 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:54,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:54,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2107391585, now seen corresponding path program 1 times [2023-08-27 10:19:54,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:54,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769822993] [2023-08-27 10:19:54,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:54,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769822993] [2023-08-27 10:19:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769822993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:55,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:55,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:55,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476413261] [2023-08-27 10:19:55,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:55,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:55,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:55,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:55,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:55,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-27 10:19:55,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 68 transitions, 643 flow. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:55,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-27 10:19:55,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:55,405 INFO L124 PetriNetUnfolderBase]: 1777/2856 cut-off events. [2023-08-27 10:19:55,405 INFO L125 PetriNetUnfolderBase]: For 8807/8859 co-relation queries the response was YES. [2023-08-27 10:19:55,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13895 conditions, 2856 events. 1777/2856 cut-off events. For 8807/8859 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 15356 event pairs, 214 based on Foata normal form. 39/2828 useless extension candidates. Maximal degree in co-relation 13869. Up to 2133 conditions per place. [2023-08-27 10:19:55,419 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 76 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2023-08-27 10:19:55,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 1061 flow [2023-08-27 10:19:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:19:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:19:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-08-27 10:19:55,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685099846390169 [2023-08-27 10:19:55,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-08-27 10:19:55,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-08-27 10:19:55,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:55,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-08-27 10:19:55,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,422 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,422 INFO L175 Difference]: Start difference. First operand has 54 places, 68 transitions, 643 flow. Second operand 3 states and 305 transitions. [2023-08-27 10:19:55,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 1061 flow [2023-08-27 10:19:55,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 1057 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-27 10:19:55,429 INFO L231 Difference]: Finished difference. Result has 57 places, 68 transitions, 664 flow [2023-08-27 10:19:55,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=57, PETRI_TRANSITIONS=68} [2023-08-27 10:19:55,429 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2023-08-27 10:19:55,430 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 68 transitions, 664 flow [2023-08-27 10:19:55,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:55,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:55,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:19:55,430 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:55,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:55,430 INFO L85 PathProgramCache]: Analyzing trace with hash 496067575, now seen corresponding path program 1 times [2023-08-27 10:19:55,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:55,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353737419] [2023-08-27 10:19:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:55,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:55,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:55,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353737419] [2023-08-27 10:19:55,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353737419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:55,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:55,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:19:55,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727337653] [2023-08-27 10:19:55,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:55,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:19:55,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:55,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:19:55,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:19:55,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217 [2023-08-27 10:19:55,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 68 transitions, 664 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:55,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217 [2023-08-27 10:19:55,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:56,103 INFO L124 PetriNetUnfolderBase]: 1908/3061 cut-off events. [2023-08-27 10:19:56,103 INFO L125 PetriNetUnfolderBase]: For 11301/11527 co-relation queries the response was YES. [2023-08-27 10:19:56,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15430 conditions, 3061 events. 1908/3061 cut-off events. For 11301/11527 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16830 event pairs, 209 based on Foata normal form. 145/3132 useless extension candidates. Maximal degree in co-relation 15401. Up to 1657 conditions per place. [2023-08-27 10:19:56,120 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 97 selfloop transitions, 15 changer transitions 0/123 dead transitions. [2023-08-27 10:19:56,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 123 transitions, 1416 flow [2023-08-27 10:19:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-08-27 10:19:56,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45852534562211983 [2023-08-27 10:19:56,121 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-08-27 10:19:56,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-08-27 10:19:56,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:56,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-08-27 10:19:56,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:56,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:56,123 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:56,123 INFO L175 Difference]: Start difference. First operand has 57 places, 68 transitions, 664 flow. Second operand 4 states and 398 transitions. [2023-08-27 10:19:56,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 123 transitions, 1416 flow [2023-08-27 10:19:56,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 1402 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:56,134 INFO L231 Difference]: Finished difference. Result has 59 places, 75 transitions, 784 flow [2023-08-27 10:19:56,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=784, PETRI_PLACES=59, PETRI_TRANSITIONS=75} [2023-08-27 10:19:56,134 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2023-08-27 10:19:56,135 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 75 transitions, 784 flow [2023-08-27 10:19:56,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:56,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:56,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:56,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:19:56,135 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:56,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash 337990498, now seen corresponding path program 1 times [2023-08-27 10:19:56,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:56,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388998653] [2023-08-27 10:19:56,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388998653] [2023-08-27 10:19:56,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388998653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:56,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:56,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:19:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635827446] [2023-08-27 10:19:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:56,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:56,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:56,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:56,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:56,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 217 [2023-08-27 10:19:56,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 75 transitions, 784 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:56,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:56,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 217 [2023-08-27 10:19:56,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:57,031 INFO L124 PetriNetUnfolderBase]: 2954/4669 cut-off events. [2023-08-27 10:19:57,031 INFO L125 PetriNetUnfolderBase]: For 17956/17956 co-relation queries the response was YES. [2023-08-27 10:19:57,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24033 conditions, 4669 events. 2954/4669 cut-off events. For 17956/17956 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26490 event pairs, 426 based on Foata normal form. 43/4616 useless extension candidates. Maximal degree in co-relation 24003. Up to 2000 conditions per place. [2023-08-27 10:19:57,051 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 93 selfloop transitions, 41 changer transitions 0/134 dead transitions. [2023-08-27 10:19:57,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 134 transitions, 1539 flow [2023-08-27 10:19:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2023-08-27 10:19:57,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44815668202764974 [2023-08-27 10:19:57,052 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 389 transitions. [2023-08-27 10:19:57,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 389 transitions. [2023-08-27 10:19:57,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:57,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 389 transitions. [2023-08-27 10:19:57,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:57,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:57,054 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:57,054 INFO L175 Difference]: Start difference. First operand has 59 places, 75 transitions, 784 flow. Second operand 4 states and 389 transitions. [2023-08-27 10:19:57,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 134 transitions, 1539 flow [2023-08-27 10:19:57,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 134 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:57,064 INFO L231 Difference]: Finished difference. Result has 63 places, 92 transitions, 1208 flow [2023-08-27 10:19:57,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1208, PETRI_PLACES=63, PETRI_TRANSITIONS=92} [2023-08-27 10:19:57,065 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2023-08-27 10:19:57,065 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 92 transitions, 1208 flow [2023-08-27 10:19:57,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:57,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:57,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:57,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:19:57,065 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:57,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:57,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1871438106, now seen corresponding path program 1 times [2023-08-27 10:19:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:57,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250211558] [2023-08-27 10:19:57,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:57,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:57,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250211558] [2023-08-27 10:19:57,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250211558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:57,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:57,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:19:57,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341532641] [2023-08-27 10:19:57,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:57,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:19:57,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:57,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:19:57,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:19:57,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 217 [2023-08-27 10:19:57,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 92 transitions, 1208 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:57,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:57,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 217 [2023-08-27 10:19:57,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:58,359 INFO L124 PetriNetUnfolderBase]: 3763/5891 cut-off events. [2023-08-27 10:19:58,359 INFO L125 PetriNetUnfolderBase]: For 33330/33330 co-relation queries the response was YES. [2023-08-27 10:19:58,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34008 conditions, 5891 events. 3763/5891 cut-off events. For 33330/33330 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 34188 event pairs, 470 based on Foata normal form. 8/5803 useless extension candidates. Maximal degree in co-relation 33975. Up to 4443 conditions per place. [2023-08-27 10:19:58,393 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 163 selfloop transitions, 80 changer transitions 0/243 dead transitions. [2023-08-27 10:19:58,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 243 transitions, 3563 flow [2023-08-27 10:19:58,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:19:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:19:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 739 transitions. [2023-08-27 10:19:58,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42569124423963134 [2023-08-27 10:19:58,395 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 739 transitions. [2023-08-27 10:19:58,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 739 transitions. [2023-08-27 10:19:58,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:58,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 739 transitions. [2023-08-27 10:19:58,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:58,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:58,398 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:58,398 INFO L175 Difference]: Start difference. First operand has 63 places, 92 transitions, 1208 flow. Second operand 8 states and 739 transitions. [2023-08-27 10:19:58,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 243 transitions, 3563 flow [2023-08-27 10:19:58,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 243 transitions, 3563 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:19:58,439 INFO L231 Difference]: Finished difference. Result has 76 places, 165 transitions, 2714 flow [2023-08-27 10:19:58,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2714, PETRI_PLACES=76, PETRI_TRANSITIONS=165} [2023-08-27 10:19:58,440 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 38 predicate places. [2023-08-27 10:19:58,440 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 165 transitions, 2714 flow [2023-08-27 10:19:58,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:58,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:58,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:58,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:19:58,440 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:58,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:58,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1869737136, now seen corresponding path program 2 times [2023-08-27 10:19:58,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:58,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246660054] [2023-08-27 10:19:58,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:58,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:58,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:58,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246660054] [2023-08-27 10:19:58,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246660054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:58,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:58,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:19:58,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114234433] [2023-08-27 10:19:58,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:58,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:19:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:58,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:19:58,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:19:58,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 217 [2023-08-27 10:19:58,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 165 transitions, 2714 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:58,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:58,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 217 [2023-08-27 10:19:58,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:59,603 INFO L124 PetriNetUnfolderBase]: 3608/5807 cut-off events. [2023-08-27 10:19:59,603 INFO L125 PetriNetUnfolderBase]: For 52130/52779 co-relation queries the response was YES. [2023-08-27 10:19:59,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38779 conditions, 5807 events. 3608/5807 cut-off events. For 52130/52779 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 36477 event pairs, 345 based on Foata normal form. 326/5953 useless extension candidates. Maximal degree in co-relation 38738. Up to 3606 conditions per place. [2023-08-27 10:19:59,633 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 182 selfloop transitions, 39 changer transitions 0/237 dead transitions. [2023-08-27 10:19:59,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 237 transitions, 4186 flow [2023-08-27 10:19:59,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:19:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:19:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2023-08-27 10:19:59,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497695852534562 [2023-08-27 10:19:59,635 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 488 transitions. [2023-08-27 10:19:59,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 488 transitions. [2023-08-27 10:19:59,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:59,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 488 transitions. [2023-08-27 10:19:59,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,637 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,637 INFO L175 Difference]: Start difference. First operand has 76 places, 165 transitions, 2714 flow. Second operand 5 states and 488 transitions. [2023-08-27 10:19:59,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 237 transitions, 4186 flow [2023-08-27 10:19:59,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 237 transitions, 4162 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-27 10:19:59,694 INFO L231 Difference]: Finished difference. Result has 81 places, 181 transitions, 3125 flow [2023-08-27 10:19:59,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2690, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3125, PETRI_PLACES=81, PETRI_TRANSITIONS=181} [2023-08-27 10:19:59,695 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 43 predicate places. [2023-08-27 10:19:59,695 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 181 transitions, 3125 flow [2023-08-27 10:19:59,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:59,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:59,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:19:59,696 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:59,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:59,696 INFO L85 PathProgramCache]: Analyzing trace with hash -20528682, now seen corresponding path program 3 times [2023-08-27 10:19:59,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:59,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683019348] [2023-08-27 10:19:59,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:59,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:20:00,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:00,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683019348] [2023-08-27 10:20:00,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683019348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:00,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:00,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:20:00,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374475627] [2023-08-27 10:20:00,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:00,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:20:00,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:00,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:20:00,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:20:00,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217 [2023-08-27 10:20:00,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 181 transitions, 3125 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:00,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:00,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217 [2023-08-27 10:20:00,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:00,893 INFO L124 PetriNetUnfolderBase]: 4165/6796 cut-off events. [2023-08-27 10:20:00,893 INFO L125 PetriNetUnfolderBase]: For 67050/67829 co-relation queries the response was YES. [2023-08-27 10:20:00,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45167 conditions, 6796 events. 4165/6796 cut-off events. For 67050/67829 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 44651 event pairs, 391 based on Foata normal form. 392/6923 useless extension candidates. Maximal degree in co-relation 45123. Up to 3329 conditions per place. [2023-08-27 10:20:00,933 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 161 selfloop transitions, 53 changer transitions 0/230 dead transitions. [2023-08-27 10:20:00,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 230 transitions, 4108 flow [2023-08-27 10:20:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:20:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:20:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2023-08-27 10:20:00,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423963133640553 [2023-08-27 10:20:00,934 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 480 transitions. [2023-08-27 10:20:00,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 480 transitions. [2023-08-27 10:20:00,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:00,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 480 transitions. [2023-08-27 10:20:00,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:00,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:00,937 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:00,937 INFO L175 Difference]: Start difference. First operand has 81 places, 181 transitions, 3125 flow. Second operand 5 states and 480 transitions. [2023-08-27 10:20:00,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 230 transitions, 4108 flow [2023-08-27 10:20:01,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 230 transitions, 4079 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:20:01,014 INFO L231 Difference]: Finished difference. Result has 86 places, 182 transitions, 3302 flow [2023-08-27 10:20:01,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3096, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3302, PETRI_PLACES=86, PETRI_TRANSITIONS=182} [2023-08-27 10:20:01,015 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 48 predicate places. [2023-08-27 10:20:01,015 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 182 transitions, 3302 flow [2023-08-27 10:20:01,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:01,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:01,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:20:01,015 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:20:01,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1887807512, now seen corresponding path program 1 times [2023-08-27 10:20:01,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:01,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388710437] [2023-08-27 10:20:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:01,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:20:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388710437] [2023-08-27 10:20:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388710437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:01,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:20:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419774247] [2023-08-27 10:20:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:01,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:20:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:20:01,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:20:01,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217 [2023-08-27 10:20:01,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 182 transitions, 3302 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:01,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217 [2023-08-27 10:20:01,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:01,696 INFO L124 PetriNetUnfolderBase]: 2549/4653 cut-off events. [2023-08-27 10:20:01,696 INFO L125 PetriNetUnfolderBase]: For 62479/63097 co-relation queries the response was YES. [2023-08-27 10:20:01,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30727 conditions, 4653 events. 2549/4653 cut-off events. For 62479/63097 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 34515 event pairs, 190 based on Foata normal form. 840/5194 useless extension candidates. Maximal degree in co-relation 30680. Up to 2254 conditions per place. [2023-08-27 10:20:01,721 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 268 selfloop transitions, 11 changer transitions 0/299 dead transitions. [2023-08-27 10:20:01,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 299 transitions, 5912 flow [2023-08-27 10:20:01,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:20:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:20:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2023-08-27 10:20:01,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45622119815668205 [2023-08-27 10:20:01,723 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 495 transitions. [2023-08-27 10:20:01,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 495 transitions. [2023-08-27 10:20:01,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:01,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 495 transitions. [2023-08-27 10:20:01,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,726 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,726 INFO L175 Difference]: Start difference. First operand has 86 places, 182 transitions, 3302 flow. Second operand 5 states and 495 transitions. [2023-08-27 10:20:01,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 299 transitions, 5912 flow [2023-08-27 10:20:01,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 299 transitions, 5759 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-27 10:20:01,782 INFO L231 Difference]: Finished difference. Result has 88 places, 160 transitions, 2803 flow [2023-08-27 10:20:01,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2697, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2803, PETRI_PLACES=88, PETRI_TRANSITIONS=160} [2023-08-27 10:20:01,782 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2023-08-27 10:20:01,783 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 160 transitions, 2803 flow [2023-08-27 10:20:01,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:01,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:01,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:20:01,783 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:20:01,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash -219036101, now seen corresponding path program 1 times [2023-08-27 10:20:01,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:01,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992102038] [2023-08-27 10:20:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:01,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:20:01,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:01,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992102038] [2023-08-27 10:20:01,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992102038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:01,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:01,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:20:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507316593] [2023-08-27 10:20:01,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:01,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:20:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:01,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:20:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:20:01,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217 [2023-08-27 10:20:01,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 160 transitions, 2803 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:01,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217 [2023-08-27 10:20:01,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:02,297 INFO L124 PetriNetUnfolderBase]: 1594/3233 cut-off events. [2023-08-27 10:20:02,297 INFO L125 PetriNetUnfolderBase]: For 50471/51259 co-relation queries the response was YES. [2023-08-27 10:20:02,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22080 conditions, 3233 events. 1594/3233 cut-off events. For 50471/51259 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 25062 event pairs, 171 based on Foata normal form. 802/3955 useless extension candidates. Maximal degree in co-relation 22032. Up to 1129 conditions per place. [2023-08-27 10:20:02,313 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 228 selfloop transitions, 9 changer transitions 0/256 dead transitions. [2023-08-27 10:20:02,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 256 transitions, 4906 flow [2023-08-27 10:20:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:20:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:20:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-08-27 10:20:02,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46359447004608295 [2023-08-27 10:20:02,315 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-08-27 10:20:02,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-08-27 10:20:02,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:02,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-08-27 10:20:02,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,317 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,317 INFO L175 Difference]: Start difference. First operand has 88 places, 160 transitions, 2803 flow. Second operand 5 states and 503 transitions. [2023-08-27 10:20:02,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 256 transitions, 4906 flow [2023-08-27 10:20:02,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 256 transitions, 4869 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-27 10:20:02,345 INFO L231 Difference]: Finished difference. Result has 92 places, 135 transitions, 2270 flow [2023-08-27 10:20:02,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2270, PETRI_PLACES=92, PETRI_TRANSITIONS=135} [2023-08-27 10:20:02,345 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2023-08-27 10:20:02,345 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 135 transitions, 2270 flow [2023-08-27 10:20:02,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:02,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:02,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:20:02,346 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:20:02,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:02,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1444122658, now seen corresponding path program 1 times [2023-08-27 10:20:02,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:02,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054681446] [2023-08-27 10:20:02,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:02,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:20:02,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:02,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054681446] [2023-08-27 10:20:02,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054681446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:02,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:02,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:20:02,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355279193] [2023-08-27 10:20:02,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:02,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:20:02,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:02,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:20:02,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:20:02,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-27 10:20:02,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 135 transitions, 2270 flow. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:02,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-27 10:20:02,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:02,732 INFO L124 PetriNetUnfolderBase]: 1527/2936 cut-off events. [2023-08-27 10:20:02,732 INFO L125 PetriNetUnfolderBase]: For 42758/43349 co-relation queries the response was YES. [2023-08-27 10:20:02,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22123 conditions, 2936 events. 1527/2936 cut-off events. For 42758/43349 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 21303 event pairs, 137 based on Foata normal form. 619/3493 useless extension candidates. Maximal degree in co-relation 22073. Up to 1090 conditions per place. [2023-08-27 10:20:02,742 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 71 selfloop transitions, 10 changer transitions 142/230 dead transitions. [2023-08-27 10:20:02,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 230 transitions, 4488 flow [2023-08-27 10:20:02,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:20:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:20:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2023-08-27 10:20:02,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2023-08-27 10:20:02,746 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions. [2023-08-27 10:20:02,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions. [2023-08-27 10:20:02,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:02,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions. [2023-08-27 10:20:02,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,748 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,748 INFO L175 Difference]: Start difference. First operand has 92 places, 135 transitions, 2270 flow. Second operand 5 states and 504 transitions. [2023-08-27 10:20:02,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 230 transitions, 4488 flow [2023-08-27 10:20:02,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 230 transitions, 4471 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:20:02,778 INFO L231 Difference]: Finished difference. Result has 88 places, 60 transitions, 877 flow [2023-08-27 10:20:02,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=877, PETRI_PLACES=88, PETRI_TRANSITIONS=60} [2023-08-27 10:20:02,778 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2023-08-27 10:20:02,778 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 60 transitions, 877 flow [2023-08-27 10:20:02,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:02,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:02,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:20:02,779 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:20:02,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:02,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1618046214, now seen corresponding path program 1 times [2023-08-27 10:20:02,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:02,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230637062] [2023-08-27 10:20:02,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:02,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:20:02,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:02,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230637062] [2023-08-27 10:20:02,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230637062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:02,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:02,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:20:02,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701616126] [2023-08-27 10:20:02,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:02,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:20:02,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:02,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:20:02,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:20:02,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217 [2023-08-27 10:20:02,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 60 transitions, 877 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:02,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217 [2023-08-27 10:20:02,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:02,969 INFO L124 PetriNetUnfolderBase]: 164/394 cut-off events. [2023-08-27 10:20:02,969 INFO L125 PetriNetUnfolderBase]: For 4824/4857 co-relation queries the response was YES. [2023-08-27 10:20:02,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 394 events. 164/394 cut-off events. For 4824/4857 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2053 event pairs, 8 based on Foata normal form. 57/443 useless extension candidates. Maximal degree in co-relation 2744. Up to 123 conditions per place. [2023-08-27 10:20:02,971 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 21 selfloop transitions, 11 changer transitions 52/87 dead transitions. [2023-08-27 10:20:02,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 1417 flow [2023-08-27 10:20:02,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:20:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:20:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions. [2023-08-27 10:20:02,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43855606758832566 [2023-08-27 10:20:02,973 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 571 transitions. [2023-08-27 10:20:02,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 571 transitions. [2023-08-27 10:20:02,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:02,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 571 transitions. [2023-08-27 10:20:02,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,976 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,976 INFO L175 Difference]: Start difference. First operand has 88 places, 60 transitions, 877 flow. Second operand 6 states and 571 transitions. [2023-08-27 10:20:02,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 1417 flow [2023-08-27 10:20:02,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 87 transitions, 1114 flow, removed 38 selfloop flow, removed 22 redundant places. [2023-08-27 10:20:02,982 INFO L231 Difference]: Finished difference. Result has 71 places, 28 transitions, 230 flow [2023-08-27 10:20:02,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=71, PETRI_TRANSITIONS=28} [2023-08-27 10:20:02,982 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2023-08-27 10:20:02,983 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 28 transitions, 230 flow [2023-08-27 10:20:02,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:02,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:02,983 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-27 10:20:02,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:20:02,983 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:20:02,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:02,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1643564514, now seen corresponding path program 1 times [2023-08-27 10:20:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267474607] [2023-08-27 10:20:02,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:20:03,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:20:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:20:03,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:20:03,041 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:20:03,042 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 10:20:03,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 10:20:03,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 10:20:03,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (12 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (2 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 10:20:03,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 10:20:03,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:20:03,046 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:03,049 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:20:03,049 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:20:03,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:20:03 BasicIcfg [2023-08-27 10:20:03,102 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:20:03,103 INFO L158 Benchmark]: Toolchain (without parser) took 16900.71ms. Allocated memory was 408.9MB in the beginning and 1.0GB in the end (delta: 601.9MB). Free memory was 363.7MB in the beginning and 846.0MB in the end (delta: -482.2MB). Peak memory consumption was 120.1MB. Max. memory is 16.0GB. [2023-08-27 10:20:03,103 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 408.9MB. Free memory is still 386.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:20:03,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.07ms. Allocated memory is still 408.9MB. Free memory was 363.3MB in the beginning and 376.7MB in the end (delta: -13.4MB). Peak memory consumption was 17.5MB. Max. memory is 16.0GB. [2023-08-27 10:20:03,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.32ms. Allocated memory is still 408.9MB. Free memory was 376.7MB in the beginning and 374.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:20:03,103 INFO L158 Benchmark]: Boogie Preprocessor took 25.82ms. Allocated memory is still 408.9MB. Free memory was 374.0MB in the beginning and 372.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:20:03,103 INFO L158 Benchmark]: RCFGBuilder took 518.28ms. Allocated memory is still 408.9MB. Free memory was 372.5MB in the beginning and 335.4MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-27 10:20:03,103 INFO L158 Benchmark]: TraceAbstraction took 15835.13ms. Allocated memory was 408.9MB in the beginning and 1.0GB in the end (delta: 601.9MB). Free memory was 334.8MB in the beginning and 846.0MB in the end (delta: -511.2MB). Peak memory consumption was 89.9MB. Max. memory is 16.0GB. [2023-08-27 10:20:03,104 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.11ms. Allocated memory is still 408.9MB. Free memory is still 386.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 461.07ms. Allocated memory is still 408.9MB. Free memory was 363.3MB in the beginning and 376.7MB in the end (delta: -13.4MB). Peak memory consumption was 17.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.32ms. Allocated memory is still 408.9MB. Free memory was 376.7MB in the beginning and 374.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.82ms. Allocated memory is still 408.9MB. Free memory was 374.0MB in the beginning and 372.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 518.28ms. Allocated memory is still 408.9MB. Free memory was 372.5MB in the beginning and 335.4MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 15835.13ms. Allocated memory was 408.9MB in the beginning and 1.0GB in the end (delta: 601.9MB). Free memory was 334.8MB in the beginning and 846.0MB in the end (delta: -511.2MB). Peak memory consumption was 89.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 119 PlacesBefore, 38 PlacesAfterwards, 112 TransitionsBefore, 28 TransitionsAfterwards, 2616 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 102 TotalNumberOfCompositions, 9246 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3832, independent: 3567, independent conditional: 0, independent unconditional: 3567, dependent: 265, dependent conditional: 0, dependent unconditional: 265, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1398, independent: 1349, independent conditional: 0, independent unconditional: 1349, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3832, independent: 2218, independent conditional: 0, independent unconditional: 2218, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 1398, unknown conditional: 0, unknown unconditional: 1398] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L767] EXPR 2 __unbuffered_cnt + 1 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] EXPR 1 __unbuffered_cnt + 1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L796] EXPR 3 __unbuffered_cnt + 1 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] 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", "safe030_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 767]: 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: 796]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 796]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 812]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 434 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1276 IncrementalHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 38 mSDtfsCounter, 1276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3302occurred in iteration=13, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 2240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 10:20:03,126 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...