/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver bitwuzla -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 15:22:52,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 15:22:52,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 15:22:52,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 15:22:52,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 15:22:52,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 15:22:52,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 15:22:52,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 15:22:52,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 15:22:52,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 15:22:52,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 15:22:52,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 15:22:52,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 15:22:52,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 15:22:52,605 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 15:22:52,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 15:22:52,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 15:22:52,606 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 15:22:52,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 15:22:52,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 15:22:52,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 15:22:52,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 15:22:52,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 15:22:52,608 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 15:22:52,608 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 15:22:52,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 15:22:52,608 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 15:22:52,608 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 15:22:52,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 15:22:52,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 15:22:52,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 15:22:52,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 15:22:52,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 15:22:52,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 15:22:52,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 15:22:52,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 15:22:52,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 15:22:52,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 15:22:52,611 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 15:22:52,611 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 15:22:52,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 15:22:52,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 15:22:52,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 15:22:52,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 15:22:52,612 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> bitwuzla [2024-11-03 15:22:52,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 15:22:52,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 15:22:52,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 15:22:52,850 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 15:22:52,851 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 15:22:52,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c [2024-11-03 15:22:54,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 15:22:54,397 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 15:22:54,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c [2024-11-03 15:22:54,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a527919/9442c0b5b3354d5ba6996033026ef17b/FLAG63400e1aa [2024-11-03 15:22:54,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a527919/9442c0b5b3354d5ba6996033026ef17b [2024-11-03 15:22:54,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 15:22:54,428 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 15:22:54,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 15:22:54,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 15:22:54,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 15:22:54,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e4d1683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54, skipping insertion in model container [2024-11-03 15:22:54,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 15:22:54,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-03 15:22:54,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 15:22:54,663 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 15:22:54,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-03 15:22:54,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 15:22:54,703 INFO L204 MainTranslator]: Completed translation [2024-11-03 15:22:54,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54 WrapperNode [2024-11-03 15:22:54,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 15:22:54,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 15:22:54,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 15:22:54,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 15:22:54,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,750 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2024-11-03 15:22:54,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 15:22:54,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 15:22:54,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 15:22:54,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 15:22:54,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,786 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-03 15:22:54,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 15:22:54,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 15:22:54,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 15:22:54,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 15:22:54,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (1/1) ... [2024-11-03 15:22:54,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 15:22:54,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 15:22:54,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-03 15:22:54,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-03 15:22:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 15:22:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 15:22:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-03 15:22:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-03 15:22:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-03 15:22:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-03 15:22:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-03 15:22:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-03 15:22:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 15:22:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 15:22:54,860 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-03 15:22:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-03 15:22:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-03 15:22:54,861 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-03 15:22:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-03 15:22:54,945 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 15:22:54,947 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 15:22:55,260 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-03 15:22:55,261 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 15:22:55,279 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 15:22:55,280 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-03 15:22:55,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:22:55 BoogieIcfgContainer [2024-11-03 15:22:55,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 15:22:55,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 15:22:55,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 15:22:55,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 15:22:55,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:22:54" (1/3) ... [2024-11-03 15:22:55,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f5b11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:22:55, skipping insertion in model container [2024-11-03 15:22:55,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:22:54" (2/3) ... [2024-11-03 15:22:55,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f5b11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:22:55, skipping insertion in model container [2024-11-03 15:22:55,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:22:55" (3/3) ... [2024-11-03 15:22:55,288 INFO L112 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2024-11-03 15:22:55,301 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 15:22:55,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 15:22:55,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 15:22:55,351 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2474e99b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 15:22:55,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 15:22:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:22:55,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-03 15:22:55,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:22:55,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:22:55,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:22:55,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:22:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash -871385011, now seen corresponding path program 1 times [2024-11-03 15:22:55,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:22:55,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [555012433] [2024-11-03 15:22:55,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:22:55,395 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:22:55,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:22:55,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:22:55,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-03 15:22:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:22:55,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 15:22:55,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:22:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 15:22:55,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:22:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 15:22:55,616 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:22:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [555012433] [2024-11-03 15:22:55,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [555012433] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 15:22:55,617 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 15:22:55,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-03 15:22:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084523281] [2024-11-03 15:22:55,623 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 15:22:55,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-03 15:22:55,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:22:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-03 15:22:55,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-03 15:22:55,655 INFO L87 Difference]: Start difference. First operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 15:22:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:22:55,724 INFO L93 Difference]: Finished difference Result 113 states and 156 transitions. [2024-11-03 15:22:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 15:22:55,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-03 15:22:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:22:55,732 INFO L225 Difference]: With dead ends: 113 [2024-11-03 15:22:55,732 INFO L226 Difference]: Without dead ends: 58 [2024-11-03 15:22:55,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-03 15:22:55,740 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 15:22:55,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 15:22:55,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-03 15:22:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-03 15:22:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-03 15:22:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-11-03 15:22:55,773 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 27 [2024-11-03 15:22:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:22:55,774 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-11-03 15:22:55,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 15:22:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-11-03 15:22:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-03 15:22:55,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:22:55,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:22:55,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Ended with exit code 0 [2024-11-03 15:22:55,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:22:55,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:22:55,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:22:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash 373379470, now seen corresponding path program 1 times [2024-11-03 15:22:55,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:22:55,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [50842031] [2024-11-03 15:22:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:22:55,980 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:22:55,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:22:55,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:22:55,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-03 15:22:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:22:56,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 15:22:56,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:22:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 15:22:56,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:22:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 15:22:56,112 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:22:56,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [50842031] [2024-11-03 15:22:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [50842031] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 15:22:56,112 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 15:22:56,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2024-11-03 15:22:56,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731178107] [2024-11-03 15:22:56,113 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 15:22:56,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-03 15:22:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:22:56,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-03 15:22:56,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-03 15:22:56,116 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 15:22:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:22:56,135 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-11-03 15:22:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 15:22:56,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-03 15:22:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:22:56,140 INFO L225 Difference]: With dead ends: 62 [2024-11-03 15:22:56,140 INFO L226 Difference]: Without dead ends: 58 [2024-11-03 15:22:56,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-03 15:22:56,142 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 15:22:56,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 15:22:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-03 15:22:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-03 15:22:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-03 15:22:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-03 15:22:56,155 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 27 [2024-11-03 15:22:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:22:56,156 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-03 15:22:56,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 15:22:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-03 15:22:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-03 15:22:56,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:22:56,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:22:56,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Ended with exit code 0 [2024-11-03 15:22:56,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:22:56,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:22:56,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:22:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash 373319888, now seen corresponding path program 1 times [2024-11-03 15:22:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:22:56,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2097089656] [2024-11-03 15:22:56,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:22:56,363 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:22:56,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:22:56,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:22:56,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-03 15:22:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:22:56,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 15:22:56,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:22:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 15:22:56,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:22:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 15:22:56,438 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:22:56,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2097089656] [2024-11-03 15:22:56,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2097089656] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 15:22:56,438 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 15:22:56,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 15:22:56,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798455417] [2024-11-03 15:22:56,439 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 15:22:56,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 15:22:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:22:56,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 15:22:56,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 15:22:56,440 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 15:22:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:22:56,481 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-11-03 15:22:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 15:22:56,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-03 15:22:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:22:56,483 INFO L225 Difference]: With dead ends: 63 [2024-11-03 15:22:56,483 INFO L226 Difference]: Without dead ends: 58 [2024-11-03 15:22:56,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 15:22:56,484 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 15:22:56,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 15:22:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-03 15:22:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-03 15:22:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-03 15:22:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-11-03 15:22:56,491 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 27 [2024-11-03 15:22:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:22:56,492 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-11-03 15:22:56,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 15:22:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-11-03 15:22:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-03 15:22:56,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:22:56,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:22:56,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Ended with exit code 0 [2024-11-03 15:22:56,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:22:56,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:22:56,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:22:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash 489413935, now seen corresponding path program 1 times [2024-11-03 15:22:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:22:56,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1556640119] [2024-11-03 15:22:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:22:56,697 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:22:56,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:22:56,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:22:56,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Waiting until timeout for monitored process [2024-11-03 15:22:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:22:56,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-03 15:22:56,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:22:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 15:22:56,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:23:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 15:23:00,506 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:23:00,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1556640119] [2024-11-03 15:23:00,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1556640119] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 15:23:00,507 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 15:23:00,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 17 [2024-11-03 15:23:00,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477642753] [2024-11-03 15:23:00,507 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 15:23:00,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-03 15:23:00,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:23:00,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-03 15:23:00,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-03 15:23:00,509 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 15:23:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:23:02,436 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2024-11-03 15:23:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-03 15:23:02,438 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-03 15:23:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:23:02,439 INFO L225 Difference]: With dead ends: 119 [2024-11-03 15:23:02,439 INFO L226 Difference]: Without dead ends: 58 [2024-11-03 15:23:02,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-03 15:23:02,441 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-03 15:23:02,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 738 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-03 15:23:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-03 15:23:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-11-03 15:23:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:23:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-03 15:23:02,451 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 30 [2024-11-03 15:23:02,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:23:02,451 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-03 15:23:02,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 15:23:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-03 15:23:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-03 15:23:02,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:23:02,454 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:02,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Forceful destruction successful, exit code 0 [2024-11-03 15:23:02,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:02,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:23:02,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:23:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 761216169, now seen corresponding path program 1 times [2024-11-03 15:23:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:23:02,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [157528862] [2024-11-03 15:23:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:23:02,656 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:23:02,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:02,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:23:02,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (6)] Waiting until timeout for monitored process [2024-11-03 15:23:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:23:02,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 15:23:02,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:23:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-03 15:23:02,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:23:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-03 15:23:02,777 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:23:02,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [157528862] [2024-11-03 15:23:02,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [157528862] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 15:23:02,778 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 15:23:02,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 15:23:02,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349256049] [2024-11-03 15:23:02,778 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 15:23:02,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 15:23:02,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:23:02,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 15:23:02,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 15:23:02,780 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:23:02,801 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2024-11-03 15:23:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 15:23:02,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-11-03 15:23:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:23:02,802 INFO L225 Difference]: With dead ends: 70 [2024-11-03 15:23:02,802 INFO L226 Difference]: Without dead ends: 63 [2024-11-03 15:23:02,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 15:23:02,803 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 14 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 15:23:02,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 170 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 15:23:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-03 15:23:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-11-03 15:23:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:23:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2024-11-03 15:23:02,809 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 72 [2024-11-03 15:23:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:23:02,809 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2024-11-03 15:23:02,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2024-11-03 15:23:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-03 15:23:02,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:23:02,811 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:02,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (6)] Forceful destruction successful, exit code 0 [2024-11-03 15:23:03,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:03,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:23:03,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:23:03,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1352872087, now seen corresponding path program 1 times [2024-11-03 15:23:03,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:23:03,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512464841] [2024-11-03 15:23:03,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:23:03,014 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:23:03,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:03,015 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:23:03,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (7)] Waiting until timeout for monitored process [2024-11-03 15:23:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:23:03,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 15:23:03,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:23:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-03 15:23:03,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:23:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-03 15:23:03,168 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:23:03,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512464841] [2024-11-03 15:23:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1512464841] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 15:23:03,169 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 15:23:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-03 15:23:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736764847] [2024-11-03 15:23:03,169 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 15:23:03,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 15:23:03,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:23:03,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 15:23:03,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-03 15:23:03,171 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:03,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:23:03,214 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-11-03 15:23:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 15:23:03,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-03 15:23:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:23:03,215 INFO L225 Difference]: With dead ends: 67 [2024-11-03 15:23:03,215 INFO L226 Difference]: Without dead ends: 61 [2024-11-03 15:23:03,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-03 15:23:03,216 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 15:23:03,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 15:23:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-03 15:23:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-03 15:23:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:23:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2024-11-03 15:23:03,227 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 73 [2024-11-03 15:23:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:23:03,228 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2024-11-03 15:23:03,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2024-11-03 15:23:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-03 15:23:03,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:23:03,233 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:03,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (7)] Forceful destruction successful, exit code 0 [2024-11-03 15:23:03,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:03,434 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:23:03,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:23:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1231189799, now seen corresponding path program 1 times [2024-11-03 15:23:03,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:23:03,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [644085114] [2024-11-03 15:23:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:23:03,435 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:23:03,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:03,436 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:23:03,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (8)] Waiting until timeout for monitored process [2024-11-03 15:23:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:23:03,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 15:23:03,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:23:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-03 15:23:03,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:23:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-03 15:23:03,586 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:23:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [644085114] [2024-11-03 15:23:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [644085114] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 15:23:03,586 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 15:23:03,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 15:23:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144735590] [2024-11-03 15:23:03,586 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 15:23:03,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 15:23:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:23:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 15:23:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 15:23:03,587 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:23:03,662 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-11-03 15:23:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 15:23:03,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-11-03 15:23:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:23:03,664 INFO L225 Difference]: With dead ends: 82 [2024-11-03 15:23:03,664 INFO L226 Difference]: Without dead ends: 66 [2024-11-03 15:23:03,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-03 15:23:03,665 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 33 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 15:23:03,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 223 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 15:23:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-03 15:23:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-03 15:23:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:23:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2024-11-03 15:23:03,672 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 80 [2024-11-03 15:23:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:23:03,672 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-11-03 15:23:03,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2024-11-03 15:23:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-03 15:23:03,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:23:03,674 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:03,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (8)] Ended with exit code 0 [2024-11-03 15:23:03,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:03,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:23:03,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:23:03,877 INFO L85 PathProgramCache]: Analyzing trace with hash -710473733, now seen corresponding path program 1 times [2024-11-03 15:23:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:23:03,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1128551622] [2024-11-03 15:23:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:23:03,878 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:23:03,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:03,880 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:23:03,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (9)] Waiting until timeout for monitored process [2024-11-03 15:23:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:23:03,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 15:23:03,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:23:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-03 15:23:04,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:23:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-03 15:23:04,109 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:23:04,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1128551622] [2024-11-03 15:23:04,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1128551622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 15:23:04,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 15:23:04,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 15:23:04,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393701789] [2024-11-03 15:23:04,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 15:23:04,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 15:23:04,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:23:04,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 15:23:04,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-03 15:23:04,112 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:23:04,347 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2024-11-03 15:23:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-03 15:23:04,348 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 89 [2024-11-03 15:23:04,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:23:04,349 INFO L225 Difference]: With dead ends: 107 [2024-11-03 15:23:04,350 INFO L226 Difference]: Without dead ends: 90 [2024-11-03 15:23:04,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-11-03 15:23:04,351 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 15:23:04,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 395 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 15:23:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-03 15:23:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2024-11-03 15:23:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:23:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2024-11-03 15:23:04,358 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 89 [2024-11-03 15:23:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:23:04,359 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-11-03 15:23:04,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2024-11-03 15:23:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-03 15:23:04,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:23:04,360 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:04,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (9)] Forceful destruction successful, exit code 0 [2024-11-03 15:23:04,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:04,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:23:04,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:23:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash 866534843, now seen corresponding path program 2 times [2024-11-03 15:23:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:23:04,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1667858697] [2024-11-03 15:23:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:23:04,564 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:23:04,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:04,565 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:23:04,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (10)] Waiting until timeout for monitored process [2024-11-03 15:23:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:23:04,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-03 15:23:04,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:23:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 66 proven. 51 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-03 15:23:04,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:23:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 66 proven. 51 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-03 15:23:04,942 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:23:04,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1667858697] [2024-11-03 15:23:04,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1667858697] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 15:23:04,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 15:23:04,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-03 15:23:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141838807] [2024-11-03 15:23:04,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 15:23:04,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-03 15:23:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:23:04,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-03 15:23:04,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-03 15:23:04,945 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:23:05,205 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2024-11-03 15:23:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-03 15:23:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 107 [2024-11-03 15:23:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:23:05,206 INFO L225 Difference]: With dead ends: 113 [2024-11-03 15:23:05,206 INFO L226 Difference]: Without dead ends: 90 [2024-11-03 15:23:05,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2024-11-03 15:23:05,207 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 32 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 15:23:05,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 706 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 15:23:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-03 15:23:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-03 15:23:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.0657894736842106) internal successors, (81), 76 states have internal predecessors, (81), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:23:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-03 15:23:05,222 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 107 [2024-11-03 15:23:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:23:05,223 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-03 15:23:05,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-03 15:23:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-03 15:23:05,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:23:05,226 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:05,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (10)] Ended with exit code 0 [2024-11-03 15:23:05,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:05,426 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:23:05,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:23:05,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1984226921, now seen corresponding path program 3 times [2024-11-03 15:23:05,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:23:05,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [488116819] [2024-11-03 15:23:05,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:23:05,427 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:23:05,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:05,429 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:23:05,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (11)] Waiting until timeout for monitored process [2024-11-03 15:23:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:23:05,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-03 15:23:05,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:23:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 4 proven. 87 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-03 15:23:05,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:23:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 4 proven. 87 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-03 15:23:05,755 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:23:05,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [488116819] [2024-11-03 15:23:05,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [488116819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 15:23:05,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 15:23:05,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-03 15:23:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282105161] [2024-11-03 15:23:05,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 15:23:05,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-03 15:23:05,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:23:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-03 15:23:05,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-03 15:23:05,757 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:23:06,284 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2024-11-03 15:23:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-03 15:23:06,284 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 110 [2024-11-03 15:23:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:23:06,286 INFO L225 Difference]: With dead ends: 148 [2024-11-03 15:23:06,286 INFO L226 Difference]: Without dead ends: 134 [2024-11-03 15:23:06,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2024-11-03 15:23:06,287 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 86 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 15:23:06,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 521 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 15:23:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-03 15:23:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2024-11-03 15:23:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 117 states have (on average 1.0769230769230769) internal successors, (126), 117 states have internal predecessors, (126), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:23:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2024-11-03 15:23:06,298 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 110 [2024-11-03 15:23:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:23:06,298 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2024-11-03 15:23:06,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2024-11-03 15:23:06,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-03 15:23:06,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:23:06,300 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:06,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (11)] Ended with exit code 0 [2024-11-03 15:23:06,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:06,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:23:06,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:23:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2129542763, now seen corresponding path program 4 times [2024-11-03 15:23:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:23:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [384353380] [2024-11-03 15:23:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:23:06,502 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:23:06,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:06,503 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:23:06,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (12)] Waiting until timeout for monitored process [2024-11-03 15:23:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:23:06,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 15:23:06,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:23:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-03 15:23:06,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:23:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-03 15:23:06,819 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:23:06,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [384353380] [2024-11-03 15:23:06,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [384353380] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 15:23:06,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 15:23:06,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-03 15:23:06,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369901017] [2024-11-03 15:23:06,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 15:23:06,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 15:23:06,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:23:06,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 15:23:06,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-03 15:23:06,821 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:23:06,914 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2024-11-03 15:23:06,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 15:23:06,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 119 [2024-11-03 15:23:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:23:06,915 INFO L225 Difference]: With dead ends: 149 [2024-11-03 15:23:06,915 INFO L226 Difference]: Without dead ends: 142 [2024-11-03 15:23:06,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-03 15:23:06,916 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 24 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 15:23:06,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 412 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 15:23:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-03 15:23:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-03 15:23:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 131 states have (on average 1.0687022900763359) internal successors, (140), 131 states have internal predecessors, (140), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:23:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2024-11-03 15:23:06,930 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 119 [2024-11-03 15:23:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:23:06,930 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2024-11-03 15:23:06,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2024-11-03 15:23:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-03 15:23:06,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:23:06,932 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:06,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (12)] Forceful destruction successful, exit code 0 [2024-11-03 15:23:07,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:07,134 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:23:07,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:23:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash 719415003, now seen corresponding path program 5 times [2024-11-03 15:23:07,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:23:07,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1003694800] [2024-11-03 15:23:07,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:23:07,135 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:23:07,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:07,136 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:23:07,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (13)] Waiting until timeout for monitored process [2024-11-03 15:23:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:23:07,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-03 15:23:07,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:23:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 412 proven. 346 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-03 15:23:07,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:23:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 412 proven. 346 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-03 15:23:07,618 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:23:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1003694800] [2024-11-03 15:23:07,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1003694800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 15:23:07,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 15:23:07,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-03 15:23:07,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915733649] [2024-11-03 15:23:07,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 15:23:07,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-03 15:23:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:23:07,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-03 15:23:07,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-03 15:23:07,620 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:08,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:23:08,109 INFO L93 Difference]: Finished difference Result 187 states and 205 transitions. [2024-11-03 15:23:08,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-03 15:23:08,110 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 165 [2024-11-03 15:23:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:23:08,111 INFO L225 Difference]: With dead ends: 187 [2024-11-03 15:23:08,111 INFO L226 Difference]: Without dead ends: 147 [2024-11-03 15:23:08,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2024-11-03 15:23:08,113 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 48 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 15:23:08,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 848 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 15:23:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-03 15:23:08,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-11-03 15:23:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 134 states have (on average 1.0671641791044777) internal successors, (143), 134 states have internal predecessors, (143), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:23:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2024-11-03 15:23:08,123 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 165 [2024-11-03 15:23:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:23:08,123 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2024-11-03 15:23:08,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2024-11-03 15:23:08,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-03 15:23:08,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:23:08,125 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:08,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (13)] Forceful destruction successful, exit code 0 [2024-11-03 15:23:08,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:08,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:23:08,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:23:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash -232918615, now seen corresponding path program 6 times [2024-11-03 15:23:08,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:23:08,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [805410124] [2024-11-03 15:23:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:23:08,327 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:23:08,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:08,329 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:23:08,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (14)] Waiting until timeout for monitored process [2024-11-03 15:23:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:23:08,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-03 15:23:08,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:23:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 128 proven. 728 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-03 15:23:08,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:23:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 128 proven. 728 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-03 15:23:08,853 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:23:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [805410124] [2024-11-03 15:23:08,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [805410124] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 15:23:08,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 15:23:08,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-03 15:23:08,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016249555] [2024-11-03 15:23:08,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 15:23:08,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-03 15:23:08,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:23:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-03 15:23:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-03 15:23:08,855 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:23:09,167 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2024-11-03 15:23:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-03 15:23:09,168 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 168 [2024-11-03 15:23:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:23:09,169 INFO L225 Difference]: With dead ends: 177 [2024-11-03 15:23:09,169 INFO L226 Difference]: Without dead ends: 160 [2024-11-03 15:23:09,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2024-11-03 15:23:09,170 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 51 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 15:23:09,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 581 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 15:23:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-03 15:23:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2024-11-03 15:23:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 143 states have (on average 1.062937062937063) internal successors, (152), 143 states have internal predecessors, (152), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:23:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2024-11-03 15:23:09,180 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 168 [2024-11-03 15:23:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:23:09,180 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2024-11-03 15:23:09,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2024-11-03 15:23:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-03 15:23:09,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:23:09,182 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:09,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (14)] Ended with exit code 0 [2024-11-03 15:23:09,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:09,384 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:23:09,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:23:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1416794837, now seen corresponding path program 7 times [2024-11-03 15:23:09,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:23:09,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [916376171] [2024-11-03 15:23:09,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:23:09,385 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:23:09,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:09,387 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:23:09,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (15)] Waiting until timeout for monitored process [2024-11-03 15:23:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 15:23:09,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-03 15:23:09,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 15:23:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 0 proven. 1086 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-11-03 15:23:09,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 15:23:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 0 proven. 1086 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-11-03 15:23:09,927 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 15:23:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [916376171] [2024-11-03 15:23:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [916376171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 15:23:09,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 15:23:09,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-03 15:23:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79285079] [2024-11-03 15:23:09,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 15:23:09,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-03 15:23:09,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 15:23:09,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-03 15:23:09,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-03 15:23:09,929 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 15:23:10,052 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2024-11-03 15:23:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-03 15:23:10,052 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 177 [2024-11-03 15:23:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 15:23:10,053 INFO L225 Difference]: With dead ends: 174 [2024-11-03 15:23:10,054 INFO L226 Difference]: Without dead ends: 167 [2024-11-03 15:23:10,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-03 15:23:10,054 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 11 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 15:23:10,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 728 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 15:23:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-03 15:23:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 161. [2024-11-03 15:23:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 150 states have (on average 1.0666666666666667) internal successors, (160), 150 states have internal predecessors, (160), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 15:23:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2024-11-03 15:23:10,066 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 177 [2024-11-03 15:23:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 15:23:10,066 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2024-11-03 15:23:10,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 15:23:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2024-11-03 15:23:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-03 15:23:10,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 15:23:10,068 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:10,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (15)] Ended with exit code 0 [2024-11-03 15:23:10,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:10,270 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 15:23:10,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 15:23:10,271 INFO L85 PathProgramCache]: Analyzing trace with hash 773529361, now seen corresponding path program 8 times [2024-11-03 15:23:10,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 15:23:10,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1393583105] [2024-11-03 15:23:10,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 15:23:10,271 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 15:23:10,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:10,273 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 15:23:10,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (16)] Waiting until timeout for monitored process [2024-11-03 15:23:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 15:23:10,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 15:23:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 15:23:10,571 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-03 15:23:10,571 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-03 15:23:10,572 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 15:23:10,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (16)] Ended with exit code 0 [2024-11-03 15:23:10,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 15:23:10,780 INFO L407 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 15:23:10,863 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 15:23:10,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:23:10 BoogieIcfgContainer [2024-11-03 15:23:10,865 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 15:23:10,866 INFO L158 Benchmark]: Toolchain (without parser) took 16438.99ms. Allocated memory is still 281.0MB. Free memory was 228.1MB in the beginning and 225.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.3MB. Max. memory is 8.0GB. [2024-11-03 15:23:10,867 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory was 144.9MB in the beginning and 144.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 15:23:10,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.26ms. Allocated memory is still 281.0MB. Free memory was 228.1MB in the beginning and 214.4MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-03 15:23:10,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.14ms. Allocated memory is still 281.0MB. Free memory was 214.4MB in the beginning and 212.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 15:23:10,868 INFO L158 Benchmark]: Boogie Preprocessor took 56.87ms. Allocated memory is still 281.0MB. Free memory was 212.2MB in the beginning and 209.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 15:23:10,868 INFO L158 Benchmark]: RCFGBuilder took 471.39ms. Allocated memory is still 281.0MB. Free memory was 209.3MB in the beginning and 188.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-11-03 15:23:10,868 INFO L158 Benchmark]: TraceAbstraction took 15583.12ms. Allocated memory is still 281.0MB. Free memory was 188.3MB in the beginning and 225.6MB in the end (delta: -37.3MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 15:23:10,869 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.13ms. Allocated memory is still 190.8MB. Free memory was 144.9MB in the beginning and 144.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.26ms. Allocated memory is still 281.0MB. Free memory was 228.1MB in the beginning and 214.4MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.14ms. Allocated memory is still 281.0MB. Free memory was 214.4MB in the beginning and 212.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.87ms. Allocated memory is still 281.0MB. Free memory was 212.2MB in the beginning and 209.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 471.39ms. Allocated memory is still 281.0MB. Free memory was 209.3MB in the beginning and 188.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 15583.12ms. Allocated memory is still 281.0MB. Free memory was 188.3MB in the beginning and 225.6MB in the end (delta: -37.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L58] int s, e, n, d, m, o, r, y; [L59] s = __VERIFIER_nondet_int() [L60] e = __VERIFIER_nondet_int() [L61] n = __VERIFIER_nondet_int() [L62] d = __VERIFIER_nondet_int() [L63] m = __VERIFIER_nondet_int() [L64] o = __VERIFIER_nondet_int() [L65] r = __VERIFIER_nondet_int() [L66] y = __VERIFIER_nondet_int() [L67] CALL, EXPR solve(s, e, n, d, m, o, r, y) [L46] CALL, EXPR check_domain_1(S) VAL [\old(x)=9] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=9, \result=1] [L46] RET, EXPR check_domain_1(S) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(E) VAL [\old(x)=5] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=5, \result=1] [L46] RET, EXPR check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(N) VAL [\old(x)=6] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=6, \result=1] [L46] RET, EXPR check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(D) VAL [\old(x)=7] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=7, \result=1] [L47] RET, EXPR check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_1(M) VAL [\old(x)=1] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=1, \result=1] [L47] RET, EXPR check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(O) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=0, \result=1] [L47] RET, EXPR check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(R) VAL [\old(x)=8] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=8, \result=1] [L48] RET, EXPR check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(Y) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=2, \result=1] [L48] RET, EXPR check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L51] CALL, EXPR check_diff(S, E, N, D, M, O, R, Y) [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L38] int i = 0; VAL [d={6:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={6:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=0, j=8] [L39] COND FALSE !(j < 8) VAL [d={6:0}, i=0] [L38] i++ VAL [d={6:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={6:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=1, j=8] [L39] COND FALSE !(j < 8) VAL [d={6:0}, i=1] [L38] i++ VAL [d={6:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={6:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=2, j=8] [L39] COND FALSE !(j < 8) VAL [d={6:0}, i=2] [L38] i++ VAL [d={6:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={6:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=3, j=8] [L39] COND FALSE !(j < 8) VAL [d={6:0}, i=3] [L38] i++ VAL [d={6:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={6:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=4, j=8] [L39] COND FALSE !(j < 8) VAL [d={6:0}, i=4] [L38] i++ VAL [d={6:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={6:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=5, j=8] [L39] COND FALSE !(j < 8) VAL [d={6:0}, i=5] [L38] i++ VAL [d={6:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={6:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={6:0}, i=6, j=8] [L39] COND FALSE !(j < 8) VAL [d={6:0}, i=6] [L38] i++ VAL [d={6:0}, i=7] [L38] COND FALSE !(i < 7) VAL [d={6:0}] [L42] return 1; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L42] return 1; VAL [\result=1] [L51] RET, EXPR check_diff(S, E, N, D, M, O, R, Y) [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L46-L51] COND TRUE check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L52] return 1; VAL [\result=1] [L67] RET, EXPR solve(s, e, n, d, m, o, r, y) [L67] CALL __VERIFIER_assert(!solve(s, e, n, d, m, o, r, y)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 15, TraceHistogramMax: 28, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 350 mSDsluCounter, 6212 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5269 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1475 IncrementalHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 943 mSDtfsCounter, 1475 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2584 GetRequests, 2396 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=14, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 35 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1455 NumberOfCodeBlocks, 1455 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2514 ConstructedInterpolants, 0 QuantifiedInterpolants, 5095 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2656 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 4120/9016 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! [2024-11-03 15:23:10,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...