/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:58:48,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:58:48,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:58:48,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:58:48,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:58:48,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:58:48,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:58:48,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:58:48,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:58:48,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:58:48,730 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:58:48,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:58:48,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:58:48,732 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:58:48,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:58:48,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:58:48,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:58:48,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:58:48,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:58:48,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:58:48,733 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:58:48,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:58:48,734 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:58:48,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:58:48,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:58:48,735 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:58:48,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:58:48,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:58:48,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:58:48,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:58:48,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:58:48,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:58:48,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:58:48,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:58:48,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:58:48,738 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:58:49,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:58:49,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:58:49,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:58:49,079 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:58:49,081 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:58:49,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 03:58:50,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:58:50,458 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:58:50,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 03:58:50,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a96d051e/5a8d6f35af7d483fbf72d96e739031d8/FLAG4456b55b3 [2023-08-27 03:58:50,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a96d051e/5a8d6f35af7d483fbf72d96e739031d8 [2023-08-27 03:58:50,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:58:50,518 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:58:50,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:58:50,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:58:50,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:58:50,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:58:50" (1/1) ... [2023-08-27 03:58:50,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245f8115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:50, skipping insertion in model container [2023-08-27 03:58:50,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:58:50" (1/1) ... [2023-08-27 03:58:50,581 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:58:50,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:58:50,935 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:58:50,951 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:58:50,953 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:58:50,985 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:58:51,013 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:58:51,014 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:58:51,020 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:58:51,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51 WrapperNode [2023-08-27 03:58:51,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:58:51,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:58:51,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:58:51,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:58:51,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (1/1) ... [2023-08-27 03:58:51,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (1/1) ... [2023-08-27 03:58:51,067 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2023-08-27 03:58:51,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:58:51,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:58:51,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:58:51,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:58:51,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (1/1) ... [2023-08-27 03:58:51,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (1/1) ... [2023-08-27 03:58:51,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (1/1) ... [2023-08-27 03:58:51,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (1/1) ... [2023-08-27 03:58:51,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (1/1) ... [2023-08-27 03:58:51,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (1/1) ... [2023-08-27 03:58:51,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (1/1) ... [2023-08-27 03:58:51,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (1/1) ... [2023-08-27 03:58:51,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:58:51,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:58:51,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:58:51,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:58:51,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (1/1) ... [2023-08-27 03:58:51,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:58:51,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:58:51,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:58:51,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:58:51,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:58:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:58:51,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:58:51,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:58:51,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:58:51,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:58:51,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:58:51,200 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:58:51,341 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:58:51,344 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:58:51,654 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:58:51,827 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:58:51,827 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:58:51,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:58:51 BoogieIcfgContainer [2023-08-27 03:58:51,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:58:51,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:58:51,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:58:51,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:58:51,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:58:50" (1/3) ... [2023-08-27 03:58:51,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e8a40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:58:51, skipping insertion in model container [2023-08-27 03:58:51,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:51" (2/3) ... [2023-08-27 03:58:51,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e8a40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:58:51, skipping insertion in model container [2023-08-27 03:58:51,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:58:51" (3/3) ... [2023-08-27 03:58:51,837 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 03:58:51,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:58:51,853 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-27 03:58:51,853 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:58:51,904 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:58:51,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 94 transitions, 198 flow [2023-08-27 03:58:51,987 INFO L124 PetriNetUnfolderBase]: 3/92 cut-off events. [2023-08-27 03:58:51,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:58:51,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 3/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-27 03:58:51,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 94 transitions, 198 flow [2023-08-27 03:58:51,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 92 transitions, 190 flow [2023-08-27 03:58:52,000 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:58:52,011 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 92 transitions, 190 flow [2023-08-27 03:58:52,015 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 92 transitions, 190 flow [2023-08-27 03:58:52,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 92 transitions, 190 flow [2023-08-27 03:58:52,048 INFO L124 PetriNetUnfolderBase]: 3/92 cut-off events. [2023-08-27 03:58:52,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:58:52,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 3/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-27 03:58:52,051 INFO L119 LiptonReduction]: Number of co-enabled transitions 1388 [2023-08-27 03:58:55,122 INFO L134 LiptonReduction]: Checked pairs total: 3991 [2023-08-27 03:58:55,123 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-08-27 03:58:55,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:58:55,139 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;@71deaf5d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:58:55,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-27 03:58:55,142 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:58:55,142 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 03:58:55,142 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:58:55,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:55,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:58:55,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:55,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash 422145604, now seen corresponding path program 1 times [2023-08-27 03:58:55,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:55,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341420729] [2023-08-27 03:58:55,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:55,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:55,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:55,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341420729] [2023-08-27 03:58:55,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341420729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:55,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:55,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:58:55,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38828200] [2023-08-27 03:58:55,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:55,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:58:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:55,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:58:55,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:58:55,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-27 03:58:55,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:55,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:55,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-27 03:58:55,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:55,549 INFO L124 PetriNetUnfolderBase]: 158/290 cut-off events. [2023-08-27 03:58:55,549 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-27 03:58:55,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 290 events. 158/290 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1102 event pairs, 78 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 581. Up to 145 conditions per place. [2023-08-27 03:58:55,552 INFO L140 encePairwiseOnDemand]: 171/179 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-27 03:58:55,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 33 transitions, 139 flow [2023-08-27 03:58:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:58:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:58:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2023-08-27 03:58:55,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897579143389199 [2023-08-27 03:58:55,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2023-08-27 03:58:55,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2023-08-27 03:58:55,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:55,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2023-08-27 03:58:55,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:55,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:55,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:55,575 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 263 transitions. [2023-08-27 03:58:55,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 33 transitions, 139 flow [2023-08-27 03:58:55,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:58:55,579 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 69 flow [2023-08-27 03:58:55,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-08-27 03:58:55,583 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2023-08-27 03:58:55,583 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 69 flow [2023-08-27 03:58:55,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:55,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:55,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:58:55,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:58:55,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:55,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash 422175958, now seen corresponding path program 1 times [2023-08-27 03:58:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:55,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800819212] [2023-08-27 03:58:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:55,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:55,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:55,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800819212] [2023-08-27 03:58:55,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800819212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:55,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:55,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:58:55,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239808262] [2023-08-27 03:58:55,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:55,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:58:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:55,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:58:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:58:55,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 179 [2023-08-27 03:58:55,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:55,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:55,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 179 [2023-08-27 03:58:55,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:55,812 INFO L124 PetriNetUnfolderBase]: 119/248 cut-off events. [2023-08-27 03:58:55,812 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-27 03:58:55,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 248 events. 119/248 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 987 event pairs, 18 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 564. Up to 172 conditions per place. [2023-08-27 03:58:55,814 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 23 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-08-27 03:58:55,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 134 flow [2023-08-27 03:58:55,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:58:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:58:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2023-08-27 03:58:55,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48044692737430167 [2023-08-27 03:58:55,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 258 transitions. [2023-08-27 03:58:55,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 258 transitions. [2023-08-27 03:58:55,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:55,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 258 transitions. [2023-08-27 03:58:55,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:55,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:55,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:55,820 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 69 flow. Second operand 3 states and 258 transitions. [2023-08-27 03:58:55,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 134 flow [2023-08-27 03:58:55,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:58:55,821 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 68 flow [2023-08-27 03:58:55,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-08-27 03:58:55,822 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2023-08-27 03:58:55,822 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 68 flow [2023-08-27 03:58:55,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:55,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:55,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:55,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:58:55,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:55,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:55,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1984216380, now seen corresponding path program 1 times [2023-08-27 03:58:55,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:55,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967541478] [2023-08-27 03:58:55,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:55,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:55,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967541478] [2023-08-27 03:58:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967541478] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:55,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:55,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:58:55,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707103816] [2023-08-27 03:58:55,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:55,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:58:55,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:58:55,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:58:55,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-27 03:58:55,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:55,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:55,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-27 03:58:55,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:56,047 INFO L124 PetriNetUnfolderBase]: 146/272 cut-off events. [2023-08-27 03:58:56,047 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-27 03:58:56,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 272 events. 146/272 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 998 event pairs, 45 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 624. Up to 250 conditions per place. [2023-08-27 03:58:56,050 INFO L140 encePairwiseOnDemand]: 175/179 looper letters, 24 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-08-27 03:58:56,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 29 transitions, 142 flow [2023-08-27 03:58:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:58:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:58:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2023-08-27 03:58:56,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46741154562383613 [2023-08-27 03:58:56,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 251 transitions. [2023-08-27 03:58:56,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 251 transitions. [2023-08-27 03:58:56,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:56,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 251 transitions. [2023-08-27 03:58:56,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,055 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 68 flow. Second operand 3 states and 251 transitions. [2023-08-27 03:58:56,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 29 transitions, 142 flow [2023-08-27 03:58:56,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:58:56,057 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 83 flow [2023-08-27 03:58:56,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-08-27 03:58:56,058 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-08-27 03:58:56,058 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 83 flow [2023-08-27 03:58:56,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:56,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:56,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:58:56,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:56,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1381164865, now seen corresponding path program 1 times [2023-08-27 03:58:56,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:56,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760214504] [2023-08-27 03:58:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:56,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760214504] [2023-08-27 03:58:56,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760214504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:56,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:56,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:58:56,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79717145] [2023-08-27 03:58:56,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:56,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:58:56,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:56,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:58:56,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:58:56,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 179 [2023-08-27 03:58:56,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:56,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 179 [2023-08-27 03:58:56,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:56,383 INFO L124 PetriNetUnfolderBase]: 77/177 cut-off events. [2023-08-27 03:58:56,383 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-27 03:58:56,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 177 events. 77/177 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 662 event pairs, 28 based on Foata normal form. 23/175 useless extension candidates. Maximal degree in co-relation 444. Up to 106 conditions per place. [2023-08-27 03:58:56,386 INFO L140 encePairwiseOnDemand]: 174/179 looper letters, 37 selfloop transitions, 6 changer transitions 2/47 dead transitions. [2023-08-27 03:58:56,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 47 transitions, 248 flow [2023-08-27 03:58:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:58:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:58:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2023-08-27 03:58:56,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581005586592179 [2023-08-27 03:58:56,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 410 transitions. [2023-08-27 03:58:56,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 410 transitions. [2023-08-27 03:58:56,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:56,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 410 transitions. [2023-08-27 03:58:56,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,393 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,393 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 83 flow. Second operand 5 states and 410 transitions. [2023-08-27 03:58:56,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 47 transitions, 248 flow [2023-08-27 03:58:56,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:58:56,395 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 117 flow [2023-08-27 03:58:56,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-08-27 03:58:56,396 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2023-08-27 03:58:56,396 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 117 flow [2023-08-27 03:58:56,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:56,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:56,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:58:56,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:56,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1250967607, now seen corresponding path program 1 times [2023-08-27 03:58:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862220231] [2023-08-27 03:58:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:56,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:56,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:56,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862220231] [2023-08-27 03:58:56,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862220231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:56,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:56,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:58:56,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941488843] [2023-08-27 03:58:56,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:56,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:58:56,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:56,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:58:56,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:58:56,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 179 [2023-08-27 03:58:56,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 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 03:58:56,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:56,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 179 [2023-08-27 03:58:56,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:56,680 INFO L124 PetriNetUnfolderBase]: 43/107 cut-off events. [2023-08-27 03:58:56,680 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-08-27 03:58:56,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 107 events. 43/107 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 344 event pairs, 7 based on Foata normal form. 9/110 useless extension candidates. Maximal degree in co-relation 318. Up to 28 conditions per place. [2023-08-27 03:58:56,681 INFO L140 encePairwiseOnDemand]: 172/179 looper letters, 30 selfloop transitions, 9 changer transitions 3/44 dead transitions. [2023-08-27 03:58:56,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 253 flow [2023-08-27 03:58:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:58:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:58:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 557 transitions. [2023-08-27 03:58:56,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44453312051077415 [2023-08-27 03:58:56,683 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 557 transitions. [2023-08-27 03:58:56,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 557 transitions. [2023-08-27 03:58:56,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:56,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 557 transitions. [2023-08-27 03:58:56,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.57142857142857) internal successors, (557), 7 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,688 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,688 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 117 flow. Second operand 7 states and 557 transitions. [2023-08-27 03:58:56,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 253 flow [2023-08-27 03:58:56,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 243 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 03:58:56,691 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 133 flow [2023-08-27 03:58:56,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-08-27 03:58:56,691 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places. [2023-08-27 03:58:56,692 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 133 flow [2023-08-27 03:58:56,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 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 03:58:56,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:56,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:56,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:58:56,692 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:56,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:56,693 INFO L85 PathProgramCache]: Analyzing trace with hash -151256979, now seen corresponding path program 1 times [2023-08-27 03:58:56,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:56,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994710699] [2023-08-27 03:58:56,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:56,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994710699] [2023-08-27 03:58:56,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994710699] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:56,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:56,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:58:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246350430] [2023-08-27 03:58:56,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:56,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:58:56,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:56,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:58:56,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:58:56,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-27 03:58:56,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:56,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-27 03:58:56,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:56,798 INFO L124 PetriNetUnfolderBase]: 37/92 cut-off events. [2023-08-27 03:58:56,798 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2023-08-27 03:58:56,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 92 events. 37/92 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 265 event pairs, 18 based on Foata normal form. 6/98 useless extension candidates. Maximal degree in co-relation 307. Up to 47 conditions per place. [2023-08-27 03:58:56,799 INFO L140 encePairwiseOnDemand]: 174/179 looper letters, 19 selfloop transitions, 3 changer transitions 4/28 dead transitions. [2023-08-27 03:58:56,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 193 flow [2023-08-27 03:58:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:58:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:58:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 324 transitions. [2023-08-27 03:58:56,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45251396648044695 [2023-08-27 03:58:56,801 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 324 transitions. [2023-08-27 03:58:56,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 324 transitions. [2023-08-27 03:58:56,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:56,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 324 transitions. [2023-08-27 03:58:56,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,803 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,804 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 133 flow. Second operand 4 states and 324 transitions. [2023-08-27 03:58:56,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 193 flow [2023-08-27 03:58:56,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 166 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-08-27 03:58:56,806 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 78 flow [2023-08-27 03:58:56,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-08-27 03:58:56,807 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2023-08-27 03:58:56,807 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 78 flow [2023-08-27 03:58:56,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:56,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:56,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:58:56,808 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:56,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash -674035837, now seen corresponding path program 1 times [2023-08-27 03:58:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:56,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170603571] [2023-08-27 03:58:56,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:56,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:56,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:56,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170603571] [2023-08-27 03:58:56,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170603571] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:56,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:56,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:58:56,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044863525] [2023-08-27 03:58:56,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:56,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:58:56,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:56,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:58:56,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:58:56,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-08-27 03:58:56,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:56,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-08-27 03:58:56,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:56,982 INFO L124 PetriNetUnfolderBase]: 21/64 cut-off events. [2023-08-27 03:58:56,982 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-08-27 03:58:56,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 64 events. 21/64 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 160 event pairs, 0 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 194. Up to 43 conditions per place. [2023-08-27 03:58:56,983 INFO L140 encePairwiseOnDemand]: 174/179 looper letters, 19 selfloop transitions, 5 changer transitions 5/29 dead transitions. [2023-08-27 03:58:56,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 184 flow [2023-08-27 03:58:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:58:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:58:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2023-08-27 03:58:56,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45996275605214154 [2023-08-27 03:58:56,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 247 transitions. [2023-08-27 03:58:56,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 247 transitions. [2023-08-27 03:58:56,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:56,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 247 transitions. [2023-08-27 03:58:56,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,987 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 78 flow. Second operand 3 states and 247 transitions. [2023-08-27 03:58:56,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 184 flow [2023-08-27 03:58:56,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 170 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-27 03:58:56,988 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 91 flow [2023-08-27 03:58:56,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-08-27 03:58:56,989 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-08-27 03:58:56,989 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 91 flow [2023-08-27 03:58:56,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:56,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:56,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:56,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:58:56,989 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:56,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:56,990 INFO L85 PathProgramCache]: Analyzing trace with hash 21892007, now seen corresponding path program 2 times [2023-08-27 03:58:56,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:56,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523494198] [2023-08-27 03:58:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:57,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:57,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523494198] [2023-08-27 03:58:57,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523494198] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:57,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:58:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323597933] [2023-08-27 03:58:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:57,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:58:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:58:57,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:58:57,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-27 03:58:57,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:57,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:57,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-27 03:58:57,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:57,215 INFO L124 PetriNetUnfolderBase]: 22/73 cut-off events. [2023-08-27 03:58:57,215 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-08-27 03:58:57,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 73 events. 22/73 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 196 event pairs, 12 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 252. Up to 45 conditions per place. [2023-08-27 03:58:57,216 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 16 selfloop transitions, 2 changer transitions 8/26 dead transitions. [2023-08-27 03:58:57,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 175 flow [2023-08-27 03:58:57,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:58:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:58:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2023-08-27 03:58:57,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45996275605214154 [2023-08-27 03:58:57,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 247 transitions. [2023-08-27 03:58:57,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 247 transitions. [2023-08-27 03:58:57,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:57,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 247 transitions. [2023-08-27 03:58:57,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:57,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:57,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:57,219 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 91 flow. Second operand 3 states and 247 transitions. [2023-08-27 03:58:57,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 175 flow [2023-08-27 03:58:57,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 168 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 03:58:57,221 INFO L231 Difference]: Finished difference. Result has 31 places, 16 transitions, 78 flow [2023-08-27 03:58:57,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=31, PETRI_TRANSITIONS=16} [2023-08-27 03:58:57,223 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2023-08-27 03:58:57,223 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 16 transitions, 78 flow [2023-08-27 03:58:57,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:57,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:57,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:57,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:58:57,224 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:57,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1308787451, now seen corresponding path program 3 times [2023-08-27 03:58:57,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:57,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565803996] [2023-08-27 03:58:57,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:57,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:57,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:57,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565803996] [2023-08-27 03:58:57,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565803996] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:57,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:57,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:58:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110810814] [2023-08-27 03:58:57,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:57,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:58:57,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:57,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:58:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:58:57,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 179 [2023-08-27 03:58:57,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 16 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 68.85714285714286) internal successors, (482), 7 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:57,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:57,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 179 [2023-08-27 03:58:57,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:58,100 INFO L124 PetriNetUnfolderBase]: 6/32 cut-off events. [2023-08-27 03:58:58,100 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-27 03:58:58,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 32 events. 6/32 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 109. Up to 13 conditions per place. [2023-08-27 03:58:58,100 INFO L140 encePairwiseOnDemand]: 173/179 looper letters, 12 selfloop transitions, 4 changer transitions 8/25 dead transitions. [2023-08-27 03:58:58,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 176 flow [2023-08-27 03:58:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:58:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:58:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 490 transitions. [2023-08-27 03:58:58,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39106145251396646 [2023-08-27 03:58:58,103 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 490 transitions. [2023-08-27 03:58:58,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 490 transitions. [2023-08-27 03:58:58,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:58,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 490 transitions. [2023-08-27 03:58:58,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:58,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:58,106 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:58,106 INFO L175 Difference]: Start difference. First operand has 31 places, 16 transitions, 78 flow. Second operand 7 states and 490 transitions. [2023-08-27 03:58:58,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 176 flow [2023-08-27 03:58:58,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 145 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-27 03:58:58,107 INFO L231 Difference]: Finished difference. Result has 32 places, 16 transitions, 70 flow [2023-08-27 03:58:58,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=70, PETRI_PLACES=32, PETRI_TRANSITIONS=16} [2023-08-27 03:58:58,108 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2023-08-27 03:58:58,108 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 16 transitions, 70 flow [2023-08-27 03:58:58,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.85714285714286) internal successors, (482), 7 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:58,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:58,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:58,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:58:58,109 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:58,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash -619091469, now seen corresponding path program 4 times [2023-08-27 03:58:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:58,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426776681] [2023-08-27 03:58:58,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:58,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:58:58,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:58:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:58:58,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:58:58,173 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:58:58,174 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-27 03:58:58,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2023-08-27 03:58:58,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-27 03:58:58,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (9 of 13 remaining) [2023-08-27 03:58:58,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-27 03:58:58,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-27 03:58:58,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-27 03:58:58,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-27 03:58:58,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2023-08-27 03:58:58,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-27 03:58:58,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (2 of 13 remaining) [2023-08-27 03:58:58,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-27 03:58:58,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-27 03:58:58,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:58:58,177 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:58,181 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:58:58,182 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:58:58,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:58:58 BasicIcfg [2023-08-27 03:58:58,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:58:58,217 INFO L158 Benchmark]: Toolchain (without parser) took 7698.73ms. Allocated memory was 371.2MB in the beginning and 492.8MB in the end (delta: 121.6MB). Free memory was 346.6MB in the beginning and 262.1MB in the end (delta: 84.5MB). Peak memory consumption was 206.6MB. Max. memory is 16.0GB. [2023-08-27 03:58:58,217 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 371.2MB. Free memory is still 347.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:58:58,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.41ms. Allocated memory is still 371.2MB. Free memory was 346.2MB in the beginning and 324.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-27 03:58:58,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.79ms. Allocated memory is still 371.2MB. Free memory was 324.1MB in the beginning and 322.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:58:58,218 INFO L158 Benchmark]: Boogie Preprocessor took 39.23ms. Allocated memory is still 371.2MB. Free memory was 322.0MB in the beginning and 320.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:58:58,218 INFO L158 Benchmark]: RCFGBuilder took 721.01ms. Allocated memory is still 371.2MB. Free memory was 320.0MB in the beginning and 338.1MB in the end (delta: -18.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-27 03:58:58,218 INFO L158 Benchmark]: TraceAbstraction took 6384.88ms. Allocated memory was 371.2MB in the beginning and 492.8MB in the end (delta: 121.6MB). Free memory was 337.2MB in the beginning and 262.1MB in the end (delta: 75.1MB). Peak memory consumption was 198.5MB. Max. memory is 16.0GB. [2023-08-27 03:58:58,220 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 371.2MB. Free memory is still 347.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 500.41ms. Allocated memory is still 371.2MB. Free memory was 346.2MB in the beginning and 324.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.79ms. Allocated memory is still 371.2MB. Free memory was 324.1MB in the beginning and 322.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.23ms. Allocated memory is still 371.2MB. Free memory was 322.0MB in the beginning and 320.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 721.01ms. Allocated memory is still 371.2MB. Free memory was 320.0MB in the beginning and 338.1MB in the end (delta: -18.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 6384.88ms. Allocated memory was 371.2MB in the beginning and 492.8MB in the end (delta: 121.6MB). Free memory was 337.2MB in the beginning and 262.1MB in the end (delta: 75.1MB). Peak memory consumption was 198.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 96 PlacesBefore, 27 PlacesAfterwards, 92 TransitionsBefore, 21 TransitionsAfterwards, 1388 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 3991 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1949, independent: 1789, independent conditional: 0, independent unconditional: 1789, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 788, independent: 756, independent conditional: 0, independent unconditional: 756, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1949, independent: 1033, independent conditional: 0, independent unconditional: 1033, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 788, unknown conditional: 0, unknown unconditional: 788] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2561, ((void *)0), P0, ((void *)0))=-2, t2561={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2562, ((void *)0), P1, ((void *)0))=-1, t2561={5:0}, t2562={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L788] EXPR 2 __unbuffered_cnt + 1 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L760] EXPR 1 __unbuffered_cnt + 1 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561={5:0}, t2562={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={66:67}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 760]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 806]: 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: 804]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 114 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 403 IncrementalHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 9 mSDtfsCounter, 403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:58:58,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...