/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:53:01,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:53:01,186 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 03:53:01,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:53:01,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:53:01,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:53:01,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:53:01,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:53:01,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:53:01,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:53:01,221 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:53:01,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:53:01,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:53:01,222 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:53:01,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:53:01,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:53:01,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:53:01,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:53:01,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:53:01,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:53:01,223 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:53:01,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:53:01,227 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:53:01,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:53:01,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:53:01,228 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:53:01,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:53:01,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:53:01,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:53:01,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:53:01,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:53:01,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:53:01,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:53:01,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:53:01,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:53:01,230 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:53:01,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:53:01,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:53:01,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:53:01,485 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:53:01,486 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:53:01,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 03:53:02,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:53:02,644 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:53:02,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 03:53:02,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bffe130e/5e298fdfec7c4d689ac700ac98bbe1c4/FLAGfb14a90d3 [2023-08-27 03:53:02,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bffe130e/5e298fdfec7c4d689ac700ac98bbe1c4 [2023-08-27 03:53:02,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:53:02,671 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:53:02,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:53:02,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:53:02,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:53:02,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:02,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c440704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02, skipping insertion in model container [2023-08-27 03:53:02,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:02,706 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:53:02,892 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:53:02,900 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:53:02,928 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:53:02,929 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:53:02,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:53:02,990 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:53:02,990 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:53:02,995 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:53:02,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02 WrapperNode [2023-08-27 03:53:02,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:53:02,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:53:02,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:53:02,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:53:03,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:03,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:03,052 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-08-27 03:53:03,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:53:03,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:53:03,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:53:03,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:53:03,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:03,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:03,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:03,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:03,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:03,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:03,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:03,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:03,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:53:03,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:53:03,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:53:03,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:53:03,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (1/1) ... [2023-08-27 03:53:03,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:53:03,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:53:03,103 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 03:53:03,113 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 03:53:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:53:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:53:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:53:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:53:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:53:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:53:03,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:53:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:53:03,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:53:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:53:03,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:53:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:53:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:53:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:53:03,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:53:03,135 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 03:53:03,261 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:53:03,262 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:53:03,476 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:53:03,563 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:53:03,563 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:53:03,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:53:03 BoogieIcfgContainer [2023-08-27 03:53:03,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:53:03,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:53:03,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:53:03,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:53:03,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:53:02" (1/3) ... [2023-08-27 03:53:03,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afd956b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:53:03, skipping insertion in model container [2023-08-27 03:53:03,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:02" (2/3) ... [2023-08-27 03:53:03,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afd956b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:53:03, skipping insertion in model container [2023-08-27 03:53:03,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:53:03" (3/3) ... [2023-08-27 03:53:03,570 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 03:53:03,580 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:53:03,580 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 03:53:03,581 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:53:03,614 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:53:03,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 249 flow [2023-08-27 03:53:03,667 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-27 03:53:03,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:53:03,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-27 03:53:03,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 117 transitions, 249 flow [2023-08-27 03:53:03,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 114 transitions, 237 flow [2023-08-27 03:53:03,677 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:53:03,682 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-27 03:53:03,684 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-27 03:53:03,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 114 transitions, 237 flow [2023-08-27 03:53:03,703 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-27 03:53:03,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:53:03,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-27 03:53:03,705 INFO L119 LiptonReduction]: Number of co-enabled transitions 2630 [2023-08-27 03:53:06,409 INFO L134 LiptonReduction]: Checked pairs total: 8609 [2023-08-27 03:53:06,409 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-08-27 03:53:06,424 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:53:06,429 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;@35695b99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:53:06,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 03:53:06,433 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:53:06,433 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 03:53:06,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:53:06,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:06,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:53:06,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:06,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:06,438 INFO L85 PathProgramCache]: Analyzing trace with hash 504642615, now seen corresponding path program 1 times [2023-08-27 03:53:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:06,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119929863] [2023-08-27 03:53:06,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:06,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:06,659 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 03:53:06,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:06,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119929863] [2023-08-27 03:53:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119929863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:06,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:06,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:53:06,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235552497] [2023-08-27 03:53:06,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:06,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:53:06,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:06,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:53:06,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:53:06,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 217 [2023-08-27 03:53:06,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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 03:53:06,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:06,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 217 [2023-08-27 03:53:06,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:07,026 INFO L124 PetriNetUnfolderBase]: 2512/3656 cut-off events. [2023-08-27 03:53:07,026 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-27 03:53:07,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7366 conditions, 3656 events. 2512/3656 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17856 event pairs, 2512 based on Foata normal form. 150/2647 useless extension candidates. Maximal degree in co-relation 7355. Up to 3633 conditions per place. [2023-08-27 03:53:07,048 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 24 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-27 03:53:07,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 113 flow [2023-08-27 03:53:07,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:53:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:53:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2023-08-27 03:53:07,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2023-08-27 03:53:07,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2023-08-27 03:53:07,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2023-08-27 03:53:07,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:07,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2023-08-27 03:53:07,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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 03:53:07,064 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 03:53:07,064 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 03:53:07,065 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 308 transitions. [2023-08-27 03:53:07,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 113 flow [2023-08-27 03:53:07,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:53:07,069 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 62 flow [2023-08-27 03:53:07,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-08-27 03:53:07,072 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-27 03:53:07,072 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 62 flow [2023-08-27 03:53:07,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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 03:53:07,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:07,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:53:07,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:53:07,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:07,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash 504687693, now seen corresponding path program 1 times [2023-08-27 03:53:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:07,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783011983] [2023-08-27 03:53:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:07,197 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 03:53:07,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:07,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783011983] [2023-08-27 03:53:07,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783011983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:07,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:07,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:53:07,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867686210] [2023-08-27 03:53:07,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:07,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:53:07,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:07,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:53:07,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:53:07,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217 [2023-08-27 03:53:07,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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 03:53:07,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:07,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217 [2023-08-27 03:53:07,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:07,433 INFO L124 PetriNetUnfolderBase]: 2064/3085 cut-off events. [2023-08-27 03:53:07,434 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:53:07,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6151 conditions, 3085 events. 2064/3085 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15237 event pairs, 587 based on Foata normal form. 0/2278 useless extension candidates. Maximal degree in co-relation 6145. Up to 2533 conditions per place. [2023-08-27 03:53:07,446 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 38 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-27 03:53:07,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 174 flow [2023-08-27 03:53:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:53:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:53:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-08-27 03:53:07,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099846390168971 [2023-08-27 03:53:07,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-08-27 03:53:07,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-08-27 03:53:07,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:07,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-08-27 03:53:07,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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 03:53:07,456 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 03:53:07,457 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 03:53:07,457 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 62 flow. Second operand 3 states and 332 transitions. [2023-08-27 03:53:07,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 174 flow [2023-08-27 03:53:07,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 173 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:53:07,458 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 63 flow [2023-08-27 03:53:07,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-27 03:53:07,459 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-27 03:53:07,459 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 63 flow [2023-08-27 03:53:07,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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 03:53:07,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:07,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:53:07,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:53:07,460 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:07,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:07,460 INFO L85 PathProgramCache]: Analyzing trace with hash 504642616, now seen corresponding path program 1 times [2023-08-27 03:53:07,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:07,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788041665] [2023-08-27 03:53:07,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:07,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:07,509 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 03:53:07,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:07,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788041665] [2023-08-27 03:53:07,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788041665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:07,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:07,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:53:07,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645913064] [2023-08-27 03:53:07,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:07,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:53:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:07,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:53:07,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:53:07,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 217 [2023-08-27 03:53:07,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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 03:53:07,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:07,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 217 [2023-08-27 03:53:07,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:07,689 INFO L124 PetriNetUnfolderBase]: 1294/1967 cut-off events. [2023-08-27 03:53:07,689 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-08-27 03:53:07,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4107 conditions, 1967 events. 1294/1967 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9483 event pairs, 429 based on Foata normal form. 0/1576 useless extension candidates. Maximal degree in co-relation 4100. Up to 1362 conditions per place. [2023-08-27 03:53:07,696 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 39 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-27 03:53:07,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 193 flow [2023-08-27 03:53:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:53:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:53:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-27 03:53:07,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49923195084485406 [2023-08-27 03:53:07,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-27 03:53:07,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-27 03:53:07,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:07,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-27 03:53:07,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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 03:53:07,700 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 03:53:07,700 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 03:53:07,700 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 63 flow. Second operand 3 states and 325 transitions. [2023-08-27 03:53:07,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 193 flow [2023-08-27 03:53:07,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 187 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:53:07,702 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 89 flow [2023-08-27 03:53:07,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-08-27 03:53:07,703 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-27 03:53:07,704 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 89 flow [2023-08-27 03:53:07,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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 03:53:07,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:07,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:07,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:53:07,707 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:07,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash 585749735, now seen corresponding path program 1 times [2023-08-27 03:53:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:07,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480976734] [2023-08-27 03:53:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:07,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:07,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:07,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480976734] [2023-08-27 03:53:07,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480976734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:07,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:07,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:53:07,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724977368] [2023-08-27 03:53:07,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:07,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:53:07,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:07,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:53:07,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:53:07,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217 [2023-08-27 03:53:07,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:07,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:07,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217 [2023-08-27 03:53:07,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:08,327 INFO L124 PetriNetUnfolderBase]: 3668/5473 cut-off events. [2023-08-27 03:53:08,327 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2023-08-27 03:53:08,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13132 conditions, 5473 events. 3668/5473 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 29305 event pairs, 962 based on Foata normal form. 0/4570 useless extension candidates. Maximal degree in co-relation 13124. Up to 2075 conditions per place. [2023-08-27 03:53:08,347 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 76 selfloop transitions, 14 changer transitions 0/90 dead transitions. [2023-08-27 03:53:08,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 90 transitions, 458 flow [2023-08-27 03:53:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:53:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:53:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-08-27 03:53:08,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47465437788018433 [2023-08-27 03:53:08,349 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-08-27 03:53:08,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-08-27 03:53:08,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:08,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-08-27 03:53:08,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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 03:53:08,352 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 03:53:08,352 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 03:53:08,352 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 89 flow. Second operand 5 states and 515 transitions. [2023-08-27 03:53:08,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 90 transitions, 458 flow [2023-08-27 03:53:08,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 90 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:53:08,356 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 191 flow [2023-08-27 03:53:08,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-27 03:53:08,357 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-27 03:53:08,357 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 191 flow [2023-08-27 03:53:08,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:08,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:08,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:08,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:53:08,358 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:08,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1003674969, now seen corresponding path program 1 times [2023-08-27 03:53:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760030512] [2023-08-27 03:53:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:08,393 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 03:53:08,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:08,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760030512] [2023-08-27 03:53:08,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760030512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:08,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:08,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:53:08,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27519544] [2023-08-27 03:53:08,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:08,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:53:08,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:08,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:53:08,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:53:08,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 217 [2023-08-27 03:53:08,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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 03:53:08,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:08,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 217 [2023-08-27 03:53:08,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:08,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= v_~x$flush_delayed~0_23 0) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice2~0=v_~weak$$choice2~0_30, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_#t~nondet4, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet3, ~x~0][50], [16#L763true, 137#(<= ~__unbuffered_cnt~0 0), 100#L787true, 153#(<= ~__unbuffered_cnt~0 0), 27#L807true, Black: 140#true, 143#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 145#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 142#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), P1Thread1of1ForFork0InUse, 76#L851true, 129#(<= 0 ~__unbuffered_cnt~0), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse]) [2023-08-27 03:53:08,680 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is not cut-off event [2023-08-27 03:53:08,680 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-08-27 03:53:08,680 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-08-27 03:53:08,680 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-08-27 03:53:08,760 INFO L124 PetriNetUnfolderBase]: 2674/4021 cut-off events. [2023-08-27 03:53:08,760 INFO L125 PetriNetUnfolderBase]: For 3982/4003 co-relation queries the response was YES. [2023-08-27 03:53:08,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12136 conditions, 4021 events. 2674/4021 cut-off events. For 3982/4003 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 22120 event pairs, 679 based on Foata normal form. 11/3676 useless extension candidates. Maximal degree in co-relation 12123. Up to 1644 conditions per place. [2023-08-27 03:53:08,779 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 77 selfloop transitions, 7 changer transitions 0/90 dead transitions. [2023-08-27 03:53:08,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 90 transitions, 577 flow [2023-08-27 03:53:08,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:53:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:53:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-08-27 03:53:08,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011520737327189 [2023-08-27 03:53:08,781 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-08-27 03:53:08,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-08-27 03:53:08,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:08,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-08-27 03:53:08,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states 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 03:53:08,783 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 03:53:08,784 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 03:53:08,784 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 191 flow. Second operand 4 states and 435 transitions. [2023-08-27 03:53:08,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 90 transitions, 577 flow [2023-08-27 03:53:08,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 90 transitions, 577 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:53:08,787 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 235 flow [2023-08-27 03:53:08,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2023-08-27 03:53:08,787 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-27 03:53:08,787 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 235 flow [2023-08-27 03:53:08,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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 03:53:08,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:08,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:08,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:53:08,788 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:08,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1045392640, now seen corresponding path program 1 times [2023-08-27 03:53:08,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:08,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793772071] [2023-08-27 03:53:08,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:08,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:08,882 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 03:53:08,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:08,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793772071] [2023-08-27 03:53:08,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793772071] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:08,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:08,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:53:08,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581383875] [2023-08-27 03:53:08,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:08,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:53:08,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:08,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:53:08,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:53:08,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217 [2023-08-27 03:53:08,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:08,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:08,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217 [2023-08-27 03:53:08,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:09,306 INFO L124 PetriNetUnfolderBase]: 3079/4566 cut-off events. [2023-08-27 03:53:09,306 INFO L125 PetriNetUnfolderBase]: For 7431/7431 co-relation queries the response was YES. [2023-08-27 03:53:09,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15736 conditions, 4566 events. 3079/4566 cut-off events. For 7431/7431 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22788 event pairs, 264 based on Foata normal form. 130/4467 useless extension candidates. Maximal degree in co-relation 15720. Up to 1376 conditions per place. [2023-08-27 03:53:09,324 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 108 selfloop transitions, 22 changer transitions 6/136 dead transitions. [2023-08-27 03:53:09,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 136 transitions, 1007 flow [2023-08-27 03:53:09,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:53:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:53:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2023-08-27 03:53:09,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4628044766293614 [2023-08-27 03:53:09,326 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2023-08-27 03:53:09,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2023-08-27 03:53:09,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:09,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2023-08-27 03:53:09,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.42857142857143) internal successors, (703), 7 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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 03:53:09,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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 03:53:09,329 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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 03:53:09,329 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 235 flow. Second operand 7 states and 703 transitions. [2023-08-27 03:53:09,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 136 transitions, 1007 flow [2023-08-27 03:53:09,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 136 transitions, 941 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-27 03:53:09,334 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 425 flow [2023-08-27 03:53:09,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=425, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2023-08-27 03:53:09,334 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2023-08-27 03:53:09,334 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 425 flow [2023-08-27 03:53:09,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:09,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:09,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:09,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:53:09,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:09,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:09,335 INFO L85 PathProgramCache]: Analyzing trace with hash 264478630, now seen corresponding path program 1 times [2023-08-27 03:53:09,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:09,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664171394] [2023-08-27 03:53:09,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:09,407 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 03:53:09,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:09,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664171394] [2023-08-27 03:53:09,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664171394] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:09,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:09,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:53:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025014264] [2023-08-27 03:53:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:09,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:53:09,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:09,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:53:09,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:53:09,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217 [2023-08-27 03:53:09,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 425 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:09,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:09,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217 [2023-08-27 03:53:09,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:09,889 INFO L124 PetriNetUnfolderBase]: 3098/4606 cut-off events. [2023-08-27 03:53:09,889 INFO L125 PetriNetUnfolderBase]: For 13547/13547 co-relation queries the response was YES. [2023-08-27 03:53:09,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17699 conditions, 4606 events. 3098/4606 cut-off events. For 13547/13547 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 22923 event pairs, 491 based on Foata normal form. 105/4476 useless extension candidates. Maximal degree in co-relation 17677. Up to 981 conditions per place. [2023-08-27 03:53:09,908 INFO L140 encePairwiseOnDemand]: 209/217 looper letters, 125 selfloop transitions, 24 changer transitions 6/155 dead transitions. [2023-08-27 03:53:09,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 155 transitions, 1299 flow [2023-08-27 03:53:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:53:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:53:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 701 transitions. [2023-08-27 03:53:09,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46148782093482554 [2023-08-27 03:53:09,910 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 701 transitions. [2023-08-27 03:53:09,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 701 transitions. [2023-08-27 03:53:09,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:09,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 701 transitions. [2023-08-27 03:53:09,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.14285714285714) internal successors, (701), 7 states have internal predecessors, (701), 0 states have call successors, (0), 0 states 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 03:53:09,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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 03:53:09,913 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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 03:53:09,913 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 425 flow. Second operand 7 states and 701 transitions. [2023-08-27 03:53:09,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 155 transitions, 1299 flow [2023-08-27 03:53:09,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 155 transitions, 1299 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:53:09,948 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 705 flow [2023-08-27 03:53:09,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=705, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2023-08-27 03:53:09,948 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-08-27 03:53:09,949 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 705 flow [2023-08-27 03:53:09,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:09,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:09,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:09,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:53:09,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:09,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:09,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1803651184, now seen corresponding path program 1 times [2023-08-27 03:53:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:09,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979127688] [2023-08-27 03:53:09,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:09,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:10,014 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 03:53:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:10,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979127688] [2023-08-27 03:53:10,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979127688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:10,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:10,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:53:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070949104] [2023-08-27 03:53:10,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:10,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:53:10,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:10,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:53:10,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:53:10,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217 [2023-08-27 03:53:10,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 705 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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 03:53:10,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:10,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217 [2023-08-27 03:53:10,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:10,598 INFO L124 PetriNetUnfolderBase]: 4268/6409 cut-off events. [2023-08-27 03:53:10,598 INFO L125 PetriNetUnfolderBase]: For 27087/27087 co-relation queries the response was YES. [2023-08-27 03:53:10,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26479 conditions, 6409 events. 4268/6409 cut-off events. For 27087/27087 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 34943 event pairs, 556 based on Foata normal form. 78/6123 useless extension candidates. Maximal degree in co-relation 26449. Up to 1845 conditions per place. [2023-08-27 03:53:10,631 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 147 selfloop transitions, 27 changer transitions 9/183 dead transitions. [2023-08-27 03:53:10,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 183 transitions, 1839 flow [2023-08-27 03:53:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:53:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:53:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 717 transitions. [2023-08-27 03:53:10,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720210664911126 [2023-08-27 03:53:10,633 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 717 transitions. [2023-08-27 03:53:10,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 717 transitions. [2023-08-27 03:53:10,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:10,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 717 transitions. [2023-08-27 03:53:10,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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 03:53:10,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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 03:53:10,636 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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 03:53:10,636 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 705 flow. Second operand 7 states and 717 transitions. [2023-08-27 03:53:10,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 183 transitions, 1839 flow [2023-08-27 03:53:10,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 183 transitions, 1826 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-27 03:53:10,730 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 1024 flow [2023-08-27 03:53:10,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1024, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2023-08-27 03:53:10,730 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2023-08-27 03:53:10,730 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 93 transitions, 1024 flow [2023-08-27 03:53:10,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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 03:53:10,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:10,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:10,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:53:10,731 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:10,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:10,731 INFO L85 PathProgramCache]: Analyzing trace with hash 731455478, now seen corresponding path program 1 times [2023-08-27 03:53:10,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:10,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633234982] [2023-08-27 03:53:10,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:10,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:10,821 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 03:53:10,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:10,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633234982] [2023-08-27 03:53:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633234982] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:10,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:53:10,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619926821] [2023-08-27 03:53:10,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:10,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:53:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:10,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:53:10,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:53:10,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217 [2023-08-27 03:53:10,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 93 transitions, 1024 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 03:53:10,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:10,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217 [2023-08-27 03:53:10,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:11,920 INFO L124 PetriNetUnfolderBase]: 6719/10288 cut-off events. [2023-08-27 03:53:11,921 INFO L125 PetriNetUnfolderBase]: For 47769/47769 co-relation queries the response was YES. [2023-08-27 03:53:11,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43862 conditions, 10288 events. 6719/10288 cut-off events. For 47769/47769 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 63394 event pairs, 915 based on Foata normal form. 75/9675 useless extension candidates. Maximal degree in co-relation 43826. Up to 2097 conditions per place. [2023-08-27 03:53:11,973 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 207 selfloop transitions, 90 changer transitions 24/321 dead transitions. [2023-08-27 03:53:11,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 321 transitions, 3171 flow [2023-08-27 03:53:11,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-27 03:53:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-27 03:53:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1311 transitions. [2023-08-27 03:53:11,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46472881956752926 [2023-08-27 03:53:11,976 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1311 transitions. [2023-08-27 03:53:11,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1311 transitions. [2023-08-27 03:53:11,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:11,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1311 transitions. [2023-08-27 03:53:11,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.84615384615384) internal successors, (1311), 13 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states 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 03:53:11,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 217.0) internal successors, (3038), 14 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states 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 03:53:11,982 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 217.0) internal successors, (3038), 14 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states 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 03:53:11,982 INFO L175 Difference]: Start difference. First operand has 80 places, 93 transitions, 1024 flow. Second operand 13 states and 1311 transitions. [2023-08-27 03:53:11,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 321 transitions, 3171 flow [2023-08-27 03:53:12,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 321 transitions, 3171 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:53:12,324 INFO L231 Difference]: Finished difference. Result has 102 places, 135 transitions, 1912 flow [2023-08-27 03:53:12,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1912, PETRI_PLACES=102, PETRI_TRANSITIONS=135} [2023-08-27 03:53:12,325 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 62 predicate places. [2023-08-27 03:53:12,325 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 135 transitions, 1912 flow [2023-08-27 03:53:12,325 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 03:53:12,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:12,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:12,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:53:12,326 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:12,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash 395972169, now seen corresponding path program 1 times [2023-08-27 03:53:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:12,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316196382] [2023-08-27 03:53:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:12,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:12,479 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 03:53:12,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:12,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316196382] [2023-08-27 03:53:12,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316196382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:12,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:12,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:53:12,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211997349] [2023-08-27 03:53:12,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:12,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:53:12,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:12,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:53:12,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:53:12,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-27 03:53:12,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 135 transitions, 1912 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states 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 03:53:12,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:12,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-27 03:53:12,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:13,199 INFO L124 PetriNetUnfolderBase]: 3887/6583 cut-off events. [2023-08-27 03:53:13,200 INFO L125 PetriNetUnfolderBase]: For 38888/38967 co-relation queries the response was YES. [2023-08-27 03:53:13,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28638 conditions, 6583 events. 3887/6583 cut-off events. For 38888/38967 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 45986 event pairs, 525 based on Foata normal form. 388/6258 useless extension candidates. Maximal degree in co-relation 28590. Up to 3527 conditions per place. [2023-08-27 03:53:13,304 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 135 selfloop transitions, 5 changer transitions 0/168 dead transitions. [2023-08-27 03:53:13,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 168 transitions, 2430 flow [2023-08-27 03:53:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:53:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:53:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2023-08-27 03:53:13,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4804147465437788 [2023-08-27 03:53:13,306 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 417 transitions. [2023-08-27 03:53:13,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 417 transitions. [2023-08-27 03:53:13,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:13,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 417 transitions. [2023-08-27 03:53:13,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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 03:53:13,308 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 03:53:13,308 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 03:53:13,308 INFO L175 Difference]: Start difference. First operand has 102 places, 135 transitions, 1912 flow. Second operand 4 states and 417 transitions. [2023-08-27 03:53:13,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 168 transitions, 2430 flow [2023-08-27 03:53:13,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 168 transitions, 2338 flow, removed 31 selfloop flow, removed 2 redundant places. [2023-08-27 03:53:13,441 INFO L231 Difference]: Finished difference. Result has 105 places, 122 transitions, 1612 flow [2023-08-27 03:53:13,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1586, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1612, PETRI_PLACES=105, PETRI_TRANSITIONS=122} [2023-08-27 03:53:13,442 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 65 predicate places. [2023-08-27 03:53:13,442 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 122 transitions, 1612 flow [2023-08-27 03:53:13,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states 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 03:53:13,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:13,442 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 03:53:13,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:53:13,443 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:13,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash 479231308, now seen corresponding path program 1 times [2023-08-27 03:53:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:13,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690988694] [2023-08-27 03:53:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:13,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:13,485 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 03:53:13,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:13,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690988694] [2023-08-27 03:53:13,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690988694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:13,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:13,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:53:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098228136] [2023-08-27 03:53:13,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:13,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:53:13,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:13,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:53:13,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:53:13,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 217 [2023-08-27 03:53:13,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 122 transitions, 1612 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:13,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:13,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 217 [2023-08-27 03:53:13,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:14,102 INFO L124 PetriNetUnfolderBase]: 3665/6079 cut-off events. [2023-08-27 03:53:14,102 INFO L125 PetriNetUnfolderBase]: For 39363/39443 co-relation queries the response was YES. [2023-08-27 03:53:14,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27723 conditions, 6079 events. 3665/6079 cut-off events. For 39363/39443 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 41093 event pairs, 505 based on Foata normal form. 26/6027 useless extension candidates. Maximal degree in co-relation 27672. Up to 2745 conditions per place. [2023-08-27 03:53:14,124 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 42 selfloop transitions, 10 changer transitions 170/230 dead transitions. [2023-08-27 03:53:14,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 230 transitions, 3449 flow [2023-08-27 03:53:14,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:53:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:53:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2023-08-27 03:53:14,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-27 03:53:14,130 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2023-08-27 03:53:14,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2023-08-27 03:53:14,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:14,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2023-08-27 03:53:14,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states 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 03:53:14,132 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 03:53:14,132 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 03:53:14,132 INFO L175 Difference]: Start difference. First operand has 105 places, 122 transitions, 1612 flow. Second operand 5 states and 527 transitions. [2023-08-27 03:53:14,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 230 transitions, 3449 flow [2023-08-27 03:53:14,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 230 transitions, 3439 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 03:53:14,238 INFO L231 Difference]: Finished difference. Result has 104 places, 39 transitions, 389 flow [2023-08-27 03:53:14,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1586, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=389, PETRI_PLACES=104, PETRI_TRANSITIONS=39} [2023-08-27 03:53:14,239 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 64 predicate places. [2023-08-27 03:53:14,239 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 39 transitions, 389 flow [2023-08-27 03:53:14,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:14,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:14,239 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 03:53:14,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:53:14,239 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:14,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1246561330, now seen corresponding path program 1 times [2023-08-27 03:53:14,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:14,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18291685] [2023-08-27 03:53:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:14,348 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 03:53:14,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:14,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18291685] [2023-08-27 03:53:14,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18291685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:14,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:14,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:53:14,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545013856] [2023-08-27 03:53:14,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:14,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:53:14,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:14,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:53:14,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:53:14,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217 [2023-08-27 03:53:14,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 39 transitions, 389 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 03:53:14,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:14,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217 [2023-08-27 03:53:14,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:14,626 INFO L124 PetriNetUnfolderBase]: 1318/2202 cut-off events. [2023-08-27 03:53:14,626 INFO L125 PetriNetUnfolderBase]: For 13006/13006 co-relation queries the response was YES. [2023-08-27 03:53:14,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10019 conditions, 2202 events. 1318/2202 cut-off events. For 13006/13006 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11938 event pairs, 387 based on Foata normal form. 14/2216 useless extension candidates. Maximal degree in co-relation 9983. Up to 958 conditions per place. [2023-08-27 03:53:14,634 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 35 selfloop transitions, 3 changer transitions 42/80 dead transitions. [2023-08-27 03:53:14,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 80 transitions, 784 flow [2023-08-27 03:53:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:53:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:53:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-08-27 03:53:14,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4534562211981567 [2023-08-27 03:53:14,636 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-08-27 03:53:14,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-08-27 03:53:14,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:14,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-08-27 03:53:14,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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 03:53:14,639 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 03:53:14,639 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 03:53:14,639 INFO L175 Difference]: Start difference. First operand has 104 places, 39 transitions, 389 flow. Second operand 5 states and 492 transitions. [2023-08-27 03:53:14,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 80 transitions, 784 flow [2023-08-27 03:53:14,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 576 flow, removed 38 selfloop flow, removed 28 redundant places. [2023-08-27 03:53:14,659 INFO L231 Difference]: Finished difference. Result has 64 places, 27 transitions, 156 flow [2023-08-27 03:53:14,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=27} [2023-08-27 03:53:14,659 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-08-27 03:53:14,660 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 27 transitions, 156 flow [2023-08-27 03:53:14,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 03:53:14,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:14,660 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 03:53:14,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:53:14,660 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:14,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:14,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1983624860, now seen corresponding path program 2 times [2023-08-27 03:53:14,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:14,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693495388] [2023-08-27 03:53:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:14,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:14,773 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 03:53:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:14,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693495388] [2023-08-27 03:53:14,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693495388] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:14,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:14,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:53:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982239782] [2023-08-27 03:53:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:14,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:53:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:14,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:53:14,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:53:14,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217 [2023-08-27 03:53:14,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 27 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 0 states have call successors, (0), 0 states 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 03:53:14,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:14,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217 [2023-08-27 03:53:14,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:14,909 INFO L124 PetriNetUnfolderBase]: 347/604 cut-off events. [2023-08-27 03:53:14,909 INFO L125 PetriNetUnfolderBase]: For 1737/1737 co-relation queries the response was YES. [2023-08-27 03:53:14,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 604 events. 347/604 cut-off events. For 1737/1737 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2440 event pairs, 118 based on Foata normal form. 19/623 useless extension candidates. Maximal degree in co-relation 2293. Up to 270 conditions per place. [2023-08-27 03:53:14,911 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 37 selfloop transitions, 4 changer transitions 23/64 dead transitions. [2023-08-27 03:53:14,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 463 flow [2023-08-27 03:53:14,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:53:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:53:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2023-08-27 03:53:14,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377880184331797 [2023-08-27 03:53:14,913 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 570 transitions. [2023-08-27 03:53:14,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions. [2023-08-27 03:53:14,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:14,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions. [2023-08-27 03:53:14,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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 03:53:14,917 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 03:53:14,918 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 03:53:14,918 INFO L175 Difference]: Start difference. First operand has 64 places, 27 transitions, 156 flow. Second operand 6 states and 570 transitions. [2023-08-27 03:53:14,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 463 flow [2023-08-27 03:53:14,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 364 flow, removed 17 selfloop flow, removed 19 redundant places. [2023-08-27 03:53:14,920 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 116 flow [2023-08-27 03:53:14,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-27 03:53:14,921 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-27 03:53:14,921 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 116 flow [2023-08-27 03:53:14,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 0 states have call successors, (0), 0 states 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 03:53:14,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:14,922 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 03:53:14,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:53:14,922 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:14,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1051356528, now seen corresponding path program 1 times [2023-08-27 03:53:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:14,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867597863] [2023-08-27 03:53:14,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:15,074 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 03:53:15,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:15,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867597863] [2023-08-27 03:53:15,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867597863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:15,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:15,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:53:15,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132038146] [2023-08-27 03:53:15,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:15,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:53:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:53:15,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:53:15,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-27 03:53:15,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states 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 03:53:15,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:15,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-27 03:53:15,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:15,151 INFO L124 PetriNetUnfolderBase]: 106/215 cut-off events. [2023-08-27 03:53:15,152 INFO L125 PetriNetUnfolderBase]: For 151/153 co-relation queries the response was YES. [2023-08-27 03:53:15,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 215 events. 106/215 cut-off events. For 151/153 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 704 event pairs, 14 based on Foata normal form. 25/239 useless extension candidates. Maximal degree in co-relation 639. Up to 76 conditions per place. [2023-08-27 03:53:15,152 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 35 selfloop transitions, 8 changer transitions 1/46 dead transitions. [2023-08-27 03:53:15,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 280 flow [2023-08-27 03:53:15,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:53:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:53:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-08-27 03:53:15,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46175115207373274 [2023-08-27 03:53:15,154 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-08-27 03:53:15,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-08-27 03:53:15,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:15,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-08-27 03:53:15,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states 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 03:53:15,157 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 03:53:15,157 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 03:53:15,157 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 116 flow. Second operand 5 states and 501 transitions. [2023-08-27 03:53:15,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 280 flow [2023-08-27 03:53:15,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 245 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-27 03:53:15,158 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 124 flow [2023-08-27 03:53:15,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2023-08-27 03:53:15,159 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-27 03:53:15,159 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 124 flow [2023-08-27 03:53:15,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states 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 03:53:15,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:15,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:15,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:53:15,159 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:15,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1459871129, now seen corresponding path program 1 times [2023-08-27 03:53:15,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:15,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821979679] [2023-08-27 03:53:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:15,299 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 03:53:15,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:15,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821979679] [2023-08-27 03:53:15,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821979679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:15,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:15,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:53:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079012738] [2023-08-27 03:53:15,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:15,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:53:15,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:15,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:53:15,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:53:15,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2023-08-27 03:53:15,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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 03:53:15,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:15,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2023-08-27 03:53:15,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:15,375 INFO L124 PetriNetUnfolderBase]: 54/120 cut-off events. [2023-08-27 03:53:15,375 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-08-27 03:53:15,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 120 events. 54/120 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 310 event pairs, 14 based on Foata normal form. 8/127 useless extension candidates. Maximal degree in co-relation 413. Up to 40 conditions per place. [2023-08-27 03:53:15,375 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 25 selfloop transitions, 11 changer transitions 1/39 dead transitions. [2023-08-27 03:53:15,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 39 transitions, 241 flow [2023-08-27 03:53:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:53:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:53:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2023-08-27 03:53:15,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44930875576036866 [2023-08-27 03:53:15,377 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 585 transitions. [2023-08-27 03:53:15,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 585 transitions. [2023-08-27 03:53:15,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:15,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 585 transitions. [2023-08-27 03:53:15,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:15,380 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 03:53:15,380 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 03:53:15,380 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 124 flow. Second operand 6 states and 585 transitions. [2023-08-27 03:53:15,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 39 transitions, 241 flow [2023-08-27 03:53:15,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 184 flow, removed 10 selfloop flow, removed 9 redundant places. [2023-08-27 03:53:15,381 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 118 flow [2023-08-27 03:53:15,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2023-08-27 03:53:15,382 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-27 03:53:15,382 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 118 flow [2023-08-27 03:53:15,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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 03:53:15,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:15,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:15,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:53:15,383 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:15,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:15,383 INFO L85 PathProgramCache]: Analyzing trace with hash -850319362, now seen corresponding path program 1 times [2023-08-27 03:53:15,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:15,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363967269] [2023-08-27 03:53:15,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:15,980 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 03:53:15,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:15,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363967269] [2023-08-27 03:53:15,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363967269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:15,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:15,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:53:15,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403654771] [2023-08-27 03:53:15,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:15,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:53:15,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:15,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:53:15,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:53:15,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 217 [2023-08-27 03:53:15,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 118 flow. Second operand has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states 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 03:53:15,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:15,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 217 [2023-08-27 03:53:15,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:16,169 INFO L124 PetriNetUnfolderBase]: 56/130 cut-off events. [2023-08-27 03:53:16,169 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2023-08-27 03:53:16,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 130 events. 56/130 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 340 event pairs, 12 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 413. Up to 41 conditions per place. [2023-08-27 03:53:16,169 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 26 selfloop transitions, 3 changer transitions 24/55 dead transitions. [2023-08-27 03:53:16,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 360 flow [2023-08-27 03:53:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:53:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:53:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 656 transitions. [2023-08-27 03:53:16,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318630678077683 [2023-08-27 03:53:16,171 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 656 transitions. [2023-08-27 03:53:16,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 656 transitions. [2023-08-27 03:53:16,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:16,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 656 transitions. [2023-08-27 03:53:16,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:16,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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 03:53:16,175 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states 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 03:53:16,175 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 118 flow. Second operand 7 states and 656 transitions. [2023-08-27 03:53:16,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 360 flow [2023-08-27 03:53:16,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 276 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-27 03:53:16,176 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 96 flow [2023-08-27 03:53:16,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2023-08-27 03:53:16,176 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-27 03:53:16,176 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 96 flow [2023-08-27 03:53:16,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states 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 03:53:16,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:16,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:16,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:53:16,177 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:16,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash 61520152, now seen corresponding path program 2 times [2023-08-27 03:53:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:16,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962961705] [2023-08-27 03:53:16,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:16,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:53:16,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:53:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:53:16,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:53:16,250 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:53:16,250 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 03:53:16,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 03:53:16,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 03:53:16,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (14 of 18 remaining) [2023-08-27 03:53:16,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 03:53:16,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 03:53:16,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 03:53:16,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 03:53:16,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 03:53:16,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 03:53:16,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 03:53:16,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 03:53:16,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 03:53:16,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (4 of 18 remaining) [2023-08-27 03:53:16,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 03:53:16,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 03:53:16,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 03:53:16,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 03:53:16,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 03:53:16,256 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:16,259 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:53:16,259 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:53:16,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:53:16 BasicIcfg [2023-08-27 03:53:16,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:53:16,319 INFO L158 Benchmark]: Toolchain (without parser) took 13648.15ms. Allocated memory was 392.2MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 365.5MB in the beginning and 1.8GB in the end (delta: -1.4GB). Peak memory consumption was 839.1MB. Max. memory is 16.0GB. [2023-08-27 03:53:16,319 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 392.2MB. Free memory was 369.6MB in the beginning and 369.5MB in the end (delta: 94.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:53:16,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.26ms. Allocated memory is still 392.2MB. Free memory was 365.5MB in the beginning and 342.4MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:53:16,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.13ms. Allocated memory is still 392.2MB. Free memory was 342.4MB in the beginning and 340.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:53:16,320 INFO L158 Benchmark]: Boogie Preprocessor took 24.21ms. Allocated memory is still 392.2MB. Free memory was 340.3MB in the beginning and 338.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:53:16,320 INFO L158 Benchmark]: RCFGBuilder took 483.57ms. Allocated memory is still 392.2MB. Free memory was 338.4MB in the beginning and 301.9MB in the end (delta: 36.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-27 03:53:16,320 INFO L158 Benchmark]: TraceAbstraction took 12752.32ms. Allocated memory was 392.2MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 301.3MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 774.1MB. Max. memory is 16.0GB. [2023-08-27 03:53:16,325 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 392.2MB. Free memory was 369.6MB in the beginning and 369.5MB in the end (delta: 94.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 324.26ms. Allocated memory is still 392.2MB. Free memory was 365.5MB in the beginning and 342.4MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.13ms. Allocated memory is still 392.2MB. Free memory was 342.4MB in the beginning and 340.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.21ms. Allocated memory is still 392.2MB. Free memory was 340.3MB in the beginning and 338.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 483.57ms. Allocated memory is still 392.2MB. Free memory was 338.4MB in the beginning and 301.9MB in the end (delta: 36.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 12752.32ms. Allocated memory was 392.2MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 301.3MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 774.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 121 PlacesBefore, 40 PlacesAfterwards, 114 TransitionsBefore, 31 TransitionsAfterwards, 2630 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, 8609 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2953, independent: 2716, independent conditional: 0, independent unconditional: 2716, dependent: 237, dependent conditional: 0, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1316, independent: 1277, independent conditional: 0, independent unconditional: 1277, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2953, independent: 1439, independent conditional: 0, independent unconditional: 1439, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 1316, unknown conditional: 0, unknown unconditional: 1316] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1897, ((void *)0), P0, ((void *)0))=-3, t1897={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1898, ((void *)0), P1, ((void *)0))=-2, t1897={5:0}, t1898={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1899, ((void *)0), P2, ((void *)0))=-1, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L816] EXPR 3 __unbuffered_cnt + 1 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L767] EXPR 1 __unbuffered_cnt + 1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L796] EXPR 2 __unbuffered_cnt + 1 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={66:67}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - 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: 18]: 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 integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 685 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 685 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1611 IncrementalHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 21 mSDtfsCounter, 1611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1912occurred in iteration=9, InterpolantAutomatonStates: 90, 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.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 1182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 03:53:16,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...