/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 09:59:42,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 09:59:43,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 09:59:43,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 09:59:43,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 09:59:43,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 09:59:43,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 09:59:43,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 09:59:43,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 09:59:43,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 09:59:43,054 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 09:59:43,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 09:59:43,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 09:59:43,054 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 09:59:43,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 09:59:43,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 09:59:43,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 09:59:43,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 09:59:43,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 09:59:43,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 09:59:43,056 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 09:59:43,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 09:59:43,057 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 09:59:43,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 09:59:43,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 09:59:43,057 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 09:59:43,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 09:59:43,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:59:43,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 09:59:43,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 09:59:43,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 09:59:43,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 09:59:43,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 09:59:43,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 09:59:43,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 09:59:43,059 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 09:59:43,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 09:59:43,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 09:59:43,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 09:59:43,292 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 09:59:43,292 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 09:59:43,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 09:59:44,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 09:59:44,586 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 09:59:44,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 09:59:44,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c85dc7a2/e3f186c9dc2a45f9be6334e8056f6248/FLAGa793b4bb5 [2023-08-27 09:59:44,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c85dc7a2/e3f186c9dc2a45f9be6334e8056f6248 [2023-08-27 09:59:44,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 09:59:44,609 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 09:59:44,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 09:59:44,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 09:59:44,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 09:59:44,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:59:44" (1/1) ... [2023-08-27 09:59:44,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118bd20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:44, skipping insertion in model container [2023-08-27 09:59:44,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:59:44" (1/1) ... [2023-08-27 09:59:44,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 09:59:44,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:59:44,958 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 09:59:44,983 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 09:59:44,985 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 09:59:45,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:59:45,023 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 09:59:45,023 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 09:59:45,028 INFO L206 MainTranslator]: Completed translation [2023-08-27 09:59:45,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45 WrapperNode [2023-08-27 09:59:45,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 09:59:45,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 09:59:45,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 09:59:45,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 09:59:45,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (1/1) ... [2023-08-27 09:59:45,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (1/1) ... [2023-08-27 09:59:45,084 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2023-08-27 09:59:45,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 09:59:45,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 09:59:45,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 09:59:45,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 09:59:45,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (1/1) ... [2023-08-27 09:59:45,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (1/1) ... [2023-08-27 09:59:45,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (1/1) ... [2023-08-27 09:59:45,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (1/1) ... [2023-08-27 09:59:45,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (1/1) ... [2023-08-27 09:59:45,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (1/1) ... [2023-08-27 09:59:45,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (1/1) ... [2023-08-27 09:59:45,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (1/1) ... [2023-08-27 09:59:45,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 09:59:45,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 09:59:45,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 09:59:45,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 09:59:45,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (1/1) ... [2023-08-27 09:59:45,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:59:45,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:59:45,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 09:59:45,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 09:59:45,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 09:59:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 09:59:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 09:59:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 09:59:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 09:59:45,217 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 09:59:45,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 09:59:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 09:59:45,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 09:59:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 09:59:45,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 09:59:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 09:59:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 09:59:45,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 09:59:45,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 09:59:45,220 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 09:59:45,340 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 09:59:45,341 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 09:59:45,637 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 09:59:45,716 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 09:59:45,716 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 09:59:45,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:59:45 BoogieIcfgContainer [2023-08-27 09:59:45,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 09:59:45,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 09:59:45,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 09:59:45,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 09:59:45,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:59:44" (1/3) ... [2023-08-27 09:59:45,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4717d377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:59:45, skipping insertion in model container [2023-08-27 09:59:45,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:59:45" (2/3) ... [2023-08-27 09:59:45,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4717d377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:59:45, skipping insertion in model container [2023-08-27 09:59:45,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:59:45" (3/3) ... [2023-08-27 09:59:45,726 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 09:59:45,759 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 09:59:45,759 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 09:59:45,759 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 09:59:45,792 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 09:59:45,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 122 transitions, 259 flow [2023-08-27 09:59:45,861 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-27 09:59:45,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:59:45,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-27 09:59:45,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 122 transitions, 259 flow [2023-08-27 09:59:45,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 119 transitions, 247 flow [2023-08-27 09:59:45,872 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 09:59:45,878 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-27 09:59:45,884 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-27 09:59:45,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 119 transitions, 247 flow [2023-08-27 09:59:45,916 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-27 09:59:45,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:59:45,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-27 09:59:45,919 INFO L119 LiptonReduction]: Number of co-enabled transitions 3000 [2023-08-27 09:59:48,864 INFO L134 LiptonReduction]: Checked pairs total: 11697 [2023-08-27 09:59:48,864 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-27 09:59:48,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 09:59:48,880 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;@1b12fa16, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 09:59:48,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 09:59:48,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 09:59:48,883 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 09:59:48,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:59:48,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:48,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 09:59:48,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:48,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:48,888 INFO L85 PathProgramCache]: Analyzing trace with hash 549678, now seen corresponding path program 1 times [2023-08-27 09:59:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:48,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867752199] [2023-08-27 09:59:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:49,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867752199] [2023-08-27 09:59:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867752199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:49,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 09:59:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595237470] [2023-08-27 09:59:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:49,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:59:49,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:49,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:59:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:59:49,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 230 [2023-08-27 09:59:49,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:49,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:49,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 230 [2023-08-27 09:59:49,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:49,657 INFO L124 PetriNetUnfolderBase]: 1764/2809 cut-off events. [2023-08-27 09:59:49,658 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-27 09:59:49,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5451 conditions, 2809 events. 1764/2809 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15407 event pairs, 872 based on Foata normal form. 0/2206 useless extension candidates. Maximal degree in co-relation 5440. Up to 2189 conditions per place. [2023-08-27 09:59:49,677 INFO L140 encePairwiseOnDemand]: 226/230 looper letters, 38 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-27 09:59:49,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 189 flow [2023-08-27 09:59:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:59:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:59:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-27 09:59:49,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014492753623189 [2023-08-27 09:59:49,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-27 09:59:49,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-27 09:59:49,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:49,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-27 09:59:49,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:49,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:49,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:49,701 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 3 states and 346 transitions. [2023-08-27 09:59:49,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 189 flow [2023-08-27 09:59:49,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 09:59:49,704 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 70 flow [2023-08-27 09:59:49,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-08-27 09:59:49,708 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-27 09:59:49,708 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2023-08-27 09:59:49,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:49,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:49,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 09:59:49,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 09:59:49,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:49,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash -803995785, now seen corresponding path program 1 times [2023-08-27 09:59:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:49,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981186200] [2023-08-27 09:59:49,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:49,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981186200] [2023-08-27 09:59:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981186200] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:49,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:49,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 09:59:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597409721] [2023-08-27 09:59:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:49,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:59:49,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:49,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:59:49,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:59:49,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 230 [2023-08-27 09:59:49,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:49,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:49,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 230 [2023-08-27 09:59:49,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:50,009 INFO L124 PetriNetUnfolderBase]: 1395/2159 cut-off events. [2023-08-27 09:59:50,010 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2023-08-27 09:59:50,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4477 conditions, 2159 events. 1395/2159 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10984 event pairs, 463 based on Foata normal form. 0/1646 useless extension candidates. Maximal degree in co-relation 4467. Up to 1562 conditions per place. [2023-08-27 09:59:50,018 INFO L140 encePairwiseOnDemand]: 220/230 looper letters, 40 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-08-27 09:59:50,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 200 flow [2023-08-27 09:59:50,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:59:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:59:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-27 09:59:50,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49420289855072463 [2023-08-27 09:59:50,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-27 09:59:50,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-27 09:59:50,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:50,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-27 09:59:50,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:50,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:50,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:50,025 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 3 states and 341 transitions. [2023-08-27 09:59:50,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 200 flow [2023-08-27 09:59:50,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:59:50,027 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 102 flow [2023-08-27 09:59:50,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-27 09:59:50,028 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-27 09:59:50,028 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 102 flow [2023-08-27 09:59:50,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:50,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:50,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:50,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 09:59:50,034 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:50,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:50,036 INFO L85 PathProgramCache]: Analyzing trace with hash 980777342, now seen corresponding path program 1 times [2023-08-27 09:59:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003431060] [2023-08-27 09:59:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:50,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003431060] [2023-08-27 09:59:50,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003431060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:50,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:50,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 09:59:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971104295] [2023-08-27 09:59:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:50,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:59:50,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:50,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:59:50,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:59:50,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 230 [2023-08-27 09:59:50,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:50,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:50,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 230 [2023-08-27 09:59:50,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:50,682 INFO L124 PetriNetUnfolderBase]: 3922/6109 cut-off events. [2023-08-27 09:59:50,682 INFO L125 PetriNetUnfolderBase]: For 538/581 co-relation queries the response was YES. [2023-08-27 09:59:50,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14357 conditions, 6109 events. 3922/6109 cut-off events. For 538/581 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 35063 event pairs, 1378 based on Foata normal form. 0/5442 useless extension candidates. Maximal degree in co-relation 14346. Up to 3620 conditions per place. [2023-08-27 09:59:50,712 INFO L140 encePairwiseOnDemand]: 221/230 looper letters, 47 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2023-08-27 09:59:50,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 285 flow [2023-08-27 09:59:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:59:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:59:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-08-27 09:59:50,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681159420289855 [2023-08-27 09:59:50,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-08-27 09:59:50,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-08-27 09:59:50,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:50,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-08-27 09:59:50,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:50,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:50,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:50,716 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 102 flow. Second operand 3 states and 323 transitions. [2023-08-27 09:59:50,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 285 flow [2023-08-27 09:59:50,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:59:50,719 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 160 flow [2023-08-27 09:59:50,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-08-27 09:59:50,720 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-27 09:59:50,720 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 160 flow [2023-08-27 09:59:50,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:50,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:50,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:50,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 09:59:50,724 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:50,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash 339325552, now seen corresponding path program 1 times [2023-08-27 09:59:50,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:50,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040685344] [2023-08-27 09:59:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:50,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:50,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040685344] [2023-08-27 09:59:50,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040685344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:50,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:50,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:59:50,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216478740] [2023-08-27 09:59:50,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:50,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:50,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:50,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:50,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:50,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 230 [2023-08-27 09:59:50,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:50,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:50,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 230 [2023-08-27 09:59:50,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:51,375 INFO L124 PetriNetUnfolderBase]: 3740/5849 cut-off events. [2023-08-27 09:59:51,376 INFO L125 PetriNetUnfolderBase]: For 2713/2752 co-relation queries the response was YES. [2023-08-27 09:59:51,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16144 conditions, 5849 events. 3740/5849 cut-off events. For 2713/2752 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 32985 event pairs, 959 based on Foata normal form. 54/5451 useless extension candidates. Maximal degree in co-relation 16130. Up to 2654 conditions per place. [2023-08-27 09:59:51,396 INFO L140 encePairwiseOnDemand]: 221/230 looper letters, 63 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2023-08-27 09:59:51,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 75 transitions, 432 flow [2023-08-27 09:59:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:59:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:59:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2023-08-27 09:59:51,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608695652173913 [2023-08-27 09:59:51,398 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 424 transitions. [2023-08-27 09:59:51,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 424 transitions. [2023-08-27 09:59:51,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:51,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 424 transitions. [2023-08-27 09:59:51,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:51,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:51,401 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:51,401 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 160 flow. Second operand 4 states and 424 transitions. [2023-08-27 09:59:51,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 75 transitions, 432 flow [2023-08-27 09:59:51,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 75 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:59:51,411 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 212 flow [2023-08-27 09:59:51,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-27 09:59:51,411 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-27 09:59:51,411 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 212 flow [2023-08-27 09:59:51,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:51,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:51,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:51,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 09:59:51,412 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:51,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1927618229, now seen corresponding path program 1 times [2023-08-27 09:59:51,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:51,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212708351] [2023-08-27 09:59:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:51,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:51,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:51,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212708351] [2023-08-27 09:59:51,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212708351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:51,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:51,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:59:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229420492] [2023-08-27 09:59:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:51,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:51,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:51,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 230 [2023-08-27 09:59:51,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:51,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:51,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 230 [2023-08-27 09:59:51,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:51,977 INFO L124 PetriNetUnfolderBase]: 3698/5789 cut-off events. [2023-08-27 09:59:51,977 INFO L125 PetriNetUnfolderBase]: For 4660/4691 co-relation queries the response was YES. [2023-08-27 09:59:51,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17016 conditions, 5789 events. 3698/5789 cut-off events. For 4660/4691 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 33022 event pairs, 802 based on Foata normal form. 8/5347 useless extension candidates. Maximal degree in co-relation 16999. Up to 3300 conditions per place. [2023-08-27 09:59:52,013 INFO L140 encePairwiseOnDemand]: 221/230 looper letters, 62 selfloop transitions, 18 changer transitions 0/83 dead transitions. [2023-08-27 09:59:52,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 83 transitions, 516 flow [2023-08-27 09:59:52,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:59:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:59:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2023-08-27 09:59:52,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46630434782608693 [2023-08-27 09:59:52,014 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 429 transitions. [2023-08-27 09:59:52,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 429 transitions. [2023-08-27 09:59:52,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:52,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 429 transitions. [2023-08-27 09:59:52,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:52,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:52,017 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:52,017 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 212 flow. Second operand 4 states and 429 transitions. [2023-08-27 09:59:52,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 83 transitions, 516 flow [2023-08-27 09:59:52,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:59:52,024 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 346 flow [2023-08-27 09:59:52,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=346, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2023-08-27 09:59:52,024 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-08-27 09:59:52,025 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 346 flow [2023-08-27 09:59:52,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:52,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:52,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:52,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 09:59:52,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:52,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash -373327803, now seen corresponding path program 1 times [2023-08-27 09:59:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:52,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409031043] [2023-08-27 09:59:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:52,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:52,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409031043] [2023-08-27 09:59:52,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409031043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:52,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:52,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:59:52,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165232756] [2023-08-27 09:59:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:52,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:52,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:52,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:52,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 230 [2023-08-27 09:59:52,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 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 09:59:52,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:52,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 230 [2023-08-27 09:59:52,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:52,546 INFO L124 PetriNetUnfolderBase]: 3591/5616 cut-off events. [2023-08-27 09:59:52,546 INFO L125 PetriNetUnfolderBase]: For 10188/10252 co-relation queries the response was YES. [2023-08-27 09:59:52,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18565 conditions, 5616 events. 3591/5616 cut-off events. For 10188/10252 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 31925 event pairs, 674 based on Foata normal form. 36/5203 useless extension candidates. Maximal degree in co-relation 18544. Up to 2551 conditions per place. [2023-08-27 09:59:52,569 INFO L140 encePairwiseOnDemand]: 222/230 looper letters, 80 selfloop transitions, 12 changer transitions 0/95 dead transitions. [2023-08-27 09:59:52,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 95 transitions, 716 flow [2023-08-27 09:59:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:59:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:59:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-08-27 09:59:52,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652173913043478 [2023-08-27 09:59:52,571 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-08-27 09:59:52,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-08-27 09:59:52,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:52,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-08-27 09:59:52,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:52,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:52,574 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:52,574 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 346 flow. Second operand 4 states and 428 transitions. [2023-08-27 09:59:52,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 95 transitions, 716 flow [2023-08-27 09:59:52,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 95 transitions, 716 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 09:59:52,595 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 475 flow [2023-08-27 09:59:52,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=475, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2023-08-27 09:59:52,597 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-08-27 09:59:52,597 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 475 flow [2023-08-27 09:59:52,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 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 09:59:52,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:52,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:52,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 09:59:52,597 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:52,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2084946245, now seen corresponding path program 1 times [2023-08-27 09:59:52,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:52,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925987013] [2023-08-27 09:59:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:52,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:52,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925987013] [2023-08-27 09:59:52,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925987013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:52,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:52,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:59:52,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530356006] [2023-08-27 09:59:52,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:52,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:52,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:52,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:52,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:52,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 230 [2023-08-27 09:59:52,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:52,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:52,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 230 [2023-08-27 09:59:52,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:53,108 INFO L124 PetriNetUnfolderBase]: 2640/4195 cut-off events. [2023-08-27 09:59:53,108 INFO L125 PetriNetUnfolderBase]: For 11398/11671 co-relation queries the response was YES. [2023-08-27 09:59:53,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14310 conditions, 4195 events. 2640/4195 cut-off events. For 11398/11671 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 24280 event pairs, 749 based on Foata normal form. 96/3839 useless extension candidates. Maximal degree in co-relation 14284. Up to 2513 conditions per place. [2023-08-27 09:59:53,140 INFO L140 encePairwiseOnDemand]: 223/230 looper letters, 61 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2023-08-27 09:59:53,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 781 flow [2023-08-27 09:59:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:59:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:59:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2023-08-27 09:59:53,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46956521739130436 [2023-08-27 09:59:53,143 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2023-08-27 09:59:53,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2023-08-27 09:59:53,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:53,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2023-08-27 09:59:53,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,146 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,146 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 475 flow. Second operand 4 states and 432 transitions. [2023-08-27 09:59:53,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 781 flow [2023-08-27 09:59:53,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 777 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:59:53,170 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 467 flow [2023-08-27 09:59:53,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=467, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2023-08-27 09:59:53,171 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-27 09:59:53,171 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 467 flow [2023-08-27 09:59:53,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:53,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:53,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 09:59:53,171 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:53,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1310180213, now seen corresponding path program 1 times [2023-08-27 09:59:53,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:53,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867986523] [2023-08-27 09:59:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:53,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:53,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867986523] [2023-08-27 09:59:53,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867986523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:53,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:59:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052424603] [2023-08-27 09:59:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:53,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:53,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:53,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 230 [2023-08-27 09:59:53,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 467 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:53,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 230 [2023-08-27 09:59:53,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:53,647 INFO L124 PetriNetUnfolderBase]: 1855/3218 cut-off events. [2023-08-27 09:59:53,647 INFO L125 PetriNetUnfolderBase]: For 7321/7461 co-relation queries the response was YES. [2023-08-27 09:59:53,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10734 conditions, 3218 events. 1855/3218 cut-off events. For 7321/7461 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 19623 event pairs, 502 based on Foata normal form. 352/3137 useless extension candidates. Maximal degree in co-relation 10707. Up to 2095 conditions per place. [2023-08-27 09:59:53,658 INFO L140 encePairwiseOnDemand]: 224/230 looper letters, 81 selfloop transitions, 8 changer transitions 0/106 dead transitions. [2023-08-27 09:59:53,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 106 transitions, 941 flow [2023-08-27 09:59:53,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 09:59:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 09:59:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-27 09:59:53,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4678260869565217 [2023-08-27 09:59:53,674 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-27 09:59:53,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-27 09:59:53,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:53,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-27 09:59:53,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,677 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,677 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 467 flow. Second operand 5 states and 538 transitions. [2023-08-27 09:59:53,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 106 transitions, 941 flow [2023-08-27 09:59:53,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 933 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:59:53,688 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 503 flow [2023-08-27 09:59:53,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=503, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2023-08-27 09:59:53,688 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-08-27 09:59:53,688 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 503 flow [2023-08-27 09:59:53,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:53,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:53,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 09:59:53,689 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:53,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:53,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1149801412, now seen corresponding path program 1 times [2023-08-27 09:59:53,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:53,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450902763] [2023-08-27 09:59:53,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:53,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:53,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450902763] [2023-08-27 09:59:53,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450902763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:53,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:53,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:59:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90359233] [2023-08-27 09:59:53,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:53,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 230 [2023-08-27 09:59:53,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 503 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:53,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 230 [2023-08-27 09:59:53,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:53,965 INFO L124 PetriNetUnfolderBase]: 1398/2442 cut-off events. [2023-08-27 09:59:53,965 INFO L125 PetriNetUnfolderBase]: For 6491/6648 co-relation queries the response was YES. [2023-08-27 09:59:53,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9250 conditions, 2442 events. 1398/2442 cut-off events. For 6491/6648 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14327 event pairs, 305 based on Foata normal form. 68/2416 useless extension candidates. Maximal degree in co-relation 9220. Up to 1144 conditions per place. [2023-08-27 09:59:53,977 INFO L140 encePairwiseOnDemand]: 223/230 looper letters, 69 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2023-08-27 09:59:53,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 887 flow [2023-08-27 09:59:53,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:59:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:59:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2023-08-27 09:59:53,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483695652173913 [2023-08-27 09:59:53,979 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 445 transitions. [2023-08-27 09:59:53,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 445 transitions. [2023-08-27 09:59:53,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:53,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 445 transitions. [2023-08-27 09:59:53,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,981 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,981 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 503 flow. Second operand 4 states and 445 transitions. [2023-08-27 09:59:53,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 887 flow [2023-08-27 09:59:53,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:59:53,994 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 545 flow [2023-08-27 09:59:53,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=545, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2023-08-27 09:59:53,995 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-27 09:59:53,995 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 545 flow [2023-08-27 09:59:53,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:53,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:53,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:53,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 09:59:53,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:53,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2059502541, now seen corresponding path program 1 times [2023-08-27 09:59:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:53,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192289622] [2023-08-27 09:59:53,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:53,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:54,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:54,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192289622] [2023-08-27 09:59:54,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192289622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:54,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:54,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:59:54,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62991718] [2023-08-27 09:59:54,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:54,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:59:54,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:54,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:59:54,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:59:54,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 230 [2023-08-27 09:59:54,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 545 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:54,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:54,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 230 [2023-08-27 09:59:54,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:54,390 INFO L124 PetriNetUnfolderBase]: 950/1745 cut-off events. [2023-08-27 09:59:54,390 INFO L125 PetriNetUnfolderBase]: For 4717/4774 co-relation queries the response was YES. [2023-08-27 09:59:54,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6845 conditions, 1745 events. 950/1745 cut-off events. For 4717/4774 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10297 event pairs, 149 based on Foata normal form. 155/1828 useless extension candidates. Maximal degree in co-relation 6814. Up to 444 conditions per place. [2023-08-27 09:59:54,398 INFO L140 encePairwiseOnDemand]: 224/230 looper letters, 95 selfloop transitions, 15 changer transitions 3/130 dead transitions. [2023-08-27 09:59:54,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 1162 flow [2023-08-27 09:59:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:59:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:59:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 751 transitions. [2023-08-27 09:59:54,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46645962732919255 [2023-08-27 09:59:54,400 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 751 transitions. [2023-08-27 09:59:54,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 751 transitions. [2023-08-27 09:59:54,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:54,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 751 transitions. [2023-08-27 09:59:54,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:54,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:54,405 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:54,405 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 545 flow. Second operand 7 states and 751 transitions. [2023-08-27 09:59:54,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 1162 flow [2023-08-27 09:59:54,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 130 transitions, 1092 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-27 09:59:54,420 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 541 flow [2023-08-27 09:59:54,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=541, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2023-08-27 09:59:54,421 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2023-08-27 09:59:54,421 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 541 flow [2023-08-27 09:59:54,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:54,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:54,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:54,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 09:59:54,422 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:54,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:54,422 INFO L85 PathProgramCache]: Analyzing trace with hash 215428077, now seen corresponding path program 1 times [2023-08-27 09:59:54,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:54,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088382074] [2023-08-27 09:59:54,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:54,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:54,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 09:59:54,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:54,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088382074] [2023-08-27 09:59:54,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088382074] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:54,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:54,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:59:54,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704390702] [2023-08-27 09:59:54,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:54,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:59:54,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:54,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:59:54,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:59:54,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 230 [2023-08-27 09:59:54,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 541 flow. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:54,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:54,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 230 [2023-08-27 09:59:54,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:54,896 INFO L124 PetriNetUnfolderBase]: 1622/2843 cut-off events. [2023-08-27 09:59:54,896 INFO L125 PetriNetUnfolderBase]: For 10840/10994 co-relation queries the response was YES. [2023-08-27 09:59:54,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12615 conditions, 2843 events. 1622/2843 cut-off events. For 10840/10994 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17092 event pairs, 313 based on Foata normal form. 65/2787 useless extension candidates. Maximal degree in co-relation 12582. Up to 1483 conditions per place. [2023-08-27 09:59:54,912 INFO L140 encePairwiseOnDemand]: 227/230 looper letters, 101 selfloop transitions, 4 changer transitions 2/117 dead transitions. [2023-08-27 09:59:54,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 117 transitions, 1186 flow [2023-08-27 09:59:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:59:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:59:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-08-27 09:59:54,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47282608695652173 [2023-08-27 09:59:54,913 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-08-27 09:59:54,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-08-27 09:59:54,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:54,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-08-27 09:59:54,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:54,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:54,916 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:54,916 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 541 flow. Second operand 4 states and 435 transitions. [2023-08-27 09:59:54,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 117 transitions, 1186 flow [2023-08-27 09:59:54,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 117 transitions, 1116 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-27 09:59:54,941 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 552 flow [2023-08-27 09:59:54,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=552, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2023-08-27 09:59:54,942 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-08-27 09:59:54,942 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 552 flow [2023-08-27 09:59:54,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:54,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:54,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:54,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 09:59:54,942 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:54,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash -425381203, now seen corresponding path program 2 times [2023-08-27 09:59:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:54,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323950304] [2023-08-27 09:59:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:54,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:55,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:55,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323950304] [2023-08-27 09:59:55,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323950304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:55,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:55,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 09:59:55,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072275282] [2023-08-27 09:59:55,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:55,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:59:55,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:55,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:59:55,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 09:59:55,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 230 [2023-08-27 09:59:55,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:55,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:55,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 230 [2023-08-27 09:59:55,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:55,461 INFO L124 PetriNetUnfolderBase]: 1220/2203 cut-off events. [2023-08-27 09:59:55,461 INFO L125 PetriNetUnfolderBase]: For 5394/5484 co-relation queries the response was YES. [2023-08-27 09:59:55,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8701 conditions, 2203 events. 1220/2203 cut-off events. For 5394/5484 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 13755 event pairs, 154 based on Foata normal form. 70/2236 useless extension candidates. Maximal degree in co-relation 8667. Up to 570 conditions per place. [2023-08-27 09:59:55,468 INFO L140 encePairwiseOnDemand]: 221/230 looper letters, 48 selfloop transitions, 17 changer transitions 46/124 dead transitions. [2023-08-27 09:59:55,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 124 transitions, 1095 flow [2023-08-27 09:59:55,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 09:59:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 09:59:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 942 transitions. [2023-08-27 09:59:55,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45507246376811594 [2023-08-27 09:59:55,470 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 942 transitions. [2023-08-27 09:59:55,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 942 transitions. [2023-08-27 09:59:55,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:55,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 942 transitions. [2023-08-27 09:59:55,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:55,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 230.0) internal successors, (2300), 10 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:55,474 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 230.0) internal successors, (2300), 10 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:55,475 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 552 flow. Second operand 9 states and 942 transitions. [2023-08-27 09:59:55,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 124 transitions, 1095 flow [2023-08-27 09:59:55,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 124 transitions, 1074 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-27 09:59:55,496 INFO L231 Difference]: Finished difference. Result has 76 places, 48 transitions, 401 flow [2023-08-27 09:59:55,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=401, PETRI_PLACES=76, PETRI_TRANSITIONS=48} [2023-08-27 09:59:55,497 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2023-08-27 09:59:55,497 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 48 transitions, 401 flow [2023-08-27 09:59:55,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:55,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:55,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:55,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 09:59:55,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:55,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash 574619081, now seen corresponding path program 1 times [2023-08-27 09:59:55,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:55,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9080362] [2023-08-27 09:59:55,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:55,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:56,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:56,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9080362] [2023-08-27 09:59:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9080362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:56,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:56,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 09:59:56,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731766807] [2023-08-27 09:59:56,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:56,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 09:59:56,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:56,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 09:59:56,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 09:59:56,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 230 [2023-08-27 09:59:56,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 48 transitions, 401 flow. Second operand has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:56,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:56,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 230 [2023-08-27 09:59:56,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:56,507 INFO L124 PetriNetUnfolderBase]: 1410/2798 cut-off events. [2023-08-27 09:59:56,508 INFO L125 PetriNetUnfolderBase]: For 10703/10811 co-relation queries the response was YES. [2023-08-27 09:59:56,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12276 conditions, 2798 events. 1410/2798 cut-off events. For 10703/10811 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 20341 event pairs, 284 based on Foata normal form. 1/2763 useless extension candidates. Maximal degree in co-relation 12240. Up to 1166 conditions per place. [2023-08-27 09:59:56,517 INFO L140 encePairwiseOnDemand]: 223/230 looper letters, 51 selfloop transitions, 6 changer transitions 66/133 dead transitions. [2023-08-27 09:59:56,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 133 transitions, 1303 flow [2023-08-27 09:59:56,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:59:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:59:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 622 transitions. [2023-08-27 09:59:56,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45072463768115945 [2023-08-27 09:59:56,519 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 622 transitions. [2023-08-27 09:59:56,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 622 transitions. [2023-08-27 09:59:56,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:56,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 622 transitions. [2023-08-27 09:59:56,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:56,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:56,523 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:56,523 INFO L175 Difference]: Start difference. First operand has 76 places, 48 transitions, 401 flow. Second operand 6 states and 622 transitions. [2023-08-27 09:59:56,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 133 transitions, 1303 flow [2023-08-27 09:59:56,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 133 transitions, 1056 flow, removed 37 selfloop flow, removed 10 redundant places. [2023-08-27 09:59:56,560 INFO L231 Difference]: Finished difference. Result has 72 places, 46 transitions, 337 flow [2023-08-27 09:59:56,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=337, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2023-08-27 09:59:56,561 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2023-08-27 09:59:56,561 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 46 transitions, 337 flow [2023-08-27 09:59:56,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:56,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:56,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:56,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 09:59:56,562 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:56,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:56,562 INFO L85 PathProgramCache]: Analyzing trace with hash 919302605, now seen corresponding path program 2 times [2023-08-27 09:59:56,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:56,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460697953] [2023-08-27 09:59:56,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:59:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:59:57,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:59:57,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460697953] [2023-08-27 09:59:57,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460697953] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:59:57,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:59:57,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 09:59:57,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392508084] [2023-08-27 09:59:57,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:59:57,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 09:59:57,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:59:57,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 09:59:57,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 09:59:57,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 230 [2023-08-27 09:59:57,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 46 transitions, 337 flow. Second operand has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:57,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:59:57,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 230 [2023-08-27 09:59:57,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:59:57,301 INFO L124 PetriNetUnfolderBase]: 732/1578 cut-off events. [2023-08-27 09:59:57,301 INFO L125 PetriNetUnfolderBase]: For 3775/3923 co-relation queries the response was YES. [2023-08-27 09:59:57,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6402 conditions, 1578 events. 732/1578 cut-off events. For 3775/3923 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10785 event pairs, 224 based on Foata normal form. 47/1599 useless extension candidates. Maximal degree in co-relation 6375. Up to 712 conditions per place. [2023-08-27 09:59:57,306 INFO L140 encePairwiseOnDemand]: 222/230 looper letters, 49 selfloop transitions, 9 changer transitions 47/115 dead transitions. [2023-08-27 09:59:57,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 115 transitions, 958 flow [2023-08-27 09:59:57,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:59:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:59:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 721 transitions. [2023-08-27 09:59:57,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44782608695652176 [2023-08-27 09:59:57,308 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 721 transitions. [2023-08-27 09:59:57,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 721 transitions. [2023-08-27 09:59:57,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:59:57,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 721 transitions. [2023-08-27 09:59:57,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:57,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:57,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:57,312 INFO L175 Difference]: Start difference. First operand has 72 places, 46 transitions, 337 flow. Second operand 7 states and 721 transitions. [2023-08-27 09:59:57,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 115 transitions, 958 flow [2023-08-27 09:59:57,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 115 transitions, 887 flow, removed 7 selfloop flow, removed 10 redundant places. [2023-08-27 09:59:57,325 INFO L231 Difference]: Finished difference. Result has 69 places, 48 transitions, 330 flow [2023-08-27 09:59:57,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=69, PETRI_TRANSITIONS=48} [2023-08-27 09:59:57,326 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-08-27 09:59:57,326 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 48 transitions, 330 flow [2023-08-27 09:59:57,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:59:57,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:59:57,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:57,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 09:59:57,327 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:59:57,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:59:57,327 INFO L85 PathProgramCache]: Analyzing trace with hash -971703269, now seen corresponding path program 3 times [2023-08-27 09:59:57,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:59:57,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897624462] [2023-08-27 09:59:57,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:59:57,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:59:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 09:59:57,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 09:59:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 09:59:57,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 09:59:57,402 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 09:59:57,403 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 09:59:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (16 of 18 remaining) [2023-08-27 09:59:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 09:59:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-27 09:59:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 09:59:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 09:59:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 09:59:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 09:59:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 09:59:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 09:59:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 09:59:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (6 of 18 remaining) [2023-08-27 09:59:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 09:59:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-27 09:59:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 09:59:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 09:59:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 09:59:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 09:59:57,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 09:59:57,405 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:59:57,409 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 09:59:57,409 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 09:59:57,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:59:57 BasicIcfg [2023-08-27 09:59:57,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 09:59:57,450 INFO L158 Benchmark]: Toolchain (without parser) took 12841.56ms. Allocated memory was 356.5MB in the beginning and 994.1MB in the end (delta: 637.5MB). Free memory was 330.0MB in the beginning and 405.2MB in the end (delta: -75.2MB). Peak memory consumption was 562.2MB. Max. memory is 16.0GB. [2023-08-27 09:59:57,450 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 356.5MB. Free memory is still 333.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 09:59:57,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.17ms. Allocated memory is still 356.5MB. Free memory was 329.8MB in the beginning and 306.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 09:59:57,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.93ms. Allocated memory is still 356.5MB. Free memory was 306.0MB in the beginning and 303.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 09:59:57,451 INFO L158 Benchmark]: Boogie Preprocessor took 44.66ms. Allocated memory is still 356.5MB. Free memory was 303.2MB in the beginning and 301.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 09:59:57,451 INFO L158 Benchmark]: RCFGBuilder took 587.36ms. Allocated memory is still 356.5MB. Free memory was 301.8MB in the beginning and 262.7MB in the end (delta: 39.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-27 09:59:57,451 INFO L158 Benchmark]: TraceAbstraction took 11728.66ms. Allocated memory was 356.5MB in the beginning and 994.1MB in the end (delta: 637.5MB). Free memory was 262.0MB in the beginning and 405.2MB in the end (delta: -143.2MB). Peak memory consumption was 493.0MB. Max. memory is 16.0GB. [2023-08-27 09:59:57,452 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.38ms. Allocated memory is still 356.5MB. Free memory is still 333.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 420.17ms. Allocated memory is still 356.5MB. Free memory was 329.8MB in the beginning and 306.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.93ms. Allocated memory is still 356.5MB. Free memory was 306.0MB in the beginning and 303.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.66ms. Allocated memory is still 356.5MB. Free memory was 303.2MB in the beginning and 301.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 587.36ms. Allocated memory is still 356.5MB. Free memory was 301.8MB in the beginning and 262.7MB in the end (delta: 39.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 11728.66ms. Allocated memory was 356.5MB in the beginning and 994.1MB in the end (delta: 637.5MB). Free memory was 262.0MB in the beginning and 405.2MB in the end (delta: -143.2MB). Peak memory consumption was 493.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 126 PlacesBefore, 41 PlacesAfterwards, 119 TransitionsBefore, 32 TransitionsAfterwards, 3000 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 108 TotalNumberOfCompositions, 11697 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3883, independent: 3564, independent conditional: 0, independent unconditional: 3564, dependent: 319, dependent conditional: 0, dependent unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1778, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3883, independent: 1843, independent conditional: 0, independent unconditional: 1843, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 1778, unknown conditional: 0, unknown unconditional: 1778] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t153; [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t153, ((void *)0), P0, ((void *)0))=-2, t153={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] 0 pthread_t t154; [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t154, ((void *)0), P1, ((void *)0))=-1, t153={5:0}, t154={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t155; [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t155, ((void *)0), P2, ((void *)0))=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] EXPR 2 __unbuffered_cnt + 1 [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] EXPR 1 __unbuffered_cnt + 1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L828] EXPR 3 __unbuffered_cnt + 1 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix006_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 412 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 412 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1335 IncrementalHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 23 mSDtfsCounter, 1335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=11, InterpolantAutomatonStates: 67, 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.3s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 09:59:57,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...