/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/rfi007_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:51:21,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:51:21,632 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:51:21,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:51:21,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:51:21,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:51:21,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:51:21,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:51:21,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:51:21,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:51:21,662 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:51:21,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:51:21,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:51:21,663 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:51:21,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:51:21,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:51:21,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:51:21,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:51:21,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:51:21,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:51:21,665 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:51:21,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:51:21,669 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:51:21,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:51:21,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:51:21,674 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:51:21,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:51:21,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:51:21,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:51:21,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:51:21,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:51:21,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:51:21,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:51:21,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:51:21,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:51:21,677 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:51:22,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:51:22,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:51:22,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:51:22,022 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:51:22,024 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:51:22,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 03:51:23,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:51:23,505 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:51:23,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 03:51:23,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c2f8208/508f083b966e4e87b51d402c523e471d/FLAG7fb198671 [2023-08-27 03:51:23,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c2f8208/508f083b966e4e87b51d402c523e471d [2023-08-27 03:51:23,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:51:23,546 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:51:23,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:51:23,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:51:23,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:51:23,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:51:23" (1/1) ... [2023-08-27 03:51:23,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c206580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:23, skipping insertion in model container [2023-08-27 03:51:23,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:51:23" (1/1) ... [2023-08-27 03:51:23,597 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:51:23,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:51:23,936 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:51:23,967 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:51:23,969 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:51:24,006 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:51:24,041 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:51:24,042 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:51:24,048 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:51:24,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:24 WrapperNode [2023-08-27 03:51:24,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:51:24,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:51:24,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:51:24,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:51:24,057 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:51:24" (1/1) ... [2023-08-27 03:51:24,090 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:51:24" (1/1) ... [2023-08-27 03:51:24,126 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2023-08-27 03:51:24,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:51:24,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:51:24,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:51:24,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:51:24,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:24" (1/1) ... [2023-08-27 03:51:24,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:24" (1/1) ... [2023-08-27 03:51:24,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:24" (1/1) ... [2023-08-27 03:51:24,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:24" (1/1) ... [2023-08-27 03:51:24,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:24" (1/1) ... [2023-08-27 03:51:24,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:24" (1/1) ... [2023-08-27 03:51:24,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:24" (1/1) ... [2023-08-27 03:51:24,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:24" (1/1) ... [2023-08-27 03:51:24,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:51:24,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:51:24,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:51:24,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:51:24,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:24" (1/1) ... [2023-08-27 03:51:24,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:51:24,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:51:24,214 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:51:24,228 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:51:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:51:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:51:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:51:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:51:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:51:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:51:24,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:51:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:51:24,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:51:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:51:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:51:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:51:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:51:24,257 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:51:24,414 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:51:24,417 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:51:24,698 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:51:24,831 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:51:24,832 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:51:24,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:51:24 BoogieIcfgContainer [2023-08-27 03:51:24,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:51:24,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:51:24,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:51:24,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:51:24,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:51:23" (1/3) ... [2023-08-27 03:51:24,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdfbf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:51:24, skipping insertion in model container [2023-08-27 03:51:24,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:51:24" (2/3) ... [2023-08-27 03:51:24,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdfbf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:51:24, skipping insertion in model container [2023-08-27 03:51:24,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:51:24" (3/3) ... [2023-08-27 03:51:24,841 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-27 03:51:24,856 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:51:24,856 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-27 03:51:24,857 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:51:24,900 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:51:24,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 204 flow [2023-08-27 03:51:24,974 INFO L124 PetriNetUnfolderBase]: 3/95 cut-off events. [2023-08-27 03:51:24,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:51:24,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 3/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-08-27 03:51:24,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 97 transitions, 204 flow [2023-08-27 03:51:25,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 95 transitions, 196 flow [2023-08-27 03:51:25,006 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:51:25,021 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 95 transitions, 196 flow [2023-08-27 03:51:25,028 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 95 transitions, 196 flow [2023-08-27 03:51:25,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 196 flow [2023-08-27 03:51:25,049 INFO L124 PetriNetUnfolderBase]: 3/95 cut-off events. [2023-08-27 03:51:25,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:51:25,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 3/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-08-27 03:51:25,051 INFO L119 LiptonReduction]: Number of co-enabled transitions 1580 [2023-08-27 03:51:27,976 INFO L134 LiptonReduction]: Checked pairs total: 5171 [2023-08-27 03:51:27,976 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-08-27 03:51:27,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:51:27,994 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;@4243911d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:51:27,994 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-27 03:51:27,997 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:51:27,997 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 03:51:27,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:51:27,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:51:27,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:51:27,999 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:51:28,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:51:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash 457911, now seen corresponding path program 1 times [2023-08-27 03:51:28,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:51:28,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774960147] [2023-08-27 03:51:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:51:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:51:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:51:28,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:51:28,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:51:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774960147] [2023-08-27 03:51:28,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774960147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:51:28,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:51:28,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:51:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789400196] [2023-08-27 03:51:28,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:51:28,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:51:28,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:51:28,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:51:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:51:28,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 186 [2023-08-27 03:51:28,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have 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:51:28,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:51:28,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 186 [2023-08-27 03:51:28,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:51:28,657 INFO L124 PetriNetUnfolderBase]: 273/545 cut-off events. [2023-08-27 03:51:28,658 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-27 03:51:28,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 545 events. 273/545 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2860 event pairs, 25 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 1015. Up to 401 conditions per place. [2023-08-27 03:51:28,669 INFO L140 encePairwiseOnDemand]: 182/186 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-08-27 03:51:28,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 34 transitions, 137 flow [2023-08-27 03:51:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:51:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:51:28,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-08-27 03:51:28,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2023-08-27 03:51:28,684 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-08-27 03:51:28,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-08-27 03:51:28,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:51:28,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-08-27 03:51:28,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:51:28,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:51:28,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:51:28,696 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 3 states and 273 transitions. [2023-08-27 03:51:28,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 34 transitions, 137 flow [2023-08-27 03:51:28,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:51:28,700 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 52 flow [2023-08-27 03:51:28,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2023-08-27 03:51:28,704 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-27 03:51:28,705 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 52 flow [2023-08-27 03:51:28,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have 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:51:28,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:51:28,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:51:28,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:51:28,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:51:28,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:51:28,707 INFO L85 PathProgramCache]: Analyzing trace with hash 757078255, now seen corresponding path program 1 times [2023-08-27 03:51:28,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:51:28,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279111599] [2023-08-27 03:51:28,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:51:28,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:51:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:51:28,809 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:51:28,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:51:28,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279111599] [2023-08-27 03:51:28,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279111599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:51:28,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:51:28,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:51:28,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939101937] [2023-08-27 03:51:28,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:51:28,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:51:28,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:51:28,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:51:28,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:51:28,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 186 [2023-08-27 03:51:28,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 52 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:51:28,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:51:28,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 186 [2023-08-27 03:51:28,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:51:28,927 INFO L124 PetriNetUnfolderBase]: 193/351 cut-off events. [2023-08-27 03:51:28,928 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-08-27 03:51:28,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 351 events. 193/351 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1412 event pairs, 95 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 733. Up to 174 conditions per place. [2023-08-27 03:51:28,933 INFO L140 encePairwiseOnDemand]: 179/186 looper letters, 31 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-08-27 03:51:28,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 152 flow [2023-08-27 03:51:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:51:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:51:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2023-08-27 03:51:28,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.482078853046595 [2023-08-27 03:51:28,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2023-08-27 03:51:28,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2023-08-27 03:51:28,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:51:28,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2023-08-27 03:51:28,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have 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:51:28,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:51:28,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:51:28,947 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 52 flow. Second operand 3 states and 269 transitions. [2023-08-27 03:51:28,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 152 flow [2023-08-27 03:51:28,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:51:28,948 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 73 flow [2023-08-27 03:51:28,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-08-27 03:51:28,950 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-08-27 03:51:28,950 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 73 flow [2023-08-27 03:51:28,951 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:51:28,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:51:28,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:51:28,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:51:28,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:51:28,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:51:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1540760371, now seen corresponding path program 1 times [2023-08-27 03:51:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:51:28,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440739506] [2023-08-27 03:51:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:51:28,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:51:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:51:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:51:29,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:51:29,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440739506] [2023-08-27 03:51:29,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440739506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:51:29,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:51:29,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:51:29,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947567232] [2023-08-27 03:51:29,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:51:29,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:51:29,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:51:29,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:51:29,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:51:29,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 186 [2023-08-27 03:51:29,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:51:29,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:51:29,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 186 [2023-08-27 03:51:29,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:51:29,355 INFO L124 PetriNetUnfolderBase]: 467/831 cut-off events. [2023-08-27 03:51:29,355 INFO L125 PetriNetUnfolderBase]: For 73/76 co-relation queries the response was YES. [2023-08-27 03:51:29,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1945 conditions, 831 events. 467/831 cut-off events. For 73/76 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3933 event pairs, 94 based on Foata normal form. 0/759 useless extension candidates. Maximal degree in co-relation 1934. Up to 339 conditions per place. [2023-08-27 03:51:29,361 INFO L140 encePairwiseOnDemand]: 178/186 looper letters, 50 selfloop transitions, 12 changer transitions 4/68 dead transitions. [2023-08-27 03:51:29,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 68 transitions, 335 flow [2023-08-27 03:51:29,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:51:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:51:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 420 transitions. [2023-08-27 03:51:29,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2023-08-27 03:51:29,363 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 420 transitions. [2023-08-27 03:51:29,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 420 transitions. [2023-08-27 03:51:29,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:51:29,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 420 transitions. [2023-08-27 03:51:29,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have 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:51:29,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have 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:51:29,367 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have 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:51:29,367 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 73 flow. Second operand 5 states and 420 transitions. [2023-08-27 03:51:29,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 68 transitions, 335 flow [2023-08-27 03:51:29,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 68 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:51:29,369 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 160 flow [2023-08-27 03:51:29,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2023-08-27 03:51:29,370 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2023-08-27 03:51:29,370 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 160 flow [2023-08-27 03:51:29,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:51:29,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:51:29,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:51:29,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:51:29,371 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:51:29,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:51:29,372 INFO L85 PathProgramCache]: Analyzing trace with hash -518958913, now seen corresponding path program 1 times [2023-08-27 03:51:29,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:51:29,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721757942] [2023-08-27 03:51:29,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:51:29,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:51:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:51:29,480 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:51:29,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:51:29,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721757942] [2023-08-27 03:51:29,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721757942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:51:29,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:51:29,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:51:29,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696901914] [2023-08-27 03:51:29,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:51:29,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:51:29,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:51:29,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:51:29,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:51:29,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 186 [2023-08-27 03:51:29,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have 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:51:29,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:51:29,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 186 [2023-08-27 03:51:29,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:51:29,654 INFO L124 PetriNetUnfolderBase]: 501/902 cut-off events. [2023-08-27 03:51:29,654 INFO L125 PetriNetUnfolderBase]: For 899/911 co-relation queries the response was YES. [2023-08-27 03:51:29,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 902 events. 501/902 cut-off events. For 899/911 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4422 event pairs, 121 based on Foata normal form. 48/907 useless extension candidates. Maximal degree in co-relation 2734. Up to 420 conditions per place. [2023-08-27 03:51:29,660 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 46 selfloop transitions, 11 changer transitions 2/64 dead transitions. [2023-08-27 03:51:29,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 404 flow [2023-08-27 03:51:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:51:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:51:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2023-08-27 03:51:29,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45376344086021503 [2023-08-27 03:51:29,662 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 422 transitions. [2023-08-27 03:51:29,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 422 transitions. [2023-08-27 03:51:29,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:51:29,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 422 transitions. [2023-08-27 03:51:29,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have 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:51:29,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have 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:51:29,666 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have 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:51:29,666 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 160 flow. Second operand 5 states and 422 transitions. [2023-08-27 03:51:29,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 404 flow [2023-08-27 03:51:29,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 404 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:51:29,671 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 258 flow [2023-08-27 03:51:29,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-08-27 03:51:29,671 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2023-08-27 03:51:29,672 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 258 flow [2023-08-27 03:51:29,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have 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:51:29,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:51:29,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:51:29,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:51:29,672 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:51:29,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:51:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash -374512054, now seen corresponding path program 1 times [2023-08-27 03:51:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:51:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178395745] [2023-08-27 03:51:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:51:29,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:51:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:51:29,795 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:51:29,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:51:29,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178395745] [2023-08-27 03:51:29,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178395745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:51:29,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:51:29,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:51:29,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428254438] [2023-08-27 03:51:29,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:51:29,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:51:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:51:29,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:51:29,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:51:29,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 186 [2023-08-27 03:51:29,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have 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:51:29,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:51:29,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 186 [2023-08-27 03:51:29,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:51:29,960 INFO L124 PetriNetUnfolderBase]: 180/418 cut-off events. [2023-08-27 03:51:29,960 INFO L125 PetriNetUnfolderBase]: For 650/664 co-relation queries the response was YES. [2023-08-27 03:51:29,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 418 events. 180/418 cut-off events. For 650/664 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2070 event pairs, 60 based on Foata normal form. 44/397 useless extension candidates. Maximal degree in co-relation 1379. Up to 285 conditions per place. [2023-08-27 03:51:29,963 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 53 selfloop transitions, 6 changer transitions 2/68 dead transitions. [2023-08-27 03:51:29,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 474 flow [2023-08-27 03:51:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:51:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:51:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2023-08-27 03:51:29,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45698924731182794 [2023-08-27 03:51:29,965 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 425 transitions. [2023-08-27 03:51:29,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 425 transitions. [2023-08-27 03:51:29,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:51:29,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 425 transitions. [2023-08-27 03:51:29,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have 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:51:29,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have 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:51:29,969 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have 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:51:29,970 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 258 flow. Second operand 5 states and 425 transitions. [2023-08-27 03:51:29,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 474 flow [2023-08-27 03:51:29,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 472 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-27 03:51:29,974 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 275 flow [2023-08-27 03:51:29,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-27 03:51:29,975 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2023-08-27 03:51:29,975 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 275 flow [2023-08-27 03:51:29,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have 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:51:29,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:51:29,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:51:29,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:51:29,976 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:51:29,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:51:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash 697308487, now seen corresponding path program 1 times [2023-08-27 03:51:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:51:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135674763] [2023-08-27 03:51:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:51:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:51:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:51:30,041 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:51:30,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:51:30,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135674763] [2023-08-27 03:51:30,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135674763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:51:30,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:51:30,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:51:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432243862] [2023-08-27 03:51:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:51:30,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:51:30,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:51:30,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:51:30,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:51:30,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 186 [2023-08-27 03:51:30,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:51:30,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:51:30,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 186 [2023-08-27 03:51:30,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:51:30,143 INFO L124 PetriNetUnfolderBase]: 157/363 cut-off events. [2023-08-27 03:51:30,144 INFO L125 PetriNetUnfolderBase]: For 691/701 co-relation queries the response was YES. [2023-08-27 03:51:30,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 363 events. 157/363 cut-off events. For 691/701 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1724 event pairs, 66 based on Foata normal form. 2/323 useless extension candidates. Maximal degree in co-relation 1332. Up to 263 conditions per place. [2023-08-27 03:51:30,147 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 36 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-27 03:51:30,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 379 flow [2023-08-27 03:51:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:51:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:51:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 338 transitions. [2023-08-27 03:51:30,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543010752688172 [2023-08-27 03:51:30,148 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 338 transitions. [2023-08-27 03:51:30,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 338 transitions. [2023-08-27 03:51:30,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:51:30,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 338 transitions. [2023-08-27 03:51:30,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:51:30,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have 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:51:30,151 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have 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:51:30,151 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 275 flow. Second operand 4 states and 338 transitions. [2023-08-27 03:51:30,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 379 flow [2023-08-27 03:51:30,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:51:30,156 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 269 flow [2023-08-27 03:51:30,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-27 03:51:30,156 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2023-08-27 03:51:30,157 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 269 flow [2023-08-27 03:51:30,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:51:30,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:51:30,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:51:30,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:51:30,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:51:30,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:51:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash 697308488, now seen corresponding path program 1 times [2023-08-27 03:51:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:51:30,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165572816] [2023-08-27 03:51:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:51:30,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:51:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:51:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:51:30,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:51:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165572816] [2023-08-27 03:51:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165572816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:51:30,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:51:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:51:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135175664] [2023-08-27 03:51:30,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:51:30,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:51:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:51:30,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:51:30,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:51:30,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 186 [2023-08-27 03:51:30,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:51:30,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:51:30,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 186 [2023-08-27 03:51:30,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:51:30,319 INFO L124 PetriNetUnfolderBase]: 134/309 cut-off events. [2023-08-27 03:51:30,319 INFO L125 PetriNetUnfolderBase]: For 576/586 co-relation queries the response was YES. [2023-08-27 03:51:30,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 309 events. 134/309 cut-off events. For 576/586 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1422 event pairs, 37 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 1142. Up to 164 conditions per place. [2023-08-27 03:51:30,321 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 26 selfloop transitions, 6 changer transitions 20/56 dead transitions. [2023-08-27 03:51:30,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 469 flow [2023-08-27 03:51:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:51:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:51:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2023-08-27 03:51:30,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-27 03:51:30,323 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 341 transitions. [2023-08-27 03:51:30,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 341 transitions. [2023-08-27 03:51:30,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:51:30,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 341 transitions. [2023-08-27 03:51:30,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:51:30,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have 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:51:30,326 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have 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:51:30,326 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 269 flow. Second operand 4 states and 341 transitions. [2023-08-27 03:51:30,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 469 flow [2023-08-27 03:51:30,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 463 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:51:30,329 INFO L231 Difference]: Finished difference. Result has 50 places, 24 transitions, 149 flow [2023-08-27 03:51:30,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=50, PETRI_TRANSITIONS=24} [2023-08-27 03:51:30,330 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2023-08-27 03:51:30,330 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 24 transitions, 149 flow [2023-08-27 03:51:30,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:51:30,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:51:30,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:51:30,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:51:30,331 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:51:30,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:51:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash 39876599, now seen corresponding path program 1 times [2023-08-27 03:51:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:51:30,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218502848] [2023-08-27 03:51:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:51:30,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:51:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:51:30,511 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:51:30,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:51:30,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218502848] [2023-08-27 03:51:30,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218502848] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:51:30,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:51:30,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:51:30,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250203396] [2023-08-27 03:51:30,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:51:30,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:51:30,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:51:30,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:51:30,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:51:30,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 186 [2023-08-27 03:51:30,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 24 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:51:30,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:51:30,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 186 [2023-08-27 03:51:30,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:51:30,621 INFO L124 PetriNetUnfolderBase]: 68/171 cut-off events. [2023-08-27 03:51:30,621 INFO L125 PetriNetUnfolderBase]: For 224/228 co-relation queries the response was YES. [2023-08-27 03:51:30,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 171 events. 68/171 cut-off events. For 224/228 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 690 event pairs, 11 based on Foata normal form. 15/184 useless extension candidates. Maximal degree in co-relation 610. Up to 50 conditions per place. [2023-08-27 03:51:30,623 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 23 selfloop transitions, 8 changer transitions 12/47 dead transitions. [2023-08-27 03:51:30,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 329 flow [2023-08-27 03:51:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:51:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:51:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 566 transitions. [2023-08-27 03:51:30,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434715821812596 [2023-08-27 03:51:30,625 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 566 transitions. [2023-08-27 03:51:30,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 566 transitions. [2023-08-27 03:51:30,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:51:30,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 566 transitions. [2023-08-27 03:51:30,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 80.85714285714286) internal successors, (566), 7 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have 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:51:30,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have 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:51:30,629 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have 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:51:30,629 INFO L175 Difference]: Start difference. First operand has 50 places, 24 transitions, 149 flow. Second operand 7 states and 566 transitions. [2023-08-27 03:51:30,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 329 flow [2023-08-27 03:51:30,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 254 flow, removed 14 selfloop flow, removed 13 redundant places. [2023-08-27 03:51:30,632 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 131 flow [2023-08-27 03:51:30,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=131, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2023-08-27 03:51:30,633 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2023-08-27 03:51:30,633 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 131 flow [2023-08-27 03:51:30,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:51:30,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:51:30,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:51:30,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:51:30,634 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:51:30,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:51:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash 300008410, now seen corresponding path program 1 times [2023-08-27 03:51:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:51:30,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385570142] [2023-08-27 03:51:30,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:51:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:51:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:51:31,062 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:51:31,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:51:31,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385570142] [2023-08-27 03:51:31,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385570142] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:51:31,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:51:31,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:51:31,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842867718] [2023-08-27 03:51:31,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:51:31,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:51:31,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:51:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:51:31,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:51:31,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 186 [2023-08-27 03:51:31,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 131 flow. Second operand has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have 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:51:31,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:51:31,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 186 [2023-08-27 03:51:31,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:51:31,245 INFO L124 PetriNetUnfolderBase]: 71/194 cut-off events. [2023-08-27 03:51:31,245 INFO L125 PetriNetUnfolderBase]: For 345/348 co-relation queries the response was YES. [2023-08-27 03:51:31,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 194 events. 71/194 cut-off events. For 345/348 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 862 event pairs, 3 based on Foata normal form. 1/195 useless extension candidates. Maximal degree in co-relation 686. Up to 85 conditions per place. [2023-08-27 03:51:31,246 INFO L140 encePairwiseOnDemand]: 179/186 looper letters, 22 selfloop transitions, 4 changer transitions 23/53 dead transitions. [2023-08-27 03:51:31,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 394 flow [2023-08-27 03:51:31,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:51:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:51:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 604 transitions. [2023-08-27 03:51:31,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40591397849462363 [2023-08-27 03:51:31,250 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 604 transitions. [2023-08-27 03:51:31,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 604 transitions. [2023-08-27 03:51:31,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:51:31,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 604 transitions. [2023-08-27 03:51:31,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 75.5) internal successors, (604), 8 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have 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:51:31,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 186.0) internal successors, (1674), 9 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have 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:51:31,255 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 186.0) internal successors, (1674), 9 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have 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:51:31,255 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 131 flow. Second operand 8 states and 604 transitions. [2023-08-27 03:51:31,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 394 flow [2023-08-27 03:51:31,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 342 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-08-27 03:51:31,257 INFO L231 Difference]: Finished difference. Result has 44 places, 24 transitions, 120 flow [2023-08-27 03:51:31,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=120, PETRI_PLACES=44, PETRI_TRANSITIONS=24} [2023-08-27 03:51:31,258 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2023-08-27 03:51:31,258 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 24 transitions, 120 flow [2023-08-27 03:51:31,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have 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:51:31,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:51:31,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:51:31,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:51:31,261 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:51:31,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:51:31,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1343134202, now seen corresponding path program 2 times [2023-08-27 03:51:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:51:31,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789694829] [2023-08-27 03:51:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:51:31,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:51:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:51:31,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:51:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:51:31,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:51:31,351 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:51:31,352 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-27 03:51:31,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (11 of 13 remaining) [2023-08-27 03:51:31,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-27 03:51:31,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2023-08-27 03:51:31,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-27 03:51:31,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-27 03:51:31,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-27 03:51:31,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-27 03:51:31,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (4 of 13 remaining) [2023-08-27 03:51:31,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-27 03:51:31,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2023-08-27 03:51:31,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-27 03:51:31,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-27 03:51:31,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:51:31,355 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:51:31,360 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:51:31,360 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:51:31,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:51:31 BasicIcfg [2023-08-27 03:51:31,399 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:51:31,399 INFO L158 Benchmark]: Toolchain (without parser) took 7853.23ms. Allocated memory was 364.9MB in the beginning and 492.8MB in the end (delta: 127.9MB). Free memory was 340.0MB in the beginning and 356.0MB in the end (delta: -16.0MB). Peak memory consumption was 115.1MB. Max. memory is 16.0GB. [2023-08-27 03:51:31,399 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 364.9MB. Free memory is still 342.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:51:31,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.24ms. Allocated memory is still 364.9MB. Free memory was 339.3MB in the beginning and 316.9MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-27 03:51:31,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.00ms. Allocated memory is still 364.9MB. Free memory was 316.9MB in the beginning and 314.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:51:31,400 INFO L158 Benchmark]: Boogie Preprocessor took 37.97ms. Allocated memory is still 364.9MB. Free memory was 314.1MB in the beginning and 312.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:51:31,400 INFO L158 Benchmark]: RCFGBuilder took 667.57ms. Allocated memory is still 364.9MB. Free memory was 312.7MB in the beginning and 277.8MB in the end (delta: 35.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-27 03:51:31,400 INFO L158 Benchmark]: TraceAbstraction took 6562.88ms. Allocated memory was 364.9MB in the beginning and 492.8MB in the end (delta: 127.9MB). Free memory was 277.1MB in the beginning and 356.0MB in the end (delta: -78.9MB). Peak memory consumption was 52.2MB. Max. memory is 16.0GB. [2023-08-27 03:51:31,401 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.21ms. Allocated memory is still 364.9MB. Free memory is still 342.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 503.24ms. Allocated memory is still 364.9MB. Free memory was 339.3MB in the beginning and 316.9MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 76.00ms. Allocated memory is still 364.9MB. Free memory was 316.9MB in the beginning and 314.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.97ms. Allocated memory is still 364.9MB. Free memory was 314.1MB in the beginning and 312.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 667.57ms. Allocated memory is still 364.9MB. Free memory was 312.7MB in the beginning and 277.8MB in the end (delta: 35.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 6562.88ms. Allocated memory was 364.9MB in the beginning and 492.8MB in the end (delta: 127.9MB). Free memory was 277.1MB in the beginning and 356.0MB in the end (delta: -78.9MB). Peak memory consumption was 52.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 99 PlacesBefore, 30 PlacesAfterwards, 95 TransitionsBefore, 24 TransitionsAfterwards, 1580 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 5171 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2244, independent: 2059, independent conditional: 0, independent unconditional: 2059, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 929, independent: 893, independent conditional: 0, independent unconditional: 893, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2244, independent: 1166, independent conditional: 0, independent unconditional: 1166, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 929, unknown conditional: 0, unknown unconditional: 929] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1705; [L811] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1705, ((void *)0), P0, ((void *)0))=-2, t1705={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] [L812] 0 pthread_t t1706; [L813] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1706, ((void *)0), P1, ((void *)0))=-1, t1705={5:0}, t1706={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] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L749] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L766] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L777] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L778] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L779] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L780] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L782] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L788] 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) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 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 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L752] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L759] EXPR 1 __unbuffered_cnt + 1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L795] EXPR 2 __unbuffered_cnt + 1 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 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) [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 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 [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705={5:0}, t1706={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L826] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={65:66}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 811]: 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: 813]: 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, 119 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.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 608 IncrementalHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 12 mSDtfsCounter, 608 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=5, InterpolantAutomatonStates: 44, 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.3s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 360 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:51:31,420 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...