./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/eca-rers2012/Problem02_label01.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 d471a677e512dd3a7f76c682c4bf3cc875f41115224349694597713a7863b710 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:19:26,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:19:26,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:19:26,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:19:26,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:19:27,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:19:27,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:19:27,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:19:27,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:19:27,010 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:19:27,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:19:27,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:19:27,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:19:27,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:19:27,014 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:19:27,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:19:27,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:19:27,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:19:27,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:19:27,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:19:27,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:19:27,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:19:27,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:19:27,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:19:27,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:19:27,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:19:27,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:19:27,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:19:27,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:19:27,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:19:27,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:19:27,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:19:27,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:19:27,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:19:27,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:19:27,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:19:27,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:19:27,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:19:27,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:19:27,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:19:27,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:19:27,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:19:27,028 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 -> d471a677e512dd3a7f76c682c4bf3cc875f41115224349694597713a7863b710 [2024-11-21 21:19:27,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:19:27,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:19:27,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:19:27,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:19:27,299 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:19:27,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label01.c [2024-11-21 21:19:28,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:19:28,915 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:19:28,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label01.c [2024-11-21 21:19:28,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d77c88de/eba11711c8874741858fe72bd58c1105/FLAG16ea26cde [2024-11-21 21:19:28,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d77c88de/eba11711c8874741858fe72bd58c1105 [2024-11-21 21:19:28,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:19:28,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:19:28,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:19:28,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:19:28,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:19:28,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:19:28" (1/1) ... [2024-11-21 21:19:28,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cce1a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:28, skipping insertion in model container [2024-11-21 21:19:28,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:19:28" (1/1) ... [2024-11-21 21:19:29,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:19:29,327 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/eca-rers2012/Problem02_label01.c[18261,18274] [2024-11-21 21:19:29,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:19:29,380 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:19:29,488 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/eca-rers2012/Problem02_label01.c[18261,18274] [2024-11-21 21:19:29,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:19:29,527 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:19:29,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29 WrapperNode [2024-11-21 21:19:29,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:19:29,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:19:29,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:19:29,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:19:29,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,604 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-21 21:19:29,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:19:29,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:19:29,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:19:29,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:19:29,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,664 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-21 21:19:29,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:19:29,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:19:29,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:19:29,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:19:29,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (1/1) ... [2024-11-21 21:19:29,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:19:29,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:19:29,752 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-21 21:19:29,758 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-21 21:19:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:19:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:19:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:19:29,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:19:29,871 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:19:29,873 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:19:30,770 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-21 21:19:30,770 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:19:30,796 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:19:30,797 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 21:19:30,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:19:30 BoogieIcfgContainer [2024-11-21 21:19:30,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:19:30,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:19:30,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:19:30,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:19:30,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:19:28" (1/3) ... [2024-11-21 21:19:30,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b7bab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:19:30, skipping insertion in model container [2024-11-21 21:19:30,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:29" (2/3) ... [2024-11-21 21:19:30,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b7bab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:19:30, skipping insertion in model container [2024-11-21 21:19:30,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:19:30" (3/3) ... [2024-11-21 21:19:30,807 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label01.c [2024-11-21 21:19:30,826 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:19:30,826 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:19:30,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:19:30,945 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;@1f903ef7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:19:30,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:19:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-21 21:19:31,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:31,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:31,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash 394505643, now seen corresponding path program 1 times [2024-11-21 21:19:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:31,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501042495] [2024-11-21 21:19:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:31,619 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-21 21:19:31,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:31,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501042495] [2024-11-21 21:19:31,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501042495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:31,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:31,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:19:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610218292] [2024-11-21 21:19:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:31,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:31,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:31,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:31,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:31,659 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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-21 21:19:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:32,406 INFO L93 Difference]: Finished difference Result 600 states and 1037 transitions. [2024-11-21 21:19:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:32,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 113 [2024-11-21 21:19:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:32,424 INFO L225 Difference]: With dead ends: 600 [2024-11-21 21:19:32,424 INFO L226 Difference]: Without dead ends: 309 [2024-11-21 21:19:32,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 21:19:32,436 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 53 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:32,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 21:19:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-21 21:19:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-21 21:19:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 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-21 21:19:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2024-11-21 21:19:32,487 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 113 [2024-11-21 21:19:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:32,488 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-21 21:19:32,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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-21 21:19:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2024-11-21 21:19:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-21 21:19:32,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:32,493 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:32,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:19:32,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:32,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash -517506560, now seen corresponding path program 1 times [2024-11-21 21:19:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:32,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532809080] [2024-11-21 21:19:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:32,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:32,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532809080] [2024-11-21 21:19:32,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532809080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:32,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:32,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:32,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840573093] [2024-11-21 21:19:32,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:32,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:32,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:32,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:32,746 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-21 21:19:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:33,240 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2024-11-21 21:19:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:33,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 118 [2024-11-21 21:19:33,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:33,248 INFO L225 Difference]: With dead ends: 758 [2024-11-21 21:19:33,248 INFO L226 Difference]: Without dead ends: 453 [2024-11-21 21:19:33,249 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-21 21:19:33,250 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 51 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:33,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:19:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-21 21:19:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-21 21:19:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 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-21 21:19:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions. [2024-11-21 21:19:33,273 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 118 [2024-11-21 21:19:33,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:33,273 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 578 transitions. [2024-11-21 21:19:33,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-21 21:19:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2024-11-21 21:19:33,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-21 21:19:33,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:33,281 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:33,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:19:33,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:33,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:33,282 INFO L85 PathProgramCache]: Analyzing trace with hash 481309147, now seen corresponding path program 1 times [2024-11-21 21:19:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741768320] [2024-11-21 21:19:33,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:33,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:33,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741768320] [2024-11-21 21:19:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741768320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:33,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:19:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55839382] [2024-11-21 21:19:33,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:33,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:33,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:33,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:33,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:33,418 INFO L87 Difference]: Start difference. First operand 453 states and 578 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-21 21:19:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:33,848 INFO L93 Difference]: Finished difference Result 1325 states and 1691 transitions. [2024-11-21 21:19:33,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:33,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 130 [2024-11-21 21:19:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:33,854 INFO L225 Difference]: With dead ends: 1325 [2024-11-21 21:19:33,854 INFO L226 Difference]: Without dead ends: 874 [2024-11-21 21:19:33,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 21:19:33,859 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:33,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:19:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-21 21:19:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-21 21:19:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2302405498281788) internal successors, (1074), 873 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1074 transitions. [2024-11-21 21:19:33,913 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1074 transitions. Word has length 130 [2024-11-21 21:19:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:33,916 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1074 transitions. [2024-11-21 21:19:33,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-21 21:19:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1074 transitions. [2024-11-21 21:19:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-21 21:19:33,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:33,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:33,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:19:33,920 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:33,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:33,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1216422376, now seen corresponding path program 1 times [2024-11-21 21:19:33,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:33,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646695768] [2024-11-21 21:19:33,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:33,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:34,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:34,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646695768] [2024-11-21 21:19:34,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646695768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:34,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:34,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518325598] [2024-11-21 21:19:34,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:34,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:34,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:34,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:34,190 INFO L87 Difference]: Start difference. First operand 874 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-21 21:19:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:34,621 INFO L93 Difference]: Finished difference Result 2027 states and 2555 transitions. [2024-11-21 21:19:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:34,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 143 [2024-11-21 21:19:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:34,627 INFO L225 Difference]: With dead ends: 2027 [2024-11-21 21:19:34,627 INFO L226 Difference]: Without dead ends: 1155 [2024-11-21 21:19:34,628 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-21 21:19:34,630 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 61 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:34,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 226 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:19:34,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-21 21:19:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1154. [2024-11-21 21:19:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.2437120555073722) internal successors, (1434), 1153 states have internal predecessors, (1434), 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-21 21:19:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1434 transitions. [2024-11-21 21:19:34,654 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1434 transitions. Word has length 143 [2024-11-21 21:19:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:34,655 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1434 transitions. [2024-11-21 21:19:34,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-21 21:19:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1434 transitions. [2024-11-21 21:19:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-21 21:19:34,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:34,658 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:34,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 21:19:34,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:34,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash -60920339, now seen corresponding path program 1 times [2024-11-21 21:19:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:34,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316151162] [2024-11-21 21:19:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:34,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:34,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316151162] [2024-11-21 21:19:34,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316151162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:34,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:34,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:19:34,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349626219] [2024-11-21 21:19:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:34,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:34,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:34,818 INFO L87 Difference]: Start difference. First operand 1154 states and 1434 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-21 21:19:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:35,044 INFO L93 Difference]: Finished difference Result 2295 states and 2852 transitions. [2024-11-21 21:19:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:35,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 146 [2024-11-21 21:19:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:35,049 INFO L225 Difference]: With dead ends: 2295 [2024-11-21 21:19:35,049 INFO L226 Difference]: Without dead ends: 1143 [2024-11-21 21:19:35,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 21:19:35,051 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:35,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 23 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 21:19:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2024-11-21 21:19:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2024-11-21 21:19:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.1996497373029773) internal successors, (1370), 1142 states have internal predecessors, (1370), 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-21 21:19:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1370 transitions. [2024-11-21 21:19:35,071 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1370 transitions. Word has length 146 [2024-11-21 21:19:35,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:35,071 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1370 transitions. [2024-11-21 21:19:35,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-21 21:19:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1370 transitions. [2024-11-21 21:19:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-21 21:19:35,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:35,074 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:35,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:19:35,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:35,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash -829809361, now seen corresponding path program 1 times [2024-11-21 21:19:35,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:35,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753527829] [2024-11-21 21:19:35,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:35,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 21:19:35,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:35,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753527829] [2024-11-21 21:19:35,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753527829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:35,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:35,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:35,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384470551] [2024-11-21 21:19:35,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:35,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:35,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:35,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:35,174 INFO L87 Difference]: Start difference. First operand 1143 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-21 21:19:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:35,565 INFO L93 Difference]: Finished difference Result 3128 states and 3710 transitions. [2024-11-21 21:19:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:35,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 152 [2024-11-21 21:19:35,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:35,574 INFO L225 Difference]: With dead ends: 3128 [2024-11-21 21:19:35,574 INFO L226 Difference]: Without dead ends: 1987 [2024-11-21 21:19:35,576 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-21 21:19:35,579 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:35,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 88 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:19:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2024-11-21 21:19:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1704. [2024-11-21 21:19:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 1.171462125660599) internal successors, (1995), 1703 states have internal predecessors, (1995), 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-21 21:19:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 1995 transitions. [2024-11-21 21:19:35,614 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 1995 transitions. Word has length 152 [2024-11-21 21:19:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:35,614 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 1995 transitions. [2024-11-21 21:19:35,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-21 21:19:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 1995 transitions. [2024-11-21 21:19:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-21 21:19:35,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:35,621 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:35,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:19:35,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:35,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:35,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1697776129, now seen corresponding path program 1 times [2024-11-21 21:19:35,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:35,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731193636] [2024-11-21 21:19:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:35,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:35,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:35,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731193636] [2024-11-21 21:19:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731193636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:35,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:35,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:19:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579002249] [2024-11-21 21:19:35,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:35,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:19:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:35,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:19:35,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:19:35,942 INFO L87 Difference]: Start difference. First operand 1704 states and 1995 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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-21 21:19:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:37,028 INFO L93 Difference]: Finished difference Result 4103 states and 4757 transitions. [2024-11-21 21:19:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 21:19:37,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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 166 [2024-11-21 21:19:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:37,029 INFO L225 Difference]: With dead ends: 4103 [2024-11-21 21:19:37,030 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 21:19:37,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-21 21:19:37,034 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 592 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:37,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 70 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-21 21:19:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 21:19:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 21:19:37,035 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-21 21:19:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 21:19:37,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2024-11-21 21:19:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:37,036 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 21:19:37,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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-21 21:19:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 21:19:37,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 21:19:37,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 21:19:37,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:19:37,046 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:37,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 21:19:37,190 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 21:19:37,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:19:37 BoogieIcfgContainer [2024-11-21 21:19:37,212 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 21:19:37,212 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 21:19:37,212 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 21:19:37,212 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 21:19:37,213 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:19:30" (3/4) ... [2024-11-21 21:19:37,216 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 21:19:37,237 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 21:19:37,240 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 21:19:37,240 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 21:19:37,241 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 21:19:37,381 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 21:19:37,381 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 21:19:37,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 21:19:37,382 INFO L158 Benchmark]: Toolchain (without parser) took 8430.54ms. Allocated memory was 146.8MB in the beginning and 234.9MB in the end (delta: 88.1MB). Free memory was 74.1MB in the beginning and 101.1MB in the end (delta: -27.1MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2024-11-21 21:19:37,383 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:19:37,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.53ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 73.9MB in the beginning and 151.5MB in the end (delta: -77.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-11-21 21:19:37,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.60ms. Allocated memory is still 186.6MB. Free memory was 151.5MB in the beginning and 145.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-21 21:19:37,384 INFO L158 Benchmark]: Boogie Preprocessor took 110.18ms. Allocated memory is still 186.6MB. Free memory was 145.2MB in the beginning and 139.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 21:19:37,384 INFO L158 Benchmark]: RCFGBuilder took 1080.70ms. Allocated memory is still 186.6MB. Free memory was 139.9MB in the beginning and 58.1MB in the end (delta: 81.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-21 21:19:37,384 INFO L158 Benchmark]: TraceAbstraction took 6411.39ms. Allocated memory was 186.6MB in the beginning and 234.9MB in the end (delta: 48.2MB). Free memory was 58.1MB in the beginning and 113.8MB in the end (delta: -55.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:19:37,385 INFO L158 Benchmark]: Witness Printer took 169.64ms. Allocated memory is still 234.9MB. Free memory was 113.8MB in the beginning and 101.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 21:19:37,386 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.18ms. Allocated memory is still 146.8MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 574.53ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 73.9MB in the beginning and 151.5MB in the end (delta: -77.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.60ms. Allocated memory is still 186.6MB. Free memory was 151.5MB in the beginning and 145.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.18ms. Allocated memory is still 186.6MB. Free memory was 145.2MB in the beginning and 139.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1080.70ms. Allocated memory is still 186.6MB. Free memory was 139.9MB in the beginning and 58.1MB in the end (delta: 81.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6411.39ms. Allocated memory was 186.6MB in the beginning and 234.9MB in the end (delta: 48.2MB). Free memory was 58.1MB in the beginning and 113.8MB in the end (delta: -55.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 169.64ms. Allocated memory is still 234.9MB. Free memory was 113.8MB in the beginning and 101.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 521]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1263 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1263 mSDsluCounter, 905 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 626 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3120 IncrementalHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 626 mSolverCounterUnsat, 782 mSDtfsCounter, 3120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1704occurred in iteration=6, InterpolantAutomatonStates: 24, 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, 7 MinimizatonAttempts, 286 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 968 NumberOfCodeBlocks, 968 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 961 ConstructedInterpolants, 0 QuantifiedInterpolants, 3650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 189/189 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: 616]: Loop Invariant Derived loop invariant: (((((((7 != a17) && (a17 <= 8)) && (a28 <= 7)) || (((7 != a17) && (a17 <= 8)) && (a19 == 1))) || ((9 <= a28) && (a17 <= 8))) || ((((a21 == 1) && (a17 <= 8)) && (a19 == 1)) && (a28 <= 7))) || (((7 != a17) && (a17 <= 8)) && (a25 != 1))) RESULT: Ultimate proved your program to be correct! [2024-11-21 21:19:37,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE