./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-1loop_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 03532d804e91a228e512382776942639e7b4d586babdb4cf497abfe139412ab5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:27:55,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:27:55,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:27:55,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:27:55,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:27:55,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:27:55,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:27:55,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:27:55,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:27:55,216 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:27:55,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:27:55,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:27:55,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:27:55,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:27:55,218 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:27:55,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:27:55,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:27:55,223 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:27:55,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:27:55,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:27:55,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:27:55,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:27:55,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:27:55,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:27:55,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:27:55,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:27:55,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:27:55,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:27:55,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:27:55,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:27:55,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:27:55,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:27:55,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:27:55,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:27:55,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:27:55,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:27:55,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:27:55,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:27:55,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:27:55,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:27:55,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:27:55,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:27:55,229 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-clean/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-clean/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 -> 03532d804e91a228e512382776942639e7b4d586babdb4cf497abfe139412ab5 [2024-10-11 11:27:55,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:27:55,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:27:55,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:27:55,514 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:27:55,515 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:27:55,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i [2024-10-11 11:27:56,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:27:57,006 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:27:57,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i [2024-10-11 11:27:57,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f42702125/279a6b0fda3e424c8a0b030634ce4cf7/FLAGb1751a70f [2024-10-11 11:27:57,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f42702125/279a6b0fda3e424c8a0b030634ce4cf7 [2024-10-11 11:27:57,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:27:57,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:27:57,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:27:57,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:27:57,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:27:57,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21752148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57, skipping insertion in model container [2024-10-11 11:27:57,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:27:57,191 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-1loop_file-5.i[914,927] [2024-10-11 11:27:57,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:27:57,255 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:27:57,268 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-1loop_file-5.i[914,927] [2024-10-11 11:27:57,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:27:57,310 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:27:57,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57 WrapperNode [2024-10-11 11:27:57,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:27:57,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:27:57,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:27:57,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:27:57,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,355 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-10-11 11:27:57,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:27:57,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:27:57,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:27:57,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:27:57,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,394 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-11 11:27:57,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:27:57,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:27:57,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:27:57,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:27:57,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (1/1) ... [2024-10-11 11:27:57,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:27:57,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:27:57,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:27:57,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:27:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:27:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:27:57,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:27:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:27:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:27:57,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:27:57,553 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:27:57,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:27:57,847 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 11:27:57,847 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:27:57,889 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:27:57,889 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:27:57,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:27:57 BoogieIcfgContainer [2024-10-11 11:27:57,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:27:57,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:27:57,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:27:57,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:27:57,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:27:57" (1/3) ... [2024-10-11 11:27:57,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f95493b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:27:57, skipping insertion in model container [2024-10-11 11:27:57,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:57" (2/3) ... [2024-10-11 11:27:57,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f95493b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:27:57, skipping insertion in model container [2024-10-11 11:27:57,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:27:57" (3/3) ... [2024-10-11 11:27:57,901 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-5.i [2024-10-11 11:27:57,914 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:27:57,914 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:27:57,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:27:57,969 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;@179dade7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:27:57,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:27:57,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 11:27:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 11:27:57,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:27:57,981 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:27:57,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:27:57,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:27:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash -730090614, now seen corresponding path program 1 times [2024-10-11 11:27:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:27:57,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605092229] [2024-10-11 11:27:57,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:27:57,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:27:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:27:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:27:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:27:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:27:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:27:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:27:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:27:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:27:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:27:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:27:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:27:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:27:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:27:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:27:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:27:58,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:27:58,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605092229] [2024-10-11 11:27:58,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605092229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:27:58,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:27:58,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:27:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531797574] [2024-10-11 11:27:58,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:27:58,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:27:58,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:27:58,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:27:58,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:27:58,317 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 11:27:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:27:58,352 INFO L93 Difference]: Finished difference Result 85 states and 143 transitions. [2024-10-11 11:27:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:27:58,355 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2024-10-11 11:27:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:27:58,360 INFO L225 Difference]: With dead ends: 85 [2024-10-11 11:27:58,360 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 11:27:58,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:27:58,367 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:27:58,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:27:58,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 11:27:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 11:27:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 11:27:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-11 11:27:58,408 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 89 [2024-10-11 11:27:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:27:58,408 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-11 11:27:58,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 11:27:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-11 11:27:58,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 11:27:58,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:27:58,414 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:27:58,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:27:58,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:27:58,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:27:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash -907529654, now seen corresponding path program 1 times [2024-10-11 11:27:58,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:27:58,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72853199] [2024-10-11 11:27:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:27:58,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:27:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:27:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:27:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:27:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:27:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:27:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:27:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:27:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:27:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:27:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:27:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:27:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:27:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:27:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:27:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:27:59,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:27:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72853199] [2024-10-11 11:27:59,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72853199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:27:59,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:27:59,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:27:59,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774550554] [2024-10-11 11:27:59,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:27:59,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:27:59,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:27:59,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:27:59,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:27:59,304 INFO L87 Difference]: Start difference. First operand 41 states and 60 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:27:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:27:59,444 INFO L93 Difference]: Finished difference Result 110 states and 159 transitions. [2024-10-11 11:27:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:27:59,445 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2024-10-11 11:27:59,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:27:59,448 INFO L225 Difference]: With dead ends: 110 [2024-10-11 11:27:59,449 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 11:27:59,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:27:59,451 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:27:59,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 141 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:27:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 11:27:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-10-11 11:27:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:27:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2024-10-11 11:27:59,479 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 89 [2024-10-11 11:27:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:27:59,480 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2024-10-11 11:27:59,480 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:27:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2024-10-11 11:27:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 11:27:59,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:27:59,482 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:27:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:27:59,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:27:59,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:27:59,482 INFO L85 PathProgramCache]: Analyzing trace with hash -907470072, now seen corresponding path program 1 times [2024-10-11 11:27:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:27:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312481511] [2024-10-11 11:27:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:27:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:27:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:28:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:28:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:28:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:28:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:28:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:28:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:28:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:28:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:28:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:28:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:28:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:28:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:28:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:28:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:28:01,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:28:01,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312481511] [2024-10-11 11:28:01,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312481511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:28:01,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:28:01,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 11:28:01,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330939232] [2024-10-11 11:28:01,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:28:01,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:28:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:28:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:28:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:28:01,245 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:28:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:28:01,725 INFO L93 Difference]: Finished difference Result 143 states and 202 transitions. [2024-10-11 11:28:01,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:28:01,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2024-10-11 11:28:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:28:01,729 INFO L225 Difference]: With dead ends: 143 [2024-10-11 11:28:01,729 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 11:28:01,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:28:01,734 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 61 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:28:01,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 182 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 11:28:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 11:28:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2024-10-11 11:28:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.2) internal successors, (96), 82 states have internal predecessors, (96), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 11:28:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 192 transitions. [2024-10-11 11:28:01,767 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 192 transitions. Word has length 89 [2024-10-11 11:28:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:28:01,767 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 192 transitions. [2024-10-11 11:28:01,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:28:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 192 transitions. [2024-10-11 11:28:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 11:28:01,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:28:01,770 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:28:01,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:28:01,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:28:01,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:28:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash -850211770, now seen corresponding path program 1 times [2024-10-11 11:28:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:28:01,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679629841] [2024-10-11 11:28:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:28:01,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:28:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:28:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:28:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:28:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:28:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:28:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:28:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:28:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:28:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:28:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:28:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:28:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:28:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:28:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:28:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:28:01,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:28:01,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679629841] [2024-10-11 11:28:01,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679629841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:28:01,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:28:01,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:28:01,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621338211] [2024-10-11 11:28:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:28:01,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:28:01,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:28:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:28:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:28:01,868 INFO L87 Difference]: Start difference. First operand 133 states and 192 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:28:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:28:01,902 INFO L93 Difference]: Finished difference Result 261 states and 378 transitions. [2024-10-11 11:28:01,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:28:01,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2024-10-11 11:28:01,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:28:01,904 INFO L225 Difference]: With dead ends: 261 [2024-10-11 11:28:01,904 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 11:28:01,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:28:01,906 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:28:01,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:28:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 11:28:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-11 11:28:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.144736842105263) internal successors, (87), 78 states have internal predecessors, (87), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 11:28:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2024-10-11 11:28:01,925 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 89 [2024-10-11 11:28:01,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:28:01,926 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2024-10-11 11:28:01,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:28:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2024-10-11 11:28:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 11:28:01,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:28:01,930 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:28:01,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:28:01,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:28:01,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:28:01,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1716876280, now seen corresponding path program 1 times [2024-10-11 11:28:01,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:28:01,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444301156] [2024-10-11 11:28:01,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:28:01,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:28:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:28:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:28:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:28:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:28:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:28:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:01,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:28:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:02,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:28:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:02,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:28:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:02,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:28:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:02,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:28:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:02,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:28:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:02,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:28:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:02,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:28:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:02,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:28:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:28:02,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:28:02,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444301156] [2024-10-11 11:28:02,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444301156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:28:02,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:28:02,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:28:02,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65852425] [2024-10-11 11:28:02,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:28:02,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:28:02,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:28:02,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:28:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:28:02,021 INFO L87 Difference]: Start difference. First operand 129 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:28:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:28:02,047 INFO L93 Difference]: Finished difference Result 228 states and 322 transitions. [2024-10-11 11:28:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:28:02,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2024-10-11 11:28:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:28:02,049 INFO L225 Difference]: With dead ends: 228 [2024-10-11 11:28:02,049 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 11:28:02,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:28:02,050 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:28:02,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:28:02,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 11:28:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 11:28:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.087719298245614) internal successors, (62), 58 states have internal predecessors, (62), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:28:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2024-10-11 11:28:02,066 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 89 [2024-10-11 11:28:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:28:02,067 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2024-10-11 11:28:02,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:28:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2024-10-11 11:28:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 11:28:02,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:28:02,068 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:28:02,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:28:02,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:28:02,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:28:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2029122244, now seen corresponding path program 1 times [2024-10-11 11:28:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:28:02,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480559910] [2024-10-11 11:28:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:28:02,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:28:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:28:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:28:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:28:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:28:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:28:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:28:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:28:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:28:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:28:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:28:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:28:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:28:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:28:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:28:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:28:04,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:28:04,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480559910] [2024-10-11 11:28:04,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480559910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:28:04,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:28:04,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 11:28:04,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217337806] [2024-10-11 11:28:04,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:28:04,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:28:04,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:28:04,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:28:04,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:28:04,963 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:28:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:28:05,333 INFO L93 Difference]: Finished difference Result 119 states and 157 transitions. [2024-10-11 11:28:05,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:28:05,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2024-10-11 11:28:05,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:28:05,336 INFO L225 Difference]: With dead ends: 119 [2024-10-11 11:28:05,337 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 11:28:05,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:28:05,337 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 18 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:28:05,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 305 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:28:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 11:28:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2024-10-11 11:28:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 66 states have internal predecessors, (70), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:28:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2024-10-11 11:28:05,350 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 90 [2024-10-11 11:28:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:28:05,351 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2024-10-11 11:28:05,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:28:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2024-10-11 11:28:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 11:28:05,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:28:05,352 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:28:05,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:28:05,352 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:28:05,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:28:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash 645160051, now seen corresponding path program 1 times [2024-10-11 11:28:05,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:28:05,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572854973] [2024-10-11 11:28:05,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:28:05,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:28:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:28:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:28:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:28:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:28:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:28:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:28:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:28:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:28:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:28:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:28:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:28:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:28:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:28:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:28:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:28:06,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:28:06,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572854973] [2024-10-11 11:28:06,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572854973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:28:06,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:28:06,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 11:28:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021081609] [2024-10-11 11:28:06,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:28:06,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:28:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:28:06,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:28:06,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:28:06,287 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:28:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:28:06,419 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2024-10-11 11:28:06,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 11:28:06,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-10-11 11:28:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:28:06,421 INFO L225 Difference]: With dead ends: 130 [2024-10-11 11:28:06,421 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 11:28:06,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:28:06,422 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 23 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:28:06,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 303 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:28:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 11:28:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2024-10-11 11:28:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 66 states have internal predecessors, (70), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:28:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2024-10-11 11:28:06,436 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 91 [2024-10-11 11:28:06,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:28:06,436 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2024-10-11 11:28:06,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:28:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2024-10-11 11:28:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 11:28:06,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:28:06,438 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:28:06,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:28:06,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:28:06,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:28:06,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1427154542, now seen corresponding path program 1 times [2024-10-11 11:28:06,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:28:06,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727819327] [2024-10-11 11:28:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:28:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:28:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:28:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:28:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:28:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:28:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:28:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:28:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:28:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:28:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:28:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:28:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:28:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:28:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:28:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:28:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:28:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:28:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:28:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:28:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:28:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:28:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:28:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:28:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:28:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:28:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:28:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:28:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:28:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:28:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 11:28:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:28:06,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727819327] [2024-10-11 11:28:06,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727819327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:28:06,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:28:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:28:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725501365] [2024-10-11 11:28:06,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:28:06,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:28:06,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:28:06,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:28:06,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:28:06,552 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 11:28:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:28:06,581 INFO L93 Difference]: Finished difference Result 142 states and 186 transitions. [2024-10-11 11:28:06,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:28:06,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2024-10-11 11:28:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:28:06,584 INFO L225 Difference]: With dead ends: 142 [2024-10-11 11:28:06,584 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 11:28:06,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:28:06,585 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:28:06,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:28:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 11:28:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 11:28:06,586 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-11 11:28:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 11:28:06,586 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2024-10-11 11:28:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:28:06,586 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 11:28:06,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 11:28:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 11:28:06,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 11:28:06,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:28:06,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:28:06,592 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:28:06,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 11:28:06,851 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:28:06,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:28:06 BoogieIcfgContainer [2024-10-11 11:28:06,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:28:06,874 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:28:06,874 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:28:06,875 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:28:06,875 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:27:57" (3/4) ... [2024-10-11 11:28:06,876 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 11:28:06,879 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 11:28:06,885 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 11:28:06,885 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 11:28:06,885 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 11:28:06,885 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 11:28:06,957 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 11:28:06,958 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 11:28:06,958 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:28:06,958 INFO L158 Benchmark]: Toolchain (without parser) took 9927.54ms. Allocated memory was 188.7MB in the beginning and 499.1MB in the end (delta: 310.4MB). Free memory was 154.0MB in the beginning and 385.4MB in the end (delta: -231.4MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2024-10-11 11:28:06,958 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:28:06,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.86ms. Allocated memory is still 188.7MB. Free memory was 154.0MB in the beginning and 140.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:28:06,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.76ms. Allocated memory is still 188.7MB. Free memory was 140.4MB in the beginning and 137.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:28:06,959 INFO L158 Benchmark]: Boogie Preprocessor took 50.43ms. Allocated memory is still 188.7MB. Free memory was 137.2MB in the beginning and 133.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:28:06,959 INFO L158 Benchmark]: RCFGBuilder took 484.91ms. Allocated memory is still 188.7MB. Free memory was 133.0MB in the beginning and 143.8MB in the end (delta: -10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 11:28:06,959 INFO L158 Benchmark]: TraceAbstraction took 8980.44ms. Allocated memory was 188.7MB in the beginning and 499.1MB in the end (delta: 310.4MB). Free memory was 143.8MB in the beginning and 390.7MB in the end (delta: -246.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2024-10-11 11:28:06,959 INFO L158 Benchmark]: Witness Printer took 83.42ms. Allocated memory is still 499.1MB. Free memory was 390.7MB in the beginning and 385.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:28:06,960 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.15ms. Allocated memory is still 104.9MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.86ms. Allocated memory is still 188.7MB. Free memory was 154.0MB in the beginning and 140.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.76ms. Allocated memory is still 188.7MB. Free memory was 140.4MB in the beginning and 137.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.43ms. Allocated memory is still 188.7MB. Free memory was 137.2MB in the beginning and 133.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 484.91ms. Allocated memory is still 188.7MB. Free memory was 133.0MB in the beginning and 143.8MB in the end (delta: -10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8980.44ms. Allocated memory was 188.7MB in the beginning and 499.1MB in the end (delta: 310.4MB). Free memory was 143.8MB in the beginning and 390.7MB in the end (delta: -246.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 83.42ms. Allocated memory is still 499.1MB. Free memory was 390.7MB in the beginning and 385.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 1284 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 830 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 677 IncrementalHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 454 mSDtfsCounter, 677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 796 ConstructedInterpolants, 0 QuantifiedInterpolants, 3807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4091/4091 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: 96]: Loop Invariant Derived loop invariant: (((1 <= k_loop) && (((var_1_15 == var_1_8) && (var_1_12 <= var_1_8)) || (((var_1_8 + 1) <= var_1_12) && (var_1_15 == var_1_12)))) || ((((((0 <= 0) && (0 <= k_loop)) && (0 <= var_1_8)) && (var_1_8 <= 10)) && (var_1_8 <= 255)) && ((((((int) var_1_7 + var_1_10) < (((long long) var_1_4 + last_1_var_1_8) + 1)) || (((var_1_8 == var_1_13) || (0 != var_1_11)) && ((0 == var_1_11) || (var_1_8 == var_1_12)))) && ((var_1_8 == var_1_13) || (((long long) var_1_4 + last_1_var_1_8) < ((int) var_1_7 + var_1_10)))) || (0 == var_1_9)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((0 <= 0) && (var_1_8 <= 10)) Ensures: ((0 <= 0) && (var_1_8 <= 10)) RESULT: Ultimate proved your program to be correct! [2024-10-11 11:28:06,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE