./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i -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 f5eff424b13e274e9264f217cb93b9f92431d9f38ae53b99fcf8d948b0cbf8ce --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:45:37,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:45:37,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:45:37,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:45:37,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:45:37,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:45:37,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:45:37,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:45:37,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:45:37,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:45:37,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:45:37,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:45:37,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:45:37,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:45:37,230 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:45:37,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:45:37,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:45:37,230 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:45:37,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:45:37,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:45:37,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:45:37,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:45:37,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:45:37,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:45:37,232 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:45:37,232 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:45:37,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:45:37,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:45:37,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:45:37,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:45:37,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:45:37,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:45:37,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:45:37,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:45:37,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:45:37,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:45:37,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:45:37,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:45:37,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:45:37,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:45:37,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:45:37,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:45:37,236 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 -> f5eff424b13e274e9264f217cb93b9f92431d9f38ae53b99fcf8d948b0cbf8ce [2024-10-14 11:45:37,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:45:37,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:45:37,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:45:37,466 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:45:37,467 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:45:37,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i [2024-10-14 11:45:38,732 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:45:38,918 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:45:38,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i [2024-10-14 11:45:38,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5532129/dc110b98fb2f4f2a99bddd0bc994ad86/FLAGdfb11135f [2024-10-14 11:45:39,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5532129/dc110b98fb2f4f2a99bddd0bc994ad86 [2024-10-14 11:45:39,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:45:39,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:45:39,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:45:39,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:45:39,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:45:39,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1ab056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39, skipping insertion in model container [2024-10-14 11:45:39,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:45:39,497 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i[915,928] [2024-10-14 11:45:39,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:45:39,536 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:45:39,547 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i[915,928] [2024-10-14 11:45:39,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:45:39,575 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:45:39,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39 WrapperNode [2024-10-14 11:45:39,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:45:39,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:45:39,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:45:39,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:45:39,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,617 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-10-14 11:45:39,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:45:39,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:45:39,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:45:39,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:45:39,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,647 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-10-14 11:45:39,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:45:39,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:45:39,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:45:39,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:45:39,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (1/1) ... [2024-10-14 11:45:39,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:45:39,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:45:39,698 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-10-14 11:45:39,700 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-10-14 11:45:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:45:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:45:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:45:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:45:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:45:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:45:39,804 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:45:39,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:45:40,012 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 11:45:40,013 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:45:40,040 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:45:40,041 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:45:40,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:40 BoogieIcfgContainer [2024-10-14 11:45:40,041 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:45:40,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:45:40,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:45:40,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:45:40,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:45:39" (1/3) ... [2024-10-14 11:45:40,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5adc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:40, skipping insertion in model container [2024-10-14 11:45:40,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39" (2/3) ... [2024-10-14 11:45:40,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5adc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:40, skipping insertion in model container [2024-10-14 11:45:40,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:40" (3/3) ... [2024-10-14 11:45:40,048 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-39.i [2024-10-14 11:45:40,061 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:45:40,062 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:45:40,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:45:40,117 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;@3401b20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:45:40,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:45:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 11:45:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 11:45:40,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:40,128 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 11:45:40,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:40,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1160943542, now seen corresponding path program 1 times [2024-10-14 11:45:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:40,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304008162] [2024-10-14 11:45:40,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:40,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:45:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:45:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:45:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:45:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:45:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:45:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:45:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:45:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:45:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:45:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:45:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:45:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:45:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 11:45:41,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:45:41,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304008162] [2024-10-14 11:45:41,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304008162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:45:41,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:45:41,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 11:45:41,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336515472] [2024-10-14 11:45:41,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:45:41,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:45:41,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:45:41,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:45:41,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:45:41,977 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 11:45:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:45:42,400 INFO L93 Difference]: Finished difference Result 146 states and 264 transitions. [2024-10-14 11:45:42,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:45:42,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 83 [2024-10-14 11:45:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:45:42,409 INFO L225 Difference]: With dead ends: 146 [2024-10-14 11:45:42,410 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 11:45:42,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:45:42,419 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 64 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:45:42,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 231 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:45:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 11:45:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2024-10-14 11:45:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:45:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-10-14 11:45:42,472 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 83 [2024-10-14 11:45:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:45:42,473 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-10-14 11:45:42,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 11:45:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-10-14 11:45:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 11:45:42,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:42,475 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 11:45:42,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:45:42,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:42,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1380550262, now seen corresponding path program 1 times [2024-10-14 11:45:42,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:42,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356555677] [2024-10-14 11:45:42,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:45:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:45:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:45:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:45:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:45:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:45:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:45:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:45:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:45:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:45:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:45:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:45:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:45:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 11:45:43,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:45:43,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356555677] [2024-10-14 11:45:43,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356555677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:45:43,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:45:43,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:45:43,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430600251] [2024-10-14 11:45:43,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:45:43,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:45:43,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:45:43,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:45:43,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:45:43,256 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:45:43,450 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2024-10-14 11:45:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:45:43,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-14 11:45:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:45:43,452 INFO L225 Difference]: With dead ends: 106 [2024-10-14 11:45:43,452 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 11:45:43,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:45:43,453 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 31 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:45:43,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 161 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:45:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 11:45:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2024-10-14 11:45:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:45:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-10-14 11:45:43,474 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 84 [2024-10-14 11:45:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:45:43,475 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-10-14 11:45:43,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-10-14 11:45:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 11:45:43,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:43,477 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 11:45:43,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:45:43,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:43,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1380490680, now seen corresponding path program 1 times [2024-10-14 11:45:43,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:43,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827863311] [2024-10-14 11:45:43,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:43,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:45:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:45:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:45:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:45:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:45:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:45:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:45:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:45:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:45:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:45:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:45:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:45:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:45:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 11:45:44,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:45:44,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827863311] [2024-10-14 11:45:44,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827863311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:45:44,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:45:44,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:45:44,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286036104] [2024-10-14 11:45:44,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:45:44,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:45:44,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:45:44,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:45:44,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:45:44,207 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:45:44,378 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2024-10-14 11:45:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:45:44,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-14 11:45:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:45:44,380 INFO L225 Difference]: With dead ends: 107 [2024-10-14 11:45:44,380 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 11:45:44,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:45:44,381 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:45:44,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:45:44,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 11:45:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2024-10-14 11:45:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:45:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-14 11:45:44,412 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 84 [2024-10-14 11:45:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:45:44,413 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-14 11:45:44,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-14 11:45:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 11:45:44,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:44,416 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 11:45:44,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:45:44,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:44,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1639892609, now seen corresponding path program 1 times [2024-10-14 11:45:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:44,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532359920] [2024-10-14 11:45:44,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:44,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:45:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:45:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:45:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:45:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:45:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:45:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:45:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:45:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:45:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:45:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:45:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:45:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:45:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 11:45:44,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:45:44,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532359920] [2024-10-14 11:45:44,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532359920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:45:44,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:45:44,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:45:44,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012310413] [2024-10-14 11:45:44,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:45:44,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:45:44,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:45:44,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:45:44,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:45:44,527 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:45:44,608 INFO L93 Difference]: Finished difference Result 226 states and 325 transitions. [2024-10-14 11:45:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:45:44,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-14 11:45:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:45:44,610 INFO L225 Difference]: With dead ends: 226 [2024-10-14 11:45:44,610 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 11:45:44,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:45:44,612 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:45:44,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 157 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:45:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 11:45:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2024-10-14 11:45:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 11:45:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 185 transitions. [2024-10-14 11:45:44,637 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 185 transitions. Word has length 84 [2024-10-14 11:45:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:45:44,638 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 185 transitions. [2024-10-14 11:45:44,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 185 transitions. [2024-10-14 11:45:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-14 11:45:44,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:44,640 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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] [2024-10-14 11:45:44,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:45:44,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:44,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:44,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1141709522, now seen corresponding path program 1 times [2024-10-14 11:45:44,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:44,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518525428] [2024-10-14 11:45:44,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:44,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:45:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:45:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:45:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:45:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:45:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:45:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:45:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:45:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:45:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:45:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:45:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:45:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:45:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 11:45:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:45:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:45:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:45:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:45:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:45:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:45:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:45:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:45:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:45:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:45:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:45:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:45:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-10-14 11:45:46,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:45:46,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518525428] [2024-10-14 11:45:46,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518525428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:45:46,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:45:46,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 11:45:46,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121306625] [2024-10-14 11:45:46,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:45:46,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:45:46,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:45:46,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:45:46,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:45:46,041 INFO L87 Difference]: Start difference. First operand 129 states and 185 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:45:46,655 INFO L93 Difference]: Finished difference Result 150 states and 206 transitions. [2024-10-14 11:45:46,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 11:45:46,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 167 [2024-10-14 11:45:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:45:46,657 INFO L225 Difference]: With dead ends: 150 [2024-10-14 11:45:46,657 INFO L226 Difference]: Without dead ends: 148 [2024-10-14 11:45:46,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-10-14 11:45:46,658 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 30 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:45:46,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 223 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:45:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-14 11:45:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 124. [2024-10-14 11:45:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 11:45:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2024-10-14 11:45:46,689 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 167 [2024-10-14 11:45:46,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:45:46,691 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2024-10-14 11:45:46,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2024-10-14 11:45:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 11:45:46,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:46,696 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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] [2024-10-14 11:45:46,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:45:46,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:46,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1298593554, now seen corresponding path program 1 times [2024-10-14 11:45:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:46,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68676230] [2024-10-14 11:45:46,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:46,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:45:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:45:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:45:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:45:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:45:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:45:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:45:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:45:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:45:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:45:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:45:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:45:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:45:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 11:45:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:45:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:45:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:45:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:45:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:45:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:45:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:45:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:45:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:45:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:45:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:45:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:45:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-14 11:45:47,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:45:47,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68676230] [2024-10-14 11:45:47,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68676230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:45:47,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:45:47,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 11:45:47,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114299495] [2024-10-14 11:45:47,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:45:47,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 11:45:47,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:45:47,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 11:45:47,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:45:47,739 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:45:47,900 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-10-14 11:45:47,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 11:45:47,901 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 168 [2024-10-14 11:45:47,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:45:47,902 INFO L225 Difference]: With dead ends: 144 [2024-10-14 11:45:47,902 INFO L226 Difference]: Without dead ends: 142 [2024-10-14 11:45:47,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:45:47,903 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 29 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:45:47,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 299 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:45:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-14 11:45:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2024-10-14 11:45:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 11:45:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2024-10-14 11:45:47,938 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 168 [2024-10-14 11:45:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:45:47,939 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2024-10-14 11:45:47,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2024-10-14 11:45:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 11:45:47,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:45:47,940 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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] [2024-10-14 11:45:47,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 11:45:47,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:45:47,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:45:47,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1298533972, now seen corresponding path program 1 times [2024-10-14 11:45:47,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:45:47,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274471305] [2024-10-14 11:45:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:45:47,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:45:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:45:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:45:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:45:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:45:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:45:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:45:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:45:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:45:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:45:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:45:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:45:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:45:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:45:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 11:45:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:45:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:45:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:45:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:45:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:45:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:45:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:45:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:45:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:45:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:45:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:45:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:45:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:45:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-14 11:45:48,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:45:48,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274471305] [2024-10-14 11:45:48,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274471305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:45:48,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:45:48,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 11:45:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37718907] [2024-10-14 11:45:48,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:45:48,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 11:45:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:45:48,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 11:45:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:45:48,695 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:45:48,839 INFO L93 Difference]: Finished difference Result 138 states and 194 transitions. [2024-10-14 11:45:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 11:45:48,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 168 [2024-10-14 11:45:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:45:48,840 INFO L225 Difference]: With dead ends: 138 [2024-10-14 11:45:48,840 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 11:45:48,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:45:48,842 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 27 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:45:48,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 205 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:45:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 11:45:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 11:45:48,847 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-10-14 11:45:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 11:45:48,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 168 [2024-10-14 11:45:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:45:48,847 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 11:45:48,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-14 11:45:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 11:45:48,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 11:45:48,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:45:48,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 11:45:48,852 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:45:48,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 11:45:49,001 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:45:49,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:45:49 BoogieIcfgContainer [2024-10-14 11:45:49,013 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:45:49,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:45:49,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:45:49,014 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:45:49,014 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:40" (3/4) ... [2024-10-14 11:45:49,016 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 11:45:49,019 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 11:45:49,024 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-14 11:45:49,025 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 11:45:49,025 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 11:45:49,025 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 11:45:49,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 11:45:49,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 11:45:49,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:45:49,115 INFO L158 Benchmark]: Toolchain (without parser) took 9787.67ms. Allocated memory was 161.5MB in the beginning and 371.2MB in the end (delta: 209.7MB). Free memory was 129.3MB in the beginning and 278.8MB in the end (delta: -149.5MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-10-14 11:45:49,116 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:45:49,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.93ms. Allocated memory is still 161.5MB. Free memory was 129.3MB in the beginning and 115.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 11:45:49,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.99ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:45:49,117 INFO L158 Benchmark]: Boogie Preprocessor took 45.46ms. Allocated memory is still 161.5MB. Free memory was 113.0MB in the beginning and 108.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:45:49,117 INFO L158 Benchmark]: RCFGBuilder took 376.38ms. Allocated memory is still 161.5MB. Free memory was 108.8MB in the beginning and 90.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 11:45:49,117 INFO L158 Benchmark]: TraceAbstraction took 8970.43ms. Allocated memory was 161.5MB in the beginning and 371.2MB in the end (delta: 209.7MB). Free memory was 89.9MB in the beginning and 284.0MB in the end (delta: -194.1MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. [2024-10-14 11:45:49,118 INFO L158 Benchmark]: Witness Printer took 101.06ms. Allocated memory is still 371.2MB. Free memory was 284.0MB in the beginning and 278.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:45:49,119 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.14ms. Allocated memory is still 121.6MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.93ms. Allocated memory is still 161.5MB. Free memory was 129.3MB in the beginning and 115.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.99ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.46ms. Allocated memory is still 161.5MB. Free memory was 113.0MB in the beginning and 108.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 376.38ms. Allocated memory is still 161.5MB. Free memory was 108.8MB in the beginning and 90.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8970.43ms. Allocated memory was 161.5MB in the beginning and 371.2MB in the end (delta: 209.7MB). Free memory was 89.9MB in the beginning and 284.0MB in the end (delta: -194.1MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. * Witness Printer took 101.06ms. Allocated memory is still 371.2MB. Free memory was 284.0MB in the beginning and 278.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 7, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 1505 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1119 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 705 IncrementalHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 386 mSDtfsCounter, 705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=4, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 103 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 838 NumberOfCodeBlocks, 838 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 831 ConstructedInterpolants, 0 QuantifiedInterpolants, 6592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 5237/5237 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: 94]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-14 11:45:49,150 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