./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label27.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/eca-rers2012/Problem01_label27.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 4ceae147c0993f09d1996333054d05cdb50149b89c2ec286f40c2e532c4f5e1a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:26:48,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:26:48,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:26:48,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:26:48,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:26:48,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:26:48,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:26:48,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:26:48,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:26:48,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:26:48,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:26:48,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:26:48,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:26:48,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:26:48,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:26:48,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:26:48,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:26:48,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:26:48,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:26:48,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:26:48,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:26:48,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:26:48,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:26:48,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:26:48,391 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:26:48,392 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:26:48,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:26:48,392 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:26:48,392 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:26:48,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:26:48,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:26:48,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:26:48,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:26:48,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:26:48,394 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:26:48,394 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:26:48,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:26:48,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:26:48,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:26:48,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:26:48,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:26:48,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:26:48,398 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 -> 4ceae147c0993f09d1996333054d05cdb50149b89c2ec286f40c2e532c4f5e1a [2024-11-08 10:26:48,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:26:48,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:26:48,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:26:48,658 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:26:48,659 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:26:48,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label27.c [2024-11-08 10:26:50,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:26:50,231 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:26:50,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label27.c [2024-11-08 10:26:50,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4de206c8/5bdcec6af0d54ffeab69453531e012c2/FLAG5b21428bf [2024-11-08 10:26:50,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4de206c8/5bdcec6af0d54ffeab69453531e012c2 [2024-11-08 10:26:50,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:26:50,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:26:50,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:26:50,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:26:50,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:26:50,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:26:50" (1/1) ... [2024-11-08 10:26:50,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@500af6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:50, skipping insertion in model container [2024-11-08 10:26:50,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:26:50" (1/1) ... [2024-11-08 10:26:50,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:26:50,895 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/Problem01_label27.c[16500,16513] [2024-11-08 10:26:50,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:26:50,961 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:26:51,001 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/Problem01_label27.c[16500,16513] [2024-11-08 10:26:51,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:26:51,025 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:26:51,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51 WrapperNode [2024-11-08 10:26:51,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:26:51,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:26:51,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:26:51,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:26:51,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,080 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-11-08 10:26:51,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:26:51,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:26:51,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:26:51,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:26:51,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,110 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 10:26:51,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:26:51,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:26:51,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:26:51,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:26:51,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (1/1) ... [2024-11-08 10:26:51,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:26:51,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:26:51,171 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 10:26:51,175 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 10:26:51,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:26:51,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:26:51,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:26:51,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:26:51,275 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:26:51,278 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:26:52,137 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 10:26:52,137 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:26:52,159 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:26:52,159 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:26:52,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:26:52 BoogieIcfgContainer [2024-11-08 10:26:52,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:26:52,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:26:52,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:26:52,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:26:52,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:26:50" (1/3) ... [2024-11-08 10:26:52,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de0bd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:26:52, skipping insertion in model container [2024-11-08 10:26:52,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:51" (2/3) ... [2024-11-08 10:26:52,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de0bd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:26:52, skipping insertion in model container [2024-11-08 10:26:52,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:26:52" (3/3) ... [2024-11-08 10:26:52,167 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label27.c [2024-11-08 10:26:52,179 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:26:52,179 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:26:52,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:26:52,237 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;@256cff78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:26:52,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:26:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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 10:26:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 10:26:52,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:26:52,252 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] [2024-11-08 10:26:52,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:26:52,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:26:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash 857291087, now seen corresponding path program 1 times [2024-11-08 10:26:52,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:26:52,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281612418] [2024-11-08 10:26:52,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:26:52,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:26:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:26:52,836 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 10:26:52,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:26:52,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281612418] [2024-11-08 10:26:52,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281612418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:26:52,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:26:52,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:26:52,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119611851] [2024-11-08 10:26:52,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:26:52,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:26:52,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:26:52,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:26:52,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:26:52,880 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 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 10:26:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:26:53,625 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2024-11-08 10:26:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:26:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 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 88 [2024-11-08 10:26:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:26:53,641 INFO L225 Difference]: With dead ends: 528 [2024-11-08 10:26:53,641 INFO L226 Difference]: Without dead ends: 266 [2024-11-08 10:26:53,644 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-08 10:26:53,648 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 97 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:26:53,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 66 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:26:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-08 10:26:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-08 10:26:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 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 10:26:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2024-11-08 10:26:53,732 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 88 [2024-11-08 10:26:53,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:26:53,733 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2024-11-08 10:26:53,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 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 10:26:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2024-11-08 10:26:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 10:26:53,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:26:53,741 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] [2024-11-08 10:26:53,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:26:53,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:26:53,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:26:53,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1648492327, now seen corresponding path program 1 times [2024-11-08 10:26:53,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:26:53,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593247916] [2024-11-08 10:26:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:26:53,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:26:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:26:53,879 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-08 10:26:53,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:26:53,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593247916] [2024-11-08 10:26:53,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593247916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:26:53,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:26:53,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:26:53,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901718362] [2024-11-08 10:26:53,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:26:53,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:26:53,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:26:53,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:26:53,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:26:53,883 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 10:26:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:26:54,208 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2024-11-08 10:26:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:26:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 93 [2024-11-08 10:26:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:26:54,211 INFO L225 Difference]: With dead ends: 792 [2024-11-08 10:26:54,211 INFO L226 Difference]: Without dead ends: 528 [2024-11-08 10:26:54,212 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-08 10:26:54,213 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:26:54,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:26:54,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-08 10:26:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2024-11-08 10:26:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3681214421252372) internal successors, (721), 527 states have internal predecessors, (721), 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 10:26:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2024-11-08 10:26:54,240 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 93 [2024-11-08 10:26:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:26:54,240 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2024-11-08 10:26:54,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 10:26:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2024-11-08 10:26:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 10:26:54,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:26:54,243 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 10:26:54,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:26:54,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:26:54,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:26:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1380296349, now seen corresponding path program 1 times [2024-11-08 10:26:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:26:54,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327114421] [2024-11-08 10:26:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:26:54,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:26:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:26:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:26:54,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:26:54,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327114421] [2024-11-08 10:26:54,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327114421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:26:54,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:26:54,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:26:54,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835766591] [2024-11-08 10:26:54,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:26:54,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:26:54,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:26:54,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:26:54,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:26:54,401 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 10:26:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:26:54,725 INFO L93 Difference]: Finished difference Result 1447 states and 1979 transitions. [2024-11-08 10:26:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:26:54,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 97 [2024-11-08 10:26:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:26:54,729 INFO L225 Difference]: With dead ends: 1447 [2024-11-08 10:26:54,729 INFO L226 Difference]: Without dead ends: 921 [2024-11-08 10:26:54,730 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-08 10:26:54,731 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:26:54,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 17 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:26:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-08 10:26:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2024-11-08 10:26:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.3434782608695652) internal successors, (1236), 920 states have internal predecessors, (1236), 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 10:26:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1236 transitions. [2024-11-08 10:26:54,764 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1236 transitions. Word has length 97 [2024-11-08 10:26:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:26:54,764 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1236 transitions. [2024-11-08 10:26:54,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 10:26:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1236 transitions. [2024-11-08 10:26:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 10:26:54,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:26:54,773 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 10:26:54,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:26:54,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:26:54,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:26:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2121899539, now seen corresponding path program 1 times [2024-11-08 10:26:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:26:54,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370849472] [2024-11-08 10:26:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:26:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:26:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:26:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:26:54,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:26:54,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370849472] [2024-11-08 10:26:54,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370849472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:26:54,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:26:54,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:26:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865308264] [2024-11-08 10:26:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:26:54,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:26:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:26:54,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:26:54,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:26:54,928 INFO L87 Difference]: Start difference. First operand 921 states and 1236 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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 10:26:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:26:55,243 INFO L93 Difference]: Finished difference Result 1840 states and 2470 transitions. [2024-11-08 10:26:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:26:55,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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 101 [2024-11-08 10:26:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:26:55,246 INFO L225 Difference]: With dead ends: 1840 [2024-11-08 10:26:55,247 INFO L226 Difference]: Without dead ends: 921 [2024-11-08 10:26:55,249 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-08 10:26:55,250 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 129 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:26:55,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 61 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:26:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-08 10:26:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2024-11-08 10:26:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.3304347826086957) internal successors, (1224), 920 states have internal predecessors, (1224), 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 10:26:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1224 transitions. [2024-11-08 10:26:55,269 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1224 transitions. Word has length 101 [2024-11-08 10:26:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:26:55,269 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1224 transitions. [2024-11-08 10:26:55,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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 10:26:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1224 transitions. [2024-11-08 10:26:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 10:26:55,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:26:55,272 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] [2024-11-08 10:26:55,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:26:55,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:26:55,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:26:55,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2015967182, now seen corresponding path program 1 times [2024-11-08 10:26:55,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:26:55,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067235909] [2024-11-08 10:26:55,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:26:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:26:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:26:55,491 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-08 10:26:55,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:26:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067235909] [2024-11-08 10:26:55,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067235909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:26:55,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:26:55,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:26:55,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649339022] [2024-11-08 10:26:55,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:26:55,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:26:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:26:55,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:26:55,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:26:55,493 INFO L87 Difference]: Start difference. First operand 921 states and 1224 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 10:26:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:26:55,816 INFO L93 Difference]: Finished difference Result 2233 states and 2923 transitions. [2024-11-08 10:26:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:26:55,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 103 [2024-11-08 10:26:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:26:55,820 INFO L225 Difference]: With dead ends: 2233 [2024-11-08 10:26:55,820 INFO L226 Difference]: Without dead ends: 1314 [2024-11-08 10:26:55,821 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-08 10:26:55,821 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:26:55,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 62 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:26:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2024-11-08 10:26:55,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2024-11-08 10:26:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2825719120135364) internal successors, (1516), 1182 states have internal predecessors, (1516), 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 10:26:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1516 transitions. [2024-11-08 10:26:55,837 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1516 transitions. Word has length 103 [2024-11-08 10:26:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:26:55,837 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1516 transitions. [2024-11-08 10:26:55,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 10:26:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1516 transitions. [2024-11-08 10:26:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 10:26:55,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:26:55,839 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-08 10:26:55,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:26:55,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:26:55,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:26:55,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2265750, now seen corresponding path program 1 times [2024-11-08 10:26:55,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:26:55,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018537129] [2024-11-08 10:26:55,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:26:55,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:26:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:26:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:26:55,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:26:55,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018537129] [2024-11-08 10:26:55,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018537129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:26:55,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:26:55,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:26:55,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377774118] [2024-11-08 10:26:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:26:55,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:26:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:26:55,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:26:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:26:55,949 INFO L87 Difference]: Start difference. First operand 1183 states and 1516 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 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 10:26:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:26:56,445 INFO L93 Difference]: Finished difference Result 2757 states and 3471 transitions. [2024-11-08 10:26:56,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:26:56,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 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 107 [2024-11-08 10:26:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:26:56,449 INFO L225 Difference]: With dead ends: 2757 [2024-11-08 10:26:56,450 INFO L226 Difference]: Without dead ends: 1576 [2024-11-08 10:26:56,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:26:56,451 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 380 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:26:56,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 59 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:26:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-08 10:26:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2024-11-08 10:26:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.2479224376731302) internal successors, (1802), 1444 states have internal predecessors, (1802), 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 10:26:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1802 transitions. [2024-11-08 10:26:56,474 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1802 transitions. Word has length 107 [2024-11-08 10:26:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:26:56,475 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1802 transitions. [2024-11-08 10:26:56,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 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 10:26:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1802 transitions. [2024-11-08 10:26:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 10:26:56,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:26:56,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:26:56,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:26:56,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:26:56,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:26:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1256717015, now seen corresponding path program 1 times [2024-11-08 10:26:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:26:56,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605509365] [2024-11-08 10:26:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:26:56,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:26:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:26:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:26:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:26:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605509365] [2024-11-08 10:26:56,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605509365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:26:56,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:26:56,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:26:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232797435] [2024-11-08 10:26:56,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:26:56,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:26:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:26:56,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:26:56,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:26:56,605 INFO L87 Difference]: Start difference. First operand 1445 states and 1802 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 10:26:56,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:26:56,924 INFO L93 Difference]: Finished difference Result 3019 states and 3739 transitions. [2024-11-08 10:26:56,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:26:56,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 125 [2024-11-08 10:26:56,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:26:56,929 INFO L225 Difference]: With dead ends: 3019 [2024-11-08 10:26:56,929 INFO L226 Difference]: Without dead ends: 1576 [2024-11-08 10:26:56,930 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 10:26:56,931 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 47 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:26:56,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 193 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:26:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-08 10:26:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2024-11-08 10:26:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.2049861495844876) internal successors, (1740), 1444 states have internal predecessors, (1740), 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 10:26:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1740 transitions. [2024-11-08 10:26:56,947 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1740 transitions. Word has length 125 [2024-11-08 10:26:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:26:56,947 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1740 transitions. [2024-11-08 10:26:56,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 10:26:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1740 transitions. [2024-11-08 10:26:56,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 10:26:56,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:26:56,949 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-08 10:26:56,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:26:56,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:26:56,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:26:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash 144240950, now seen corresponding path program 1 times [2024-11-08 10:26:56,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:26:56,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755436044] [2024-11-08 10:26:56,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:26:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:26:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:26:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:26:57,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:26:57,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755436044] [2024-11-08 10:26:57,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755436044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:26:57,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:26:57,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:26:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4798320] [2024-11-08 10:26:57,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:26:57,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:26:57,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:26:57,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:26:57,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:26:57,037 INFO L87 Difference]: Start difference. First operand 1445 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 10:26:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:26:57,382 INFO L93 Difference]: Finished difference Result 3150 states and 3807 transitions. [2024-11-08 10:26:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:26:57,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 138 [2024-11-08 10:26:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:26:57,386 INFO L225 Difference]: With dead ends: 3150 [2024-11-08 10:26:57,386 INFO L226 Difference]: Without dead ends: 1707 [2024-11-08 10:26:57,387 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 10:26:57,387 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 56 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:26:57,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 192 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:26:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-08 10:26:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1707. [2024-11-08 10:26:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1805392731535755) internal successors, (2014), 1706 states have internal predecessors, (2014), 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 10:26:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2014 transitions. [2024-11-08 10:26:57,406 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2014 transitions. Word has length 138 [2024-11-08 10:26:57,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:26:57,406 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2014 transitions. [2024-11-08 10:26:57,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 10:26:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2014 transitions. [2024-11-08 10:26:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 10:26:57,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:26:57,408 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 10:26:57,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:26:57,408 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:26:57,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:26:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 943692171, now seen corresponding path program 1 times [2024-11-08 10:26:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:26:57,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127040899] [2024-11-08 10:26:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:26:57,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:26:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:26:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:26:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:26:57,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127040899] [2024-11-08 10:26:57,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127040899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:26:57,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:26:57,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:26:57,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310455155] [2024-11-08 10:26:57,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:26:57,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:26:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:26:57,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:26:57,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:26:57,531 INFO L87 Difference]: Start difference. First operand 1707 states and 2014 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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 10:26:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:26:58,010 INFO L93 Difference]: Finished difference Result 3674 states and 4337 transitions. [2024-11-08 10:26:58,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:26:58,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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 138 [2024-11-08 10:26:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:26:58,015 INFO L225 Difference]: With dead ends: 3674 [2024-11-08 10:26:58,016 INFO L226 Difference]: Without dead ends: 1969 [2024-11-08 10:26:58,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:26:58,018 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 236 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:26:58,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 52 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:26:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2024-11-08 10:26:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2024-11-08 10:26:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1480675013609145) internal successors, (2109), 1837 states have internal predecessors, (2109), 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 10:26:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2109 transitions. [2024-11-08 10:26:58,043 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2109 transitions. Word has length 138 [2024-11-08 10:26:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:26:58,043 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2109 transitions. [2024-11-08 10:26:58,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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 10:26:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2109 transitions. [2024-11-08 10:26:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 10:26:58,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:26:58,046 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 10:26:58,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:26:58,046 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:26:58,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:26:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1855908813, now seen corresponding path program 1 times [2024-11-08 10:26:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:26:58,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826629889] [2024-11-08 10:26:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:26:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:26:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:26:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:26:58,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:26:58,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826629889] [2024-11-08 10:26:58,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826629889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:26:58,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226966688] [2024-11-08 10:26:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:26:58,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:26:58,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:26:58,361 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 10:26:58,363 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 10:26:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:26:58,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:26:58,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:26:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 10:26:58,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:26:58,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226966688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:26:58,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:26:58,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 10:26:58,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702273683] [2024-11-08 10:26:58,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:26:58,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:26:58,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:26:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:26:58,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:26:58,592 INFO L87 Difference]: Start difference. First operand 1838 states and 2109 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 10:26:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:26:58,909 INFO L93 Difference]: Finished difference Result 4065 states and 4662 transitions. [2024-11-08 10:26:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:26:58,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 168 [2024-11-08 10:26:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:26:58,910 INFO L225 Difference]: With dead ends: 4065 [2024-11-08 10:26:58,910 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:26:58,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:26:58,913 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:26:58,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 190 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:26:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:26:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:26:58,915 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 10:26:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:26:58,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 168 [2024-11-08 10:26:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:26:58,915 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:26:58,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 10:26:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:26:58,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:26:58,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:26:58,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 10:26:59,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 10:26:59,126 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:26:59,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:26:59,290 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:26:59,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:26:59 BoogieIcfgContainer [2024-11-08 10:26:59,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:26:59,304 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:26:59,304 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:26:59,304 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:26:59,304 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:26:52" (3/4) ... [2024-11-08 10:26:59,306 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:26:59,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:26:59,318 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:26:59,318 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:26:59,319 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:26:59,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:26:59,463 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:26:59,463 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:26:59,467 INFO L158 Benchmark]: Toolchain (without parser) took 8878.60ms. Allocated memory was 167.8MB in the beginning and 367.0MB in the end (delta: 199.2MB). Free memory was 93.5MB in the beginning and 306.3MB in the end (delta: -212.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:26:59,467 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:26:59,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.62ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 126.0MB in the end (delta: -32.7MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-08 10:26:59,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.01ms. Allocated memory is still 167.8MB. Free memory was 126.0MB in the beginning and 119.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:26:59,468 INFO L158 Benchmark]: Boogie Preprocessor took 60.47ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 114.4MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:26:59,468 INFO L158 Benchmark]: RCFGBuilder took 1017.35ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 114.4MB in the beginning and 209.7MB in the end (delta: -95.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-11-08 10:26:59,468 INFO L158 Benchmark]: TraceAbstraction took 7141.46ms. Allocated memory was 268.4MB in the beginning and 367.0MB in the end (delta: 98.6MB). Free memory was 209.7MB in the beginning and 317.9MB in the end (delta: -108.2MB). Peak memory consumption was 192.8MB. Max. memory is 16.1GB. [2024-11-08 10:26:59,469 INFO L158 Benchmark]: Witness Printer took 158.81ms. Allocated memory is still 367.0MB. Free memory was 317.9MB in the beginning and 306.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 10:26:59,470 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.20ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.62ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 126.0MB in the end (delta: -32.7MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.01ms. Allocated memory is still 167.8MB. Free memory was 126.0MB in the beginning and 119.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.47ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 114.4MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1017.35ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 114.4MB in the beginning and 209.7MB in the end (delta: -95.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7141.46ms. Allocated memory was 268.4MB in the beginning and 367.0MB in the end (delta: 98.6MB). Free memory was 209.7MB in the beginning and 317.9MB in the end (delta: -108.2MB). Peak memory consumption was 192.8MB. Max. memory is 16.1GB. * Witness Printer took 158.81ms. Allocated memory is still 367.0MB. Free memory was 317.9MB in the beginning and 306.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 450]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1434 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1434 mSDsluCounter, 921 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 716 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3820 IncrementalHoareTripleChecker+Invalid, 4536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 716 mSolverCounterUnsat, 856 mSDtfsCounter, 3820 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=9, InterpolantAutomatonStates: 32, 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, 10 MinimizatonAttempts, 524 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1315 ConstructedInterpolants, 0 QuantifiedInterpolants, 3034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 322 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 408/438 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: 593]: Loop Invariant Derived loop invariant: (((((((a8 <= 14) && (a17 == 1)) && (a16 <= 5)) || ((a8 <= 14) && (a20 == 1))) || ((a20 != 1) && (a21 == 1))) || ((a7 != 1) && (a21 == 1))) || ((a21 == 1) && (a17 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:26:59,508 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