./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/diamond_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/diamond_1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd9be28702be20fbd75b67eebfdc5f85895ff340c238c235c391c2a8578e7b23 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:04:08,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:04:08,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:04:08,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:04:08,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:04:08,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:04:08,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:04:08,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:04:08,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:04:08,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:04:08,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:04:08,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:04:08,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:04:08,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:04:08,686 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:04:08,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:04:08,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:04:08,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:04:08,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:04:08,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:04:08,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:04:08,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:04:08,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:04:08,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:04:08,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:04:08,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:04:08,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:04:08,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:04:08,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:04:08,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:04:08,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:04:08,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:04:08,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:04:08,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:04:08,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:04:08,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:04:08,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:04:08,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:04:08,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:04:08,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:04:08,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:04:08,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:04:08,695 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd9be28702be20fbd75b67eebfdc5f85895ff340c238c235c391c2a8578e7b23 [2024-11-08 14:04:08,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:04:08,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:04:08,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:04:08,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:04:08,902 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:04:08,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2024-11-08 14:04:10,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:04:10,400 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:04:10,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2024-11-08 14:04:10,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8384b7ea2/56c894fa873a4fd0a0c06e51f3c27c2c/FLAG38b2e31bf [2024-11-08 14:04:10,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8384b7ea2/56c894fa873a4fd0a0c06e51f3c27c2c [2024-11-08 14:04:10,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:04:10,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:04:10,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:04:10,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:04:10,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:04:10,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dacd1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10, skipping insertion in model container [2024-11-08 14:04:10,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:04:10,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/diamond_1-1.c[373,386] [2024-11-08 14:04:10,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:04:10,618 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:04:10,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/diamond_1-1.c[373,386] [2024-11-08 14:04:10,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:04:10,643 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:04:10,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10 WrapperNode [2024-11-08 14:04:10,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:04:10,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:04:10,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:04:10,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:04:10,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,668 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 29 [2024-11-08 14:04:10,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:04:10,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:04:10,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:04:10,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:04:10,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,684 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 14:04:10,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:04:10,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:04:10,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:04:10,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:04:10,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (1/1) ... [2024-11-08 14:04:10,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:04:10,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:04:10,726 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-08 14:04:10,733 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-08 14:04:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:04:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:04:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:04:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:04:10,818 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:04:10,821 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:04:10,906 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-08 14:04:10,908 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:04:10,919 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:04:10,919 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:04:10,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:04:10 BoogieIcfgContainer [2024-11-08 14:04:10,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:04:10,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:04:10,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:04:10,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:04:10,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:04:10" (1/3) ... [2024-11-08 14:04:10,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d9de07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:04:10, skipping insertion in model container [2024-11-08 14:04:10,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:04:10" (2/3) ... [2024-11-08 14:04:10,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d9de07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:04:10, skipping insertion in model container [2024-11-08 14:04:10,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:04:10" (3/3) ... [2024-11-08 14:04:10,926 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2024-11-08 14:04:10,937 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:04:10,937 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:04:10,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:04:10,987 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;@5026631f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:04:10,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:04:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 14:04:10,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:04:10,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 14:04:10,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:04:10,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:04:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2024-11-08 14:04:11,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:04:11,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216938441] [2024-11-08 14:04:11,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:11,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:04:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:11,103 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-08 14:04:11,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:04:11,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216938441] [2024-11-08 14:04:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216938441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:04:11,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:04:11,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 14:04:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306488507] [2024-11-08 14:04:11,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:04:11,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 14:04:11,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:04:11,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 14:04:11,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:04:11,127 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:04:11,136 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2024-11-08 14:04:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 14:04:11,138 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 14:04:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:04:11,143 INFO L225 Difference]: With dead ends: 20 [2024-11-08 14:04:11,143 INFO L226 Difference]: Without dead ends: 8 [2024-11-08 14:04:11,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:04:11,147 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:04:11,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:04:11,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-11-08 14:04:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-08 14:04:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2024-11-08 14:04:11,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2024-11-08 14:04:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:04:11,180 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-08 14:04:11,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2024-11-08 14:04:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 14:04:11,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:04:11,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 14:04:11,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:04:11,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:04:11,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:04:11,182 INFO L85 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2024-11-08 14:04:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:04:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136799624] [2024-11-08 14:04:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:04:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:11,334 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-08 14:04:11,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:04:11,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136799624] [2024-11-08 14:04:11,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136799624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:04:11,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:04:11,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:04:11,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613720239] [2024-11-08 14:04:11,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:04:11,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:04:11,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:04:11,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:04:11,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:04:11,339 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:04:11,351 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-11-08 14:04:11,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:04:11,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 14:04:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:04:11,353 INFO L225 Difference]: With dead ends: 14 [2024-11-08 14:04:11,353 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 14:04:11,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 14:04:11,354 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:04:11,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:04:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 14:04:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 14:04:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-08 14:04:11,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2024-11-08 14:04:11,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:04:11,358 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-08 14:04:11,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-11-08 14:04:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 14:04:11,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:04:11,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:04:11,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:04:11,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:04:11,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:04:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash 297538966, now seen corresponding path program 1 times [2024-11-08 14:04:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:04:11,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268423608] [2024-11-08 14:04:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:04:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:11,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:04:11,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268423608] [2024-11-08 14:04:11,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268423608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:04:11,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014688036] [2024-11-08 14:04:11,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:11,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:11,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:04:11,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:04:11,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 14:04:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:11,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 14:04:11,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:04:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:11,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:04:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:11,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014688036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:04:11,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:04:11,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-08 14:04:11,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25700652] [2024-11-08 14:04:11,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:04:11,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:04:11,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:04:11,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:04:11,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:04:11,656 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:04:11,703 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2024-11-08 14:04:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:04:11,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 14:04:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:04:11,704 INFO L225 Difference]: With dead ends: 19 [2024-11-08 14:04:11,704 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 14:04:11,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:04:11,705 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:04:11,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 12 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:04:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 14:04:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 14:04:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-11-08 14:04:11,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2024-11-08 14:04:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:04:11,709 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-08 14:04:11,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2024-11-08 14:04:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 14:04:11,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:04:11,710 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 14:04:11,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 14:04:11,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:11,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:04:11,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:04:11,912 INFO L85 PathProgramCache]: Analyzing trace with hash 742440183, now seen corresponding path program 1 times [2024-11-08 14:04:11,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:04:11,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459633539] [2024-11-08 14:04:11,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:11,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:04:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:11,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:04:11,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459633539] [2024-11-08 14:04:11,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459633539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:04:11,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807569678] [2024-11-08 14:04:11,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:11,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:11,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:04:11,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:04:11,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 14:04:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:12,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 14:04:12,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:04:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:12,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:04:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:12,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807569678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:04:12,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:04:12,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-08 14:04:12,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829922873] [2024-11-08 14:04:12,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:04:12,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 14:04:12,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:04:12,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 14:04:12,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-08 14:04:12,068 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:04:12,145 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2024-11-08 14:04:12,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:04:12,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 14:04:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:04:12,146 INFO L225 Difference]: With dead ends: 30 [2024-11-08 14:04:12,146 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 14:04:12,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:04:12,147 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:04:12,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:04:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 14:04:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2024-11-08 14:04:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-08 14:04:12,151 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 10 [2024-11-08 14:04:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:04:12,152 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-08 14:04:12,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-11-08 14:04:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 14:04:12,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:04:12,152 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2024-11-08 14:04:12,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 14:04:12,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 14:04:12,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:04:12,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:04:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash -533681750, now seen corresponding path program 2 times [2024-11-08 14:04:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:04:12,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527354616] [2024-11-08 14:04:12,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:12,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:04:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:12,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:04:12,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527354616] [2024-11-08 14:04:12,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527354616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:04:12,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93424811] [2024-11-08 14:04:12,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:04:12,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:12,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:04:12,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:04:12,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 14:04:12,523 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:04:12,523 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:04:12,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 14:04:12,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:04:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:12,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:04:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:12,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93424811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:04:12,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:04:12,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-08 14:04:12,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970723989] [2024-11-08 14:04:12,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:04:12,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 14:04:12,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:04:12,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 14:04:12,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-08 14:04:12,644 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:04:12,909 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2024-11-08 14:04:12,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:04:12,910 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-08 14:04:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:04:12,911 INFO L225 Difference]: With dead ends: 65 [2024-11-08 14:04:12,911 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 14:04:12,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=230, Unknown=0, NotChecked=0, Total=380 [2024-11-08 14:04:12,912 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:04:12,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 24 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:04:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 14:04:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 31. [2024-11-08 14:04:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2024-11-08 14:04:12,953 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2024-11-08 14:04:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:04:12,953 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2024-11-08 14:04:12,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2024-11-08 14:04:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:04:12,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:04:12,954 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2024-11-08 14:04:13,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 14:04:13,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:13,159 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:04:13,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:04:13,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1288795907, now seen corresponding path program 2 times [2024-11-08 14:04:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:04:13,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98543732] [2024-11-08 14:04:13,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:13,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:04:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:13,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:04:13,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98543732] [2024-11-08 14:04:13,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98543732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:04:13,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326036271] [2024-11-08 14:04:13,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:04:13,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:13,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:04:13,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:04:13,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 14:04:13,365 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:04:13,365 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:04:13,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 14:04:13,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:04:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:13,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:04:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326036271] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:04:13,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:04:13,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-08 14:04:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781174412] [2024-11-08 14:04:13,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:04:13,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 14:04:13,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:04:13,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 14:04:13,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-11-08 14:04:13,542 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:04:14,080 INFO L93 Difference]: Finished difference Result 143 states and 211 transitions. [2024-11-08 14:04:14,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 14:04:14,080 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-08 14:04:14,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:04:14,081 INFO L225 Difference]: With dead ends: 143 [2024-11-08 14:04:14,081 INFO L226 Difference]: Without dead ends: 139 [2024-11-08 14:04:14,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:04:14,086 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:04:14,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 30 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:04:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-08 14:04:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2024-11-08 14:04:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.472972972972973) internal successors, (109), 74 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-11-08 14:04:14,116 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 18 [2024-11-08 14:04:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:04:14,116 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-11-08 14:04:14,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-11-08 14:04:14,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 14:04:14,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:04:14,117 INFO L215 NwaCegarLoop]: trace histogram [9, 6, 3, 1, 1, 1, 1, 1, 1] [2024-11-08 14:04:14,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 14:04:14,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:14,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:04:14,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:04:14,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1917295048, now seen corresponding path program 1 times [2024-11-08 14:04:14,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:04:14,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433912219] [2024-11-08 14:04:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:14,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:04:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:04:14,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:04:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433912219] [2024-11-08 14:04:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433912219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:04:14,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:04:14,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:04:14,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462237620] [2024-11-08 14:04:14,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:04:14,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:04:14,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:04:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:04:14,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:04:14,342 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:04:14,359 INFO L93 Difference]: Finished difference Result 130 states and 189 transitions. [2024-11-08 14:04:14,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:04:14,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-08 14:04:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:04:14,360 INFO L225 Difference]: With dead ends: 130 [2024-11-08 14:04:14,360 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 14:04:14,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 14:04:14,361 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:04:14,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:04:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 14:04:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58. [2024-11-08 14:04:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2024-11-08 14:04:14,372 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 24 [2024-11-08 14:04:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:04:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2024-11-08 14:04:14,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2024-11-08 14:04:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 14:04:14,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:04:14,373 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:04:14,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 14:04:14,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:04:14,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:04:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1773006918, now seen corresponding path program 2 times [2024-11-08 14:04:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:04:14,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747770498] [2024-11-08 14:04:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:14,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:04:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-08 14:04:14,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:04:14,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747770498] [2024-11-08 14:04:14,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747770498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:04:14,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:04:14,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:04:14,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108259449] [2024-11-08 14:04:14,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:04:14,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:04:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:04:14,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:04:14,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:04:14,404 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:04:14,429 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2024-11-08 14:04:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:04:14,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-08 14:04:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:04:14,431 INFO L225 Difference]: With dead ends: 82 [2024-11-08 14:04:14,431 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 14:04:14,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 14:04:14,432 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 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-08 14:04:14,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:04:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 14:04:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-11-08 14:04:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2024-11-08 14:04:14,464 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 28 [2024-11-08 14:04:14,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:04:14,464 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2024-11-08 14:04:14,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2024-11-08 14:04:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 14:04:14,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:04:14,465 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2024-11-08 14:04:14,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 14:04:14,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:04:14,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:04:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash 733049517, now seen corresponding path program 3 times [2024-11-08 14:04:14,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:04:14,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842025869] [2024-11-08 14:04:14,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:14,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:04:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:14,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:04:14,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842025869] [2024-11-08 14:04:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842025869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:04:14,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693903047] [2024-11-08 14:04:14,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:04:14,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:14,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:04:14,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:04:14,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 14:04:14,777 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 14:04:14,777 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:04:14,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 14:04:14,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:04:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 14:04:15,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:04:15,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693903047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:04:15,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:04:15,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2024-11-08 14:04:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865974981] [2024-11-08 14:04:15,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:04:15,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:04:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:04:15,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:04:15,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:04:15,025 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:04:15,078 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2024-11-08 14:04:15,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:04:15,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-08 14:04:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:04:15,078 INFO L225 Difference]: With dead ends: 62 [2024-11-08 14:04:15,078 INFO L226 Difference]: Without dead ends: 35 [2024-11-08 14:04:15,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-08 14:04:15,080 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:04:15,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:04:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-08 14:04:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-08 14:04:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-08 14:04:15,088 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 30 [2024-11-08 14:04:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:04:15,088 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-11-08 14:04:15,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-08 14:04:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 14:04:15,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:04:15,089 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1] [2024-11-08 14:04:15,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 14:04:15,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:15,290 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:04:15,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:04:15,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1122990309, now seen corresponding path program 3 times [2024-11-08 14:04:15,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:04:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196721106] [2024-11-08 14:04:15,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:04:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:15,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:04:15,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196721106] [2024-11-08 14:04:15,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196721106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:04:15,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896359114] [2024-11-08 14:04:15,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:04:15,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:15,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:04:15,615 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:04:15,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 14:04:15,670 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-08 14:04:15,670 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:04:15,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 14:04:15,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:04:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:15,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:04:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:16,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896359114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:04:16,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:04:16,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2024-11-08 14:04:16,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752031620] [2024-11-08 14:04:16,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:04:16,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-08 14:04:16,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:04:16,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-08 14:04:16,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 14:04:16,284 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:04:27,719 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2024-11-08 14:04:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 14:04:27,719 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-08 14:04:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:04:27,720 INFO L225 Difference]: With dead ends: 71 [2024-11-08 14:04:27,720 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 14:04:27,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=780, Invalid=1382, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 14:04:27,721 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:04:27,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 63 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 14:04:27,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 14:04:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-08 14:04:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2024-11-08 14:04:27,728 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 34 [2024-11-08 14:04:27,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:04:27,729 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2024-11-08 14:04:27,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2024-11-08 14:04:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 14:04:27,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:04:27,730 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1] [2024-11-08 14:04:27,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 14:04:27,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:27,931 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:04:27,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:04:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash -111863989, now seen corresponding path program 4 times [2024-11-08 14:04:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:04:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748275808] [2024-11-08 14:04:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:04:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:04:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:04:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:28,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:04:28,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748275808] [2024-11-08 14:04:28,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748275808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:04:28,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092817394] [2024-11-08 14:04:28,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 14:04:28,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:28,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:04:28,708 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:04:28,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 14:04:28,746 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 14:04:28,746 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:04:28,747 WARN L253 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-08 14:04:28,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:04:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:04:29,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:04:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2024-11-08 14:04:30,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092817394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:04:30,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:04:30,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 5] total 66 [2024-11-08 14:04:30,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400596635] [2024-11-08 14:04:30,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:04:30,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-08 14:04:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:04:30,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-08 14:04:30,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=3982, Unknown=0, NotChecked=0, Total=4290 [2024-11-08 14:04:30,178 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 66 states, 66 states have (on average 2.0454545454545454) internal successors, (135), 66 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:04:31,224 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2024-11-08 14:04:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-08 14:04:31,225 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0454545454545454) internal successors, (135), 66 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-08 14:04:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:04:31,226 INFO L225 Difference]: With dead ends: 72 [2024-11-08 14:04:31,226 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 14:04:31,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=342, Invalid=4080, Unknown=0, NotChecked=0, Total=4422 [2024-11-08 14:04:31,228 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2745 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:04:31,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 13 Invalid, 2747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2745 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 14:04:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 14:04:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 14:04:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 14:04:31,229 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2024-11-08 14:04:31,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:04:31,230 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 14:04:31,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0454545454545454) internal successors, (135), 66 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:04:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 14:04:31,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 14:04:31,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 14:04:31,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 14:04:31,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:04:31,440 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1] [2024-11-08 14:04:31,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 14:04:52,147 WARN L286 SmtUtils]: Spent 20.25s on a formula simplification. DAG size of input: 200 DAG size of output: 19 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-08 14:04:52,151 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 14:04:52,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 02:04:52 BoogieIcfgContainer [2024-11-08 14:04:52,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 14:04:52,161 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 14:04:52,161 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 14:04:52,161 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 14:04:52,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:04:10" (3/4) ... [2024-11-08 14:04:52,163 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 14:04:52,168 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-08 14:04:52,168 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 14:04:52,168 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 14:04:52,168 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 14:04:52,237 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 14:04:52,238 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 14:04:52,238 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 14:04:52,239 INFO L158 Benchmark]: Toolchain (without parser) took 41819.94ms. Allocated memory was 157.3MB in the beginning and 255.9MB in the end (delta: 98.6MB). Free memory was 91.3MB in the beginning and 141.1MB in the end (delta: -49.8MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-11-08 14:04:52,239 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 157.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:04:52,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.87ms. Allocated memory is still 157.3MB. Free memory was 91.1MB in the beginning and 128.4MB in the end (delta: -37.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-08 14:04:52,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.30ms. Allocated memory is still 157.3MB. Free memory was 128.4MB in the beginning and 126.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:04:52,240 INFO L158 Benchmark]: Boogie Preprocessor took 24.01ms. Allocated memory is still 157.3MB. Free memory was 126.9MB in the beginning and 125.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:04:52,240 INFO L158 Benchmark]: RCFGBuilder took 225.56ms. Allocated memory is still 157.3MB. Free memory was 125.4MB in the beginning and 115.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 14:04:52,240 INFO L158 Benchmark]: TraceAbstraction took 41239.41ms. Allocated memory was 157.3MB in the beginning and 255.9MB in the end (delta: 98.6MB). Free memory was 114.4MB in the beginning and 145.3MB in the end (delta: -30.9MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. [2024-11-08 14:04:52,240 INFO L158 Benchmark]: Witness Printer took 76.97ms. Allocated memory is still 255.9MB. Free memory was 145.3MB in the beginning and 141.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 14:04:52,242 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.16ms. Allocated memory is still 157.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.87ms. Allocated memory is still 157.3MB. Free memory was 91.1MB in the beginning and 128.4MB in the end (delta: -37.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.30ms. Allocated memory is still 157.3MB. Free memory was 128.4MB in the beginning and 126.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.01ms. Allocated memory is still 157.3MB. Free memory was 126.9MB in the beginning and 125.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 225.56ms. Allocated memory is still 157.3MB. Free memory was 125.4MB in the beginning and 115.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41239.41ms. Allocated memory was 157.3MB in the beginning and 255.9MB in the end (delta: 98.6MB). Free memory was 114.4MB in the beginning and 145.3MB in the end (delta: -30.9MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. * Witness Printer took 76.97ms. Allocated memory is still 255.9MB. Free memory was 145.3MB in the beginning and 141.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 - PositiveResult [Line: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 11, TraceHistogramMax: 30, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3753 IncrementalHoareTripleChecker+Invalid, 3860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 75 mSDtfsCounter, 3753 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=6, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 130 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 428 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 2333 SizeOfPredicates, 1 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 1187/3976 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((y % 2) == 0) && ((x % 2) == 0)) || ((((4294967295 + x) % 4294967296) <= 98) && ((y % 2) != 0))) || (x == 0)) RESULT: Ultimate proved your program to be correct! [2024-11-08 14:04:52,289 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE