./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_floatingpointinfluence_no-floats_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c08e298bb7aac7d16b13b163ba441c44abcb15bebd24ce40c6ff0047aaae035 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:42:39,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:42:39,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:42:39,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:42:39,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:42:39,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:42:39,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:42:39,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:42:39,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:42:39,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:42:39,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:42:39,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:42:39,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:42:39,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:42:39,159 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:42:39,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:42:39,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:42:39,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:42:39,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:42:39,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:42:39,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:42:39,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:42:39,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:42:39,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:42:39,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:42:39,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:42:39,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:42:39,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:42:39,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:42:39,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:42:39,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:42:39,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:42:39,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:42:39,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:42:39,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:42:39,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:42:39,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:42:39,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:42:39,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:42:39,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:42:39,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:42:39,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:42:39,172 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c08e298bb7aac7d16b13b163ba441c44abcb15bebd24ce40c6ff0047aaae035 [2024-10-13 03:42:39,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:42:39,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:42:39,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:42:39,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:42:39,425 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:42:39,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-99.i [2024-10-13 03:42:40,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:42:41,060 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:42:41,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-99.i [2024-10-13 03:42:41,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2f26124/cc10d442098a4159b8af0b21b77ebabb/FLAG332c15bbb [2024-10-13 03:42:41,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2f26124/cc10d442098a4159b8af0b21b77ebabb [2024-10-13 03:42:41,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:42:41,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:42:41,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:42:41,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:42:41,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:42:41,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a885974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41, skipping insertion in model container [2024-10-13 03:42:41,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:42:41,280 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_floatingpointinfluence_no-floats_file-99.i[916,929] [2024-10-13 03:42:41,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:42:41,343 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:42:41,371 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_floatingpointinfluence_no-floats_file-99.i[916,929] [2024-10-13 03:42:41,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:42:41,414 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:42:41,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41 WrapperNode [2024-10-13 03:42:41,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:42:41,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:42:41,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:42:41,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:42:41,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,457 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-10-13 03:42:41,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:42:41,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:42:41,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:42:41,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:42:41,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,484 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-13 03:42:41,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:42:41,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:42:41,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:42:41,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:42:41,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (1/1) ... [2024-10-13 03:42:41,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:42:41,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:42:41,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:42:41,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:42:41,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:42:41,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:42:41,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:42:41,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:42:41,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:42:41,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:42:41,670 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:42:41,672 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:42:41,932 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:42:41,932 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:42:41,976 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:42:41,977 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:42:41,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:42:41 BoogieIcfgContainer [2024-10-13 03:42:41,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:42:41,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:42:41,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:42:41,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:42:41,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:42:41" (1/3) ... [2024-10-13 03:42:41,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a515a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:42:41, skipping insertion in model container [2024-10-13 03:42:41,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:42:41" (2/3) ... [2024-10-13 03:42:41,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a515a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:42:41, skipping insertion in model container [2024-10-13 03:42:41,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:42:41" (3/3) ... [2024-10-13 03:42:41,989 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-99.i [2024-10-13 03:42:42,006 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:42:42,007 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:42:42,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:42:42,083 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;@4dec85e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:42:42,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:42:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:42:42,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 03:42:42,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:42:42,099 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:42:42,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:42:42,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:42:42,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1656426976, now seen corresponding path program 1 times [2024-10-13 03:42:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:42:42,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38456289] [2024-10-13 03:42:42,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:42:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:42:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:42:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:42:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:42:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:42:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:42:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:42:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:42:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:42:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:42:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:42:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:42:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:42:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:42:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:42:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:42:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:42:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:42:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:42:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:42:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:42:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:42:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:42:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:42:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:42:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:42:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 03:42:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:42:42,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38456289] [2024-10-13 03:42:42,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38456289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:42:42,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:42:42,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:42:42,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790686163] [2024-10-13 03:42:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:42:42,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:42:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:42:42,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:42:42,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:42:42,591 INFO L87 Difference]: Start difference. First operand has 56 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 03:42:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:42:42,637 INFO L93 Difference]: Finished difference Result 109 states and 199 transitions. [2024-10-13 03:42:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:42:42,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 146 [2024-10-13 03:42:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:42:42,647 INFO L225 Difference]: With dead ends: 109 [2024-10-13 03:42:42,647 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 03:42:42,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-13 03:42:42,655 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:42:42,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:42:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 03:42:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 03:42:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:42:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2024-10-13 03:42:42,718 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 146 [2024-10-13 03:42:42,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:42:42,719 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 83 transitions. [2024-10-13 03:42:42,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 03:42:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 83 transitions. [2024-10-13 03:42:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 03:42:42,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:42:42,726 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:42:42,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:42:42,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:42:42,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:42:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash 385200542, now seen corresponding path program 1 times [2024-10-13 03:42:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:42:42,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459098617] [2024-10-13 03:42:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:42:42,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:42:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:42:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:42:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:42:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:42:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:42:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:42:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:42:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:42:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:42:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:42:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:42:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:42:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:42:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:42:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:42:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:42:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:42:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:42:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:42:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:42:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:42:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:42:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:42:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:42:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:42:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 03:42:52,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:42:52,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459098617] [2024-10-13 03:42:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459098617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:42:52,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:42:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 03:42:52,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737872158] [2024-10-13 03:42:52,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:42:52,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:42:52,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:42:52,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:42:52,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:42:52,671 INFO L87 Difference]: Start difference. First operand 54 states and 83 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:42:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:42:53,153 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-10-13 03:42:53,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 03:42:53,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 146 [2024-10-13 03:42:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:42:53,156 INFO L225 Difference]: With dead ends: 70 [2024-10-13 03:42:53,156 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 03:42:53,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:42:53,158 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:42:53,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 261 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:42:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 03:42:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-10-13 03:42:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:42:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2024-10-13 03:42:53,171 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 146 [2024-10-13 03:42:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:42:53,173 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2024-10-13 03:42:53,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:42:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2024-10-13 03:42:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 03:42:53,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:42:53,175 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:42:53,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:42:53,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:42:53,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:42:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash -944324123, now seen corresponding path program 1 times [2024-10-13 03:42:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:42:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053091931] [2024-10-13 03:42:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:42:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:42:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:42:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:42:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:42:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:42:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:42:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:42:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:42:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:42:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:42:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:42:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:42:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:42:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:42:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:42:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:42:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:42:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:42:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:42:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:42:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:42:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:42:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:42:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:42:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:42:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:42:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 03:42:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:42:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053091931] [2024-10-13 03:42:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053091931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:42:57,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:42:57,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:42:57,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313361568] [2024-10-13 03:42:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:42:57,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:42:57,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:42:57,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:42:57,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:42:57,095 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:42:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:42:57,461 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2024-10-13 03:42:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:42:57,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 147 [2024-10-13 03:42:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:42:57,463 INFO L225 Difference]: With dead ends: 72 [2024-10-13 03:42:57,463 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 03:42:57,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:42:57,465 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 20 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:42:57,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 303 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:42:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 03:42:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-10-13 03:42:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:42:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-13 03:42:57,475 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 147 [2024-10-13 03:42:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:42:57,475 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-13 03:42:57,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:42:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-13 03:42:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 03:42:57,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:42:57,478 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:42:57,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:42:57,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:42:57,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:42:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash -944383705, now seen corresponding path program 1 times [2024-10-13 03:42:57,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:42:57,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398985692] [2024-10-13 03:42:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:42:57,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:42:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:43:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:43:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:43:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:43:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:43:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:43:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:43:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:43:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:43:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:43:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:43:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:43:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:43:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:43:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 03:43:02,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:02,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398985692] [2024-10-13 03:43:02,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398985692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:02,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:02,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:43:02,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213375491] [2024-10-13 03:43:02,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:02,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:43:02,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:02,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:43:02,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:43:02,337 INFO L87 Difference]: Start difference. First operand 60 states and 92 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:43:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:02,641 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2024-10-13 03:43:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:43:02,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 147 [2024-10-13 03:43:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:02,643 INFO L225 Difference]: With dead ends: 69 [2024-10-13 03:43:02,643 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 03:43:02,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:43:02,644 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 16 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:02,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 266 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:43:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 03:43:02,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-10-13 03:43:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:43:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-13 03:43:02,657 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 147 [2024-10-13 03:43:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:02,658 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-13 03:43:02,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:43:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-13 03:43:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 03:43:02,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:02,660 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:43:02,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:43:02,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:02,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1391899011, now seen corresponding path program 1 times [2024-10-13 03:43:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:02,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880211388] [2024-10-13 03:43:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:43:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:43:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:43:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:43:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:43:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:43:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:43:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:43:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:43:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:43:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:43:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:43:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:43:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:43:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 03:43:09,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:09,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880211388] [2024-10-13 03:43:09,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880211388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:09,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:09,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:43:09,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459612657] [2024-10-13 03:43:09,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:09,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:43:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:09,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:43:09,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:43:09,707 INFO L87 Difference]: Start difference. First operand 60 states and 92 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:43:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:10,775 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2024-10-13 03:43:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:43:10,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 147 [2024-10-13 03:43:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:10,777 INFO L225 Difference]: With dead ends: 68 [2024-10-13 03:43:10,777 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 03:43:10,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:43:10,779 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 28 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:10,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 428 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:43:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 03:43:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2024-10-13 03:43:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:43:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-13 03:43:10,787 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 147 [2024-10-13 03:43:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:10,788 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-13 03:43:10,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:43:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-13 03:43:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 03:43:10,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:10,790 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:43:10,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:43:10,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:10,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 198557344, now seen corresponding path program 1 times [2024-10-13 03:43:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015798060] [2024-10-13 03:43:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:43:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:43:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:43:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:43:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:43:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:43:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:43:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:43:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:43:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:43:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:43:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:43:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:43:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:43:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 03:43:18,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:18,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015798060] [2024-10-13 03:43:18,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015798060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:18,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:18,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 03:43:18,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149239563] [2024-10-13 03:43:18,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:18,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 03:43:18,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:18,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 03:43:18,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:43:18,145 INFO L87 Difference]: Start difference. First operand 60 states and 92 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:43:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:18,992 INFO L93 Difference]: Finished difference Result 64 states and 96 transitions. [2024-10-13 03:43:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 03:43:18,992 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 148 [2024-10-13 03:43:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:18,993 INFO L225 Difference]: With dead ends: 64 [2024-10-13 03:43:18,993 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 03:43:18,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-10-13 03:43:18,995 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 24 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:18,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 387 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:43:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 03:43:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 03:43:18,996 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-13 03:43:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 03:43:18,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2024-10-13 03:43:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:18,997 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 03:43:18,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:43:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 03:43:18,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 03:43:19,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:43:19,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:43:19,005 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 03:43:19,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 03:43:19,039 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:43:19,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:43:19 BoogieIcfgContainer [2024-10-13 03:43:19,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:43:19,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:43:19,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:43:19,053 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:43:19,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:42:41" (3/4) ... [2024-10-13 03:43:19,055 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 03:43:19,059 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 03:43:19,064 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-13 03:43:19,064 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 03:43:19,064 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 03:43:19,065 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 03:43:19,180 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 03:43:19,181 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 03:43:19,181 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:43:19,182 INFO L158 Benchmark]: Toolchain (without parser) took 38092.99ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 115.1MB in the beginning and 687.6MB in the end (delta: -572.5MB). Peak memory consumption was 530.7MB. Max. memory is 16.1GB. [2024-10-13 03:43:19,182 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 50.2MB in the beginning and 50.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:43:19,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.07ms. Allocated memory is still 174.1MB. Free memory was 115.1MB in the beginning and 144.7MB in the end (delta: -29.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:43:19,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.55ms. Allocated memory is still 174.1MB. Free memory was 144.7MB in the beginning and 142.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:43:19,183 INFO L158 Benchmark]: Boogie Preprocessor took 46.79ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 139.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:43:19,183 INFO L158 Benchmark]: RCFGBuilder took 472.51ms. Allocated memory is still 174.1MB. Free memory was 139.7MB in the beginning and 120.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 03:43:19,183 INFO L158 Benchmark]: TraceAbstraction took 37069.32ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 120.4MB in the beginning and 693.9MB in the end (delta: -573.4MB). Peak memory consumption was 532.8MB. Max. memory is 16.1GB. [2024-10-13 03:43:19,183 INFO L158 Benchmark]: Witness Printer took 128.47ms. Allocated memory is still 1.3GB. Free memory was 693.9MB in the beginning and 687.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:43:19,185 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 50.2MB in the beginning and 50.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.07ms. Allocated memory is still 174.1MB. Free memory was 115.1MB in the beginning and 144.7MB in the end (delta: -29.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.55ms. Allocated memory is still 174.1MB. Free memory was 144.7MB in the beginning and 142.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.79ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 139.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 472.51ms. Allocated memory is still 174.1MB. Free memory was 139.7MB in the beginning and 120.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 37069.32ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 120.4MB in the beginning and 693.9MB in the end (delta: -573.4MB). Peak memory consumption was 532.8MB. Max. memory is 16.1GB. * Witness Printer took 128.47ms. Allocated memory is still 1.3GB. Free memory was 693.9MB in the beginning and 687.6MB in the end (delta: 6.3MB). 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, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.0s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 1725 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1275 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 666 IncrementalHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 450 mSDtfsCounter, 666 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=3, InterpolantAutomatonStates: 46, 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, 6 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 33.2s InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 5013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 7200/7200 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: 112]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-13 03:43:19,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE