/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_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 10:15:11,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:15:11,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 10:15:11,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:15:11,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:15:11,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:15:11,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:15:11,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:15:11,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:15:11,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:15:11,686 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:15:11,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:15:11,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:15:11,687 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:15:11,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:15:11,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:15:11,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:15:11,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:15:11,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:15:11,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:15:11,689 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:15:11,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:15:11,690 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:15:11,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:15:11,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:15:11,691 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:15:11,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:15:11,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:15:11,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:15:11,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:15:11,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:15:11,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:15:11,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:15:11,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:15:11,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:15:11,694 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:15:12,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:15:12,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:15:12,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:15:12,053 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:15:12,054 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:15:12,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 10:15:13,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:15:13,572 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:15:13,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 10:15:13,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f084687e6/4c77c7b1bfdb4883ac1a2df849643d6f/FLAGe18116b50 [2023-08-27 10:15:13,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f084687e6/4c77c7b1bfdb4883ac1a2df849643d6f [2023-08-27 10:15:13,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:15:13,601 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:15:13,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:15:13,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:15:13,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:15:13,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:15:13" (1/1) ... [2023-08-27 10:15:13,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a02e9ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:13, skipping insertion in model container [2023-08-27 10:15:13,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:15:13" (1/1) ... [2023-08-27 10:15:13,662 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:15:14,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:15:14,028 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:15:14,049 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:15:14,051 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:15:14,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:15:14,108 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:15:14,109 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:15:14,114 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:15:14,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14 WrapperNode [2023-08-27 10:15:14,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:15:14,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:15:14,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:15:14,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:15:14,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (1/1) ... [2023-08-27 10:15:14,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (1/1) ... [2023-08-27 10:15:14,177 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2023-08-27 10:15:14,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:15:14,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:15:14,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:15:14,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:15:14,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (1/1) ... [2023-08-27 10:15:14,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (1/1) ... [2023-08-27 10:15:14,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (1/1) ... [2023-08-27 10:15:14,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (1/1) ... [2023-08-27 10:15:14,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (1/1) ... [2023-08-27 10:15:14,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (1/1) ... [2023-08-27 10:15:14,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (1/1) ... [2023-08-27 10:15:14,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (1/1) ... [2023-08-27 10:15:14,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:15:14,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:15:14,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:15:14,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:15:14,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (1/1) ... [2023-08-27 10:15:14,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:15:14,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:15:14,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 10:15:14,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 10:15:14,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:15:14,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:15:14,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:15:14,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:15:14,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:15:14,280 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:15:14,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:15:14,280 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:15:14,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:15:14,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:15:14,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:15:14,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:15:14,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:15:14,282 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:15:14,391 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:15:14,393 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:15:14,677 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:15:14,824 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:15:14,824 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:15:14,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:15:14 BoogieIcfgContainer [2023-08-27 10:15:14,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:15:14,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:15:14,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:15:14,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:15:14,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:15:13" (1/3) ... [2023-08-27 10:15:14,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c7bbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:15:14, skipping insertion in model container [2023-08-27 10:15:14,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:14" (2/3) ... [2023-08-27 10:15:14,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c7bbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:15:14, skipping insertion in model container [2023-08-27 10:15:14,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:15:14" (3/3) ... [2023-08-27 10:15:14,835 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 10:15:14,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:15:14,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-27 10:15:14,852 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:15:14,905 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:15:14,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 200 flow [2023-08-27 10:15:15,003 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events. [2023-08-27 10:15:15,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:15:15,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 3/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-27 10:15:15,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 95 transitions, 200 flow [2023-08-27 10:15:15,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 93 transitions, 192 flow [2023-08-27 10:15:15,018 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:15:15,028 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 93 transitions, 192 flow [2023-08-27 10:15:15,030 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 93 transitions, 192 flow [2023-08-27 10:15:15,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 93 transitions, 192 flow [2023-08-27 10:15:15,080 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events. [2023-08-27 10:15:15,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:15:15,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 3/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-27 10:15:15,083 INFO L119 LiptonReduction]: Number of co-enabled transitions 1498 [2023-08-27 10:15:19,178 INFO L134 LiptonReduction]: Checked pairs total: 5057 [2023-08-27 10:15:19,179 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-27 10:15:19,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:15:19,198 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;@2ad82880, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:15:19,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-27 10:15:19,200 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:15:19,200 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 10:15:19,200 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:15:19,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:19,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 10:15:19,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:19,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 453969, now seen corresponding path program 1 times [2023-08-27 10:15:19,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:19,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135061157] [2023-08-27 10:15:19,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:19,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:15:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135061157] [2023-08-27 10:15:19,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135061157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:19,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:19,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:15:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906062042] [2023-08-27 10:15:19,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:19,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:15:19,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:19,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:15:19,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:15:19,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 187 [2023-08-27 10:15:19,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:19,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:19,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 187 [2023-08-27 10:15:19,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:19,752 INFO L124 PetriNetUnfolderBase]: 184/376 cut-off events. [2023-08-27 10:15:19,752 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-27 10:15:19,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 376 events. 184/376 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1897 event pairs, 16 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 702. Up to 277 conditions per place. [2023-08-27 10:15:19,759 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 24 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-27 10:15:19,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 30 transitions, 121 flow [2023-08-27 10:15:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:15:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:15:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2023-08-27 10:15:19,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46524064171123 [2023-08-27 10:15:19,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 261 transitions. [2023-08-27 10:15:19,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 261 transitions. [2023-08-27 10:15:19,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:19,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 261 transitions. [2023-08-27 10:15:19,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:19,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:19,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:19,795 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 48 flow. Second operand 3 states and 261 transitions. [2023-08-27 10:15:19,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 30 transitions, 121 flow [2023-08-27 10:15:19,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:15:19,798 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 48 flow [2023-08-27 10:15:19,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2023-08-27 10:15:19,804 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2023-08-27 10:15:19,805 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 48 flow [2023-08-27 10:15:19,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:19,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:19,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:15:19,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:15:19,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:19,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash 639638161, now seen corresponding path program 1 times [2023-08-27 10:15:19,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:19,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282751353] [2023-08-27 10:15:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:19,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:15:19,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:19,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282751353] [2023-08-27 10:15:19,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282751353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:19,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:19,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:15:19,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648903357] [2023-08-27 10:15:19,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:19,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:15:19,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:19,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:15:19,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:15:19,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2023-08-27 10:15:19,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:19,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:19,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2023-08-27 10:15:19,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:20,021 INFO L124 PetriNetUnfolderBase]: 127/240 cut-off events. [2023-08-27 10:15:20,021 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-27 10:15:20,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 240 events. 127/240 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 929 event pairs, 56 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 502. Up to 129 conditions per place. [2023-08-27 10:15:20,026 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-08-27 10:15:20,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 136 flow [2023-08-27 10:15:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:15:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:15:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2023-08-27 10:15:20,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46167557932263814 [2023-08-27 10:15:20,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2023-08-27 10:15:20,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2023-08-27 10:15:20,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:20,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2023-08-27 10:15:20,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:20,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:20,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:20,033 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 48 flow. Second operand 3 states and 259 transitions. [2023-08-27 10:15:20,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 136 flow [2023-08-27 10:15:20,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:15:20,035 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 69 flow [2023-08-27 10:15:20,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-08-27 10:15:20,037 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2023-08-27 10:15:20,037 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 69 flow [2023-08-27 10:15:20,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:20,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:20,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:20,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:15:20,042 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:20,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1614074001, now seen corresponding path program 1 times [2023-08-27 10:15:20,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:20,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448310827] [2023-08-27 10:15:20,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:20,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:15:20,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:20,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448310827] [2023-08-27 10:15:20,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448310827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:20,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:20,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:15:20,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866037953] [2023-08-27 10:15:20,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:20,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:15:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:15:20,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:15:20,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2023-08-27 10:15:20,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:20,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:20,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2023-08-27 10:15:20,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:20,400 INFO L124 PetriNetUnfolderBase]: 112/234 cut-off events. [2023-08-27 10:15:20,401 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-27 10:15:20,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 234 events. 112/234 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 956 event pairs, 25 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 536. Up to 168 conditions per place. [2023-08-27 10:15:20,403 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 22 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-08-27 10:15:20,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 132 flow [2023-08-27 10:15:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:15:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:15:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2023-08-27 10:15:20,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45276292335115864 [2023-08-27 10:15:20,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 254 transitions. [2023-08-27 10:15:20,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 254 transitions. [2023-08-27 10:15:20,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:20,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 254 transitions. [2023-08-27 10:15:20,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:20,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:20,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:20,410 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 69 flow. Second operand 3 states and 254 transitions. [2023-08-27 10:15:20,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 132 flow [2023-08-27 10:15:20,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:15:20,411 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 74 flow [2023-08-27 10:15:20,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-27 10:15:20,413 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2023-08-27 10:15:20,413 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 74 flow [2023-08-27 10:15:20,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:20,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:20,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:20,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:15:20,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:20,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:20,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1503312231, now seen corresponding path program 1 times [2023-08-27 10:15:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138389049] [2023-08-27 10:15:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:15:21,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:21,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138389049] [2023-08-27 10:15:21,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138389049] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:21,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:21,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:15:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732063512] [2023-08-27 10:15:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:21,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:15:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:15:21,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:15:21,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 187 [2023-08-27 10:15:21,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:21,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:21,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 187 [2023-08-27 10:15:21,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:21,439 INFO L124 PetriNetUnfolderBase]: 223/412 cut-off events. [2023-08-27 10:15:21,440 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-08-27 10:15:21,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 412 events. 223/412 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1770 event pairs, 16 based on Foata normal form. 6/406 useless extension candidates. Maximal degree in co-relation 973. Up to 222 conditions per place. [2023-08-27 10:15:21,442 INFO L140 encePairwiseOnDemand]: 178/187 looper letters, 39 selfloop transitions, 13 changer transitions 2/56 dead transitions. [2023-08-27 10:15:21,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 56 transitions, 281 flow [2023-08-27 10:15:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:15:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:15:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2023-08-27 10:15:21,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.413903743315508 [2023-08-27 10:15:21,444 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 387 transitions. [2023-08-27 10:15:21,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 387 transitions. [2023-08-27 10:15:21,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:21,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 387 transitions. [2023-08-27 10:15:21,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:21,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:21,448 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:21,448 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 74 flow. Second operand 5 states and 387 transitions. [2023-08-27 10:15:21,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 56 transitions, 281 flow [2023-08-27 10:15:21,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 56 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:15:21,452 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 170 flow [2023-08-27 10:15:21,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2023-08-27 10:15:21,453 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 8 predicate places. [2023-08-27 10:15:21,453 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 170 flow [2023-08-27 10:15:21,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:21,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:21,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:21,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:15:21,454 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:21,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:21,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1502225061, now seen corresponding path program 2 times [2023-08-27 10:15:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335629132] [2023-08-27 10:15:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:15:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335629132] [2023-08-27 10:15:21,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335629132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:21,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:21,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:15:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400405623] [2023-08-27 10:15:21,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:21,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:15:21,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:21,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:15:21,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:15:21,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2023-08-27 10:15:21,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 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 10:15:21,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:21,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2023-08-27 10:15:21,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:21,730 INFO L124 PetriNetUnfolderBase]: 204/432 cut-off events. [2023-08-27 10:15:21,730 INFO L125 PetriNetUnfolderBase]: For 476/479 co-relation queries the response was YES. [2023-08-27 10:15:21,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 432 events. 204/432 cut-off events. For 476/479 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2181 event pairs, 37 based on Foata normal form. 17/426 useless extension candidates. Maximal degree in co-relation 1437. Up to 166 conditions per place. [2023-08-27 10:15:21,733 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 44 selfloop transitions, 5 changer transitions 2/54 dead transitions. [2023-08-27 10:15:21,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 369 flow [2023-08-27 10:15:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:15:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:15:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 336 transitions. [2023-08-27 10:15:21,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44919786096256686 [2023-08-27 10:15:21,735 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 336 transitions. [2023-08-27 10:15:21,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 336 transitions. [2023-08-27 10:15:21,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:21,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 336 transitions. [2023-08-27 10:15:21,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:21,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:21,738 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:21,738 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 170 flow. Second operand 4 states and 336 transitions. [2023-08-27 10:15:21,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 369 flow [2023-08-27 10:15:21,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 369 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:15:21,741 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 200 flow [2023-08-27 10:15:21,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-27 10:15:21,742 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 13 predicate places. [2023-08-27 10:15:21,742 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 200 flow [2023-08-27 10:15:21,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 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 10:15:21,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:21,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:21,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:15:21,743 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:21,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1165232223, now seen corresponding path program 1 times [2023-08-27 10:15:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023768676] [2023-08-27 10:15:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:15:22,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:22,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023768676] [2023-08-27 10:15:22,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023768676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:22,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:22,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:15:22,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773176254] [2023-08-27 10:15:22,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:22,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:15:22,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:22,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:15:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:15:22,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 187 [2023-08-27 10:15:22,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:22,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 187 [2023-08-27 10:15:22,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:22,328 INFO L124 PetriNetUnfolderBase]: 256/505 cut-off events. [2023-08-27 10:15:22,329 INFO L125 PetriNetUnfolderBase]: For 644/657 co-relation queries the response was YES. [2023-08-27 10:15:22,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 505 events. 256/505 cut-off events. For 644/657 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2401 event pairs, 55 based on Foata normal form. 14/497 useless extension candidates. Maximal degree in co-relation 1742. Up to 421 conditions per place. [2023-08-27 10:15:22,333 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 48 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2023-08-27 10:15:22,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 440 flow [2023-08-27 10:15:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:15:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:15:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 330 transitions. [2023-08-27 10:15:22,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2023-08-27 10:15:22,335 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 330 transitions. [2023-08-27 10:15:22,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 330 transitions. [2023-08-27 10:15:22,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:22,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 330 transitions. [2023-08-27 10:15:22,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,338 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,338 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 200 flow. Second operand 4 states and 330 transitions. [2023-08-27 10:15:22,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 440 flow [2023-08-27 10:15:22,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:15:22,344 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 253 flow [2023-08-27 10:15:22,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2023-08-27 10:15:22,346 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 16 predicate places. [2023-08-27 10:15:22,346 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 253 flow [2023-08-27 10:15:22,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:22,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:22,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:15:22,347 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:22,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash 512333062, now seen corresponding path program 1 times [2023-08-27 10:15:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:22,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018989181] [2023-08-27 10:15:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:15:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:22,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018989181] [2023-08-27 10:15:22,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018989181] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:22,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:22,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:15:22,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153105695] [2023-08-27 10:15:22,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:22,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:15:22,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:22,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:15:22,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:15:22,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 187 [2023-08-27 10:15:22,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:22,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 187 [2023-08-27 10:15:22,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:22,639 INFO L124 PetriNetUnfolderBase]: 127/313 cut-off events. [2023-08-27 10:15:22,639 INFO L125 PetriNetUnfolderBase]: For 635/640 co-relation queries the response was YES. [2023-08-27 10:15:22,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 313 events. 127/313 cut-off events. For 635/640 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1608 event pairs, 40 based on Foata normal form. 47/307 useless extension candidates. Maximal degree in co-relation 1147. Up to 186 conditions per place. [2023-08-27 10:15:22,642 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 58 selfloop transitions, 6 changer transitions 2/71 dead transitions. [2023-08-27 10:15:22,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 572 flow [2023-08-27 10:15:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:15:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:15:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2023-08-27 10:15:22,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4385026737967914 [2023-08-27 10:15:22,644 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 410 transitions. [2023-08-27 10:15:22,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 410 transitions. [2023-08-27 10:15:22,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:22,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 410 transitions. [2023-08-27 10:15:22,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,647 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,647 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 253 flow. Second operand 5 states and 410 transitions. [2023-08-27 10:15:22,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 572 flow [2023-08-27 10:15:22,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 544 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-27 10:15:22,651 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 253 flow [2023-08-27 10:15:22,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-27 10:15:22,651 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 22 predicate places. [2023-08-27 10:15:22,652 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 253 flow [2023-08-27 10:15:22,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:22,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:22,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:15:22,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:22,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:22,653 INFO L85 PathProgramCache]: Analyzing trace with hash 349188465, now seen corresponding path program 1 times [2023-08-27 10:15:22,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:22,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145072427] [2023-08-27 10:15:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:22,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:15:22,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:22,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145072427] [2023-08-27 10:15:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145072427] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:22,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:22,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:15:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425112977] [2023-08-27 10:15:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:22,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:15:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:22,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:15:22,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:15:22,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2023-08-27 10:15:22,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:22,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2023-08-27 10:15:22,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:22,797 INFO L124 PetriNetUnfolderBase]: 112/274 cut-off events. [2023-08-27 10:15:22,797 INFO L125 PetriNetUnfolderBase]: For 615/618 co-relation queries the response was YES. [2023-08-27 10:15:22,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 274 events. 112/274 cut-off events. For 615/618 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1317 event pairs, 41 based on Foata normal form. 3/245 useless extension candidates. Maximal degree in co-relation 1116. Up to 177 conditions per place. [2023-08-27 10:15:22,799 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 36 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2023-08-27 10:15:22,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 376 flow [2023-08-27 10:15:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:15:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:15:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2023-08-27 10:15:22,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43716577540106955 [2023-08-27 10:15:22,801 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 327 transitions. [2023-08-27 10:15:22,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 327 transitions. [2023-08-27 10:15:22,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:22,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 327 transitions. [2023-08-27 10:15:22,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,804 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,804 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 253 flow. Second operand 4 states and 327 transitions. [2023-08-27 10:15:22,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 376 flow [2023-08-27 10:15:22,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:15:22,807 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 247 flow [2023-08-27 10:15:22,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-27 10:15:22,808 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 21 predicate places. [2023-08-27 10:15:22,808 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 247 flow [2023-08-27 10:15:22,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:22,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:22,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:15:22,809 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:22,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:22,809 INFO L85 PathProgramCache]: Analyzing trace with hash 349188466, now seen corresponding path program 1 times [2023-08-27 10:15:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:22,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260145256] [2023-08-27 10:15:22,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:15:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:22,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260145256] [2023-08-27 10:15:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260145256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:22,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:22,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:15:22,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362235012] [2023-08-27 10:15:22,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:22,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:15:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:22,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:15:22,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:15:22,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2023-08-27 10:15:22,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:22,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2023-08-27 10:15:22,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:22,935 INFO L124 PetriNetUnfolderBase]: 98/234 cut-off events. [2023-08-27 10:15:22,935 INFO L125 PetriNetUnfolderBase]: For 517/520 co-relation queries the response was YES. [2023-08-27 10:15:22,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 234 events. 98/234 cut-off events. For 517/520 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1080 event pairs, 20 based on Foata normal form. 3/231 useless extension candidates. Maximal degree in co-relation 986. Up to 104 conditions per place. [2023-08-27 10:15:22,936 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 19 selfloop transitions, 5 changer transitions 21/48 dead transitions. [2023-08-27 10:15:22,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 407 flow [2023-08-27 10:15:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:15:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:15:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2023-08-27 10:15:22,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43983957219251335 [2023-08-27 10:15:22,938 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 329 transitions. [2023-08-27 10:15:22,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 329 transitions. [2023-08-27 10:15:22,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:22,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 329 transitions. [2023-08-27 10:15:22,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,941 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,941 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 247 flow. Second operand 4 states and 329 transitions. [2023-08-27 10:15:22,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 407 flow [2023-08-27 10:15:22,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:15:22,943 INFO L231 Difference]: Finished difference. Result has 48 places, 19 transitions, 134 flow [2023-08-27 10:15:22,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=48, PETRI_TRANSITIONS=19} [2023-08-27 10:15:22,944 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 20 predicate places. [2023-08-27 10:15:22,944 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 19 transitions, 134 flow [2023-08-27 10:15:22,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:22,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:22,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:22,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:15:22,945 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:22,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash -323497379, now seen corresponding path program 1 times [2023-08-27 10:15:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:22,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514204430] [2023-08-27 10:15:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:22,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:15:23,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:23,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514204430] [2023-08-27 10:15:23,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514204430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:23,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:23,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:15:23,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004676677] [2023-08-27 10:15:23,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:23,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:15:23,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:23,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:15:23,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:15:23,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 187 [2023-08-27 10:15:23,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 19 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:23,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:23,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 187 [2023-08-27 10:15:23,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:23,145 INFO L124 PetriNetUnfolderBase]: 17/51 cut-off events. [2023-08-27 10:15:23,145 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2023-08-27 10:15:23,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 51 events. 17/51 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 5 based on Foata normal form. 6/56 useless extension candidates. Maximal degree in co-relation 214. Up to 21 conditions per place. [2023-08-27 10:15:23,146 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 16 selfloop transitions, 5 changer transitions 6/30 dead transitions. [2023-08-27 10:15:23,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 30 transitions, 248 flow [2023-08-27 10:15:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:15:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:15:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 466 transitions. [2023-08-27 10:15:23,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41532976827094475 [2023-08-27 10:15:23,148 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 466 transitions. [2023-08-27 10:15:23,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 466 transitions. [2023-08-27 10:15:23,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:23,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 466 transitions. [2023-08-27 10:15:23,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:23,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:23,152 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:23,152 INFO L175 Difference]: Start difference. First operand has 48 places, 19 transitions, 134 flow. Second operand 6 states and 466 transitions. [2023-08-27 10:15:23,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 30 transitions, 248 flow [2023-08-27 10:15:23,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 185 flow, removed 15 selfloop flow, removed 14 redundant places. [2023-08-27 10:15:23,153 INFO L231 Difference]: Finished difference. Result has 38 places, 19 transitions, 105 flow [2023-08-27 10:15:23,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=19} [2023-08-27 10:15:23,154 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 10 predicate places. [2023-08-27 10:15:23,154 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 19 transitions, 105 flow [2023-08-27 10:15:23,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:23,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:23,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:23,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:15:23,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:23,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1469761778, now seen corresponding path program 1 times [2023-08-27 10:15:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:23,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069083434] [2023-08-27 10:15:23,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:15:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:23,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069083434] [2023-08-27 10:15:23,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069083434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:23,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:23,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:15:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244711147] [2023-08-27 10:15:23,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:23,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:15:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:15:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:15:23,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 187 [2023-08-27 10:15:23,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 19 transitions, 105 flow. Second operand has 8 states, 8 states have (on average 71.75) internal successors, (574), 8 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:23,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:23,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 187 [2023-08-27 10:15:23,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:24,082 INFO L124 PetriNetUnfolderBase]: 15/54 cut-off events. [2023-08-27 10:15:24,082 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-08-27 10:15:24,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 54 events. 15/54 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 110 event pairs, 0 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 212. Up to 27 conditions per place. [2023-08-27 10:15:24,083 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 17 selfloop transitions, 3 changer transitions 12/33 dead transitions. [2023-08-27 10:15:24,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 249 flow [2023-08-27 10:15:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:15:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:15:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 448 transitions. [2023-08-27 10:15:24,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39928698752228164 [2023-08-27 10:15:24,085 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 448 transitions. [2023-08-27 10:15:24,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 448 transitions. [2023-08-27 10:15:24,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:24,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 448 transitions. [2023-08-27 10:15:24,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:24,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:24,089 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:24,089 INFO L175 Difference]: Start difference. First operand has 38 places, 19 transitions, 105 flow. Second operand 6 states and 448 transitions. [2023-08-27 10:15:24,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 249 flow [2023-08-27 10:15:24,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 211 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-08-27 10:15:24,090 INFO L231 Difference]: Finished difference. Result has 36 places, 17 transitions, 82 flow [2023-08-27 10:15:24,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=17} [2023-08-27 10:15:24,091 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 8 predicate places. [2023-08-27 10:15:24,091 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 17 transitions, 82 flow [2023-08-27 10:15:24,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.75) internal successors, (574), 8 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:24,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:24,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:24,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:15:24,092 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:15:24,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:24,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2123257228, now seen corresponding path program 2 times [2023-08-27 10:15:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:24,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763870371] [2023-08-27 10:15:24,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:24,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:15:24,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:15:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:15:24,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:15:24,168 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:15:24,169 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-27 10:15:24,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (11 of 13 remaining) [2023-08-27 10:15:24,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-27 10:15:24,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2023-08-27 10:15:24,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-27 10:15:24,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-27 10:15:24,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-27 10:15:24,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-27 10:15:24,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (4 of 13 remaining) [2023-08-27 10:15:24,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-27 10:15:24,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2023-08-27 10:15:24,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-27 10:15:24,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-27 10:15:24,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:15:24,172 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:24,176 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:15:24,176 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:15:24,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:15:24 BasicIcfg [2023-08-27 10:15:24,212 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:15:24,212 INFO L158 Benchmark]: Toolchain (without parser) took 10611.61ms. Allocated memory was 371.2MB in the beginning and 639.6MB in the end (delta: 268.4MB). Free memory was 345.7MB in the beginning and 326.6MB in the end (delta: 19.1MB). Peak memory consumption was 289.5MB. Max. memory is 16.0GB. [2023-08-27 10:15:24,213 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 371.2MB. Free memory is still 348.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:15:24,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.24ms. Allocated memory is still 371.2MB. Free memory was 345.7MB in the beginning and 322.8MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:15:24,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.60ms. Allocated memory is still 371.2MB. Free memory was 322.8MB in the beginning and 320.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:15:24,213 INFO L158 Benchmark]: Boogie Preprocessor took 29.20ms. Allocated memory is still 371.2MB. Free memory was 320.7MB in the beginning and 318.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:15:24,213 INFO L158 Benchmark]: RCFGBuilder took 619.08ms. Allocated memory is still 371.2MB. Free memory was 318.6MB in the beginning and 282.2MB in the end (delta: 36.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-27 10:15:24,214 INFO L158 Benchmark]: TraceAbstraction took 9383.07ms. Allocated memory was 371.2MB in the beginning and 639.6MB in the end (delta: 268.4MB). Free memory was 281.6MB in the beginning and 326.6MB in the end (delta: -45.0MB). Peak memory consumption was 226.6MB. Max. memory is 16.0GB. [2023-08-27 10:15:24,215 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.14ms. Allocated memory is still 371.2MB. Free memory is still 348.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 513.24ms. Allocated memory is still 371.2MB. Free memory was 345.7MB in the beginning and 322.8MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.60ms. Allocated memory is still 371.2MB. Free memory was 322.8MB in the beginning and 320.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.20ms. Allocated memory is still 371.2MB. Free memory was 320.7MB in the beginning and 318.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 619.08ms. Allocated memory is still 371.2MB. Free memory was 318.6MB in the beginning and 282.2MB in the end (delta: 36.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 9383.07ms. Allocated memory was 371.2MB in the beginning and 639.6MB in the end (delta: 268.4MB). Free memory was 281.6MB in the beginning and 326.6MB in the end (delta: -45.0MB). Peak memory consumption was 226.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 97 PlacesBefore, 28 PlacesAfterwards, 93 TransitionsBefore, 21 TransitionsAfterwards, 1498 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 5057 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2303, independent: 2098, independent conditional: 0, independent unconditional: 2098, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 867, independent: 830, independent conditional: 0, independent unconditional: 830, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2303, independent: 1268, independent conditional: 0, independent unconditional: 1268, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 867, unknown conditional: 0, unknown unconditional: 867] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2009, ((void *)0), P0, ((void *)0))=-2, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2010, ((void *)0), P1, ((void *)0))=-1, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L757] EXPR 1 __unbuffered_cnt + 1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L777] EXPR 2 __unbuffered_cnt + 1 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={66:67}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: 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 5 procedures, 116 locations, 13 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: 9.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 562 IncrementalHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 13 mSDtfsCounter, 562 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=6, InterpolantAutomatonStates: 47, 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, 2.9s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 10:15:24,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...