./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 4a390ef5 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-dev-4a390ef-m [2024-10-24 09:01:04,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:01:04,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:01:04,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:01:04,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:01:04,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:01:04,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:01:04,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:01:04,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:01:04,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:01:04,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:01:04,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:01:04,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:01:04,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:01:04,720 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:01:04,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:01:04,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:01:04,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:01:04,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:01:04,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:01:04,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:01:04,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:01:04,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:01:04,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:01:04,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:01:04,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:01:04,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:01:04,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:01:04,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:01:04,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:01:04,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:01:04,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:01:04,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:01:04,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:01:04,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:01:04,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:01:04,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:01:04,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:01:04,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:01:04,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:01:04,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:01:04,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:01:04,734 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-24 09:01:05,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:01:05,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:01:05,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:01:05,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:01:05,043 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:01:05,044 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-24 09:01:06,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:01:06,648 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:01:06,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-99.i [2024-10-24 09:01:06,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff25d0fdb/617cebee394c4e8c849762a386a707e2/FLAG291ec0810 [2024-10-24 09:01:07,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff25d0fdb/617cebee394c4e8c849762a386a707e2 [2024-10-24 09:01:07,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:01:07,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:01:07,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:01:07,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:01:07,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:01:07,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298968bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07, skipping insertion in model container [2024-10-24 09:01:07,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:01:07,231 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-24 09:01:07,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:01:07,280 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:01:07,292 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-24 09:01:07,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:01:07,332 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:01:07,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07 WrapperNode [2024-10-24 09:01:07,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:01:07,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:01:07,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:01:07,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:01:07,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,380 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-10-24 09:01:07,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:01:07,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:01:07,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:01:07,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:01:07,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,411 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-24 09:01:07,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:01:07,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:01:07,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:01:07,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:01:07,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (1/1) ... [2024-10-24 09:01:07,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:01:07,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:01:07,465 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-24 09:01:07,467 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-24 09:01:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:01:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:01:07,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:01:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:01:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:01:07,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:01:07,643 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:01:07,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:01:07,923 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 09:01:07,924 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:01:07,971 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:01:07,971 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:01:07,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:01:07 BoogieIcfgContainer [2024-10-24 09:01:07,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:01:07,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:01:07,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:01:07,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:01:07,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:01:07" (1/3) ... [2024-10-24 09:01:07,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e6cf19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:01:07, skipping insertion in model container [2024-10-24 09:01:07,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:01:07" (2/3) ... [2024-10-24 09:01:07,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e6cf19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:01:07, skipping insertion in model container [2024-10-24 09:01:07,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:01:07" (3/3) ... [2024-10-24 09:01:07,978 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-99.i [2024-10-24 09:01:07,995 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:01:07,995 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:01:08,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:01:08,060 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;@3e5a699, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:01:08,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:01:08,063 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-24 09:01:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 09:01:08,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:08,075 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-24 09:01:08,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:08,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1656426976, now seen corresponding path program 1 times [2024-10-24 09:01:08,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:01:08,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005317767] [2024-10-24 09:01:08,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:08,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:01:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:01:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:01:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:01:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:01:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:01:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:01:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:01:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:01:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:01:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:01:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:01:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:01:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:01:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:01:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:01:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:01:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:01:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:01:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:01:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 09:01:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:01:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:01:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 09:01:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 09:01:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 09:01:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:08,450 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-24 09:01:08,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:01:08,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005317767] [2024-10-24 09:01:08,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005317767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:01:08,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:01:08,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:01:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340257136] [2024-10-24 09:01:08,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:01:08,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:01:08,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:01:08,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:01:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:01:08,488 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-24 09:01:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:01:08,544 INFO L93 Difference]: Finished difference Result 109 states and 199 transitions. [2024-10-24 09:01:08,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:01:08,548 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-24 09:01:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:01:08,556 INFO L225 Difference]: With dead ends: 109 [2024-10-24 09:01:08,556 INFO L226 Difference]: Without dead ends: 54 [2024-10-24 09:01:08,560 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-24 09:01:08,563 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-24 09:01:08,564 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-24 09:01:08,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-24 09:01:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-24 09:01:08,618 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-24 09:01:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2024-10-24 09:01:08,624 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 146 [2024-10-24 09:01:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:01:08,626 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 83 transitions. [2024-10-24 09:01:08,626 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-24 09:01:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 83 transitions. [2024-10-24 09:01:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 09:01:08,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:08,632 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-24 09:01:08,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:01:08,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:08,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:08,634 INFO L85 PathProgramCache]: Analyzing trace with hash 385200542, now seen corresponding path program 1 times [2024-10-24 09:01:08,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:01:08,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487124793] [2024-10-24 09:01:08,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:01:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:01:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:01:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:01:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:01:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:01:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:01:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:01:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:01:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:01:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:01:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:01:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:01:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:01:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:01:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:01:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:01:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:01:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:01:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:01:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 09:01:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:01:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:01:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 09:01:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 09:01:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 09:01:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:18,168 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-24 09:01:18,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:01:18,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487124793] [2024-10-24 09:01:18,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487124793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:01:18,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:01:18,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 09:01:18,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868890316] [2024-10-24 09:01:18,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:01:18,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:01:18,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:01:18,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:01:18,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:01:18,175 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-24 09:01:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:01:18,671 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-10-24 09:01:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 09:01:18,672 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-24 09:01:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:01:18,674 INFO L225 Difference]: With dead ends: 70 [2024-10-24 09:01:18,674 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 09:01:18,675 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-24 09:01:18,676 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-24 09:01:18,676 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-24 09:01:18,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 09:01:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-10-24 09:01:18,689 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-24 09:01:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2024-10-24 09:01:18,691 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 146 [2024-10-24 09:01:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:01:18,693 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2024-10-24 09:01:18,693 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-24 09:01:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2024-10-24 09:01:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 09:01:18,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:18,696 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-24 09:01:18,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:01:18,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:18,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash -944324123, now seen corresponding path program 1 times [2024-10-24 09:01:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:01:18,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769892370] [2024-10-24 09:01:18,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:18,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:01:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:01:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:01:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:01:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:01:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:01:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:01:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:01:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:01:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:01:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:01:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:01:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:01:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:01:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:01:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:01:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:01:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:01:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:01:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:01:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 09:01:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:01:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:01:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 09:01:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 09:01:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 09:01:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:22,637 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-24 09:01:22,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:01:22,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769892370] [2024-10-24 09:01:22,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769892370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:01:22,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:01:22,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 09:01:22,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358538751] [2024-10-24 09:01:22,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:01:22,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 09:01:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:01:22,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 09:01:22,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:01:22,640 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-24 09:01:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:01:23,127 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2024-10-24 09:01:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 09:01:23,127 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-24 09:01:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:01:23,129 INFO L225 Difference]: With dead ends: 72 [2024-10-24 09:01:23,129 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 09:01:23,130 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-24 09:01:23,132 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 20 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:01:23,132 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.3s Time] [2024-10-24 09:01:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 09:01:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-10-24 09:01:23,142 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-24 09:01:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-24 09:01:23,144 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 147 [2024-10-24 09:01:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:01:23,145 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-24 09:01:23,145 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-24 09:01:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-24 09:01:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 09:01:23,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:23,148 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-24 09:01:23,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:01:23,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:23,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:23,149 INFO L85 PathProgramCache]: Analyzing trace with hash -944383705, now seen corresponding path program 1 times [2024-10-24 09:01:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:01:23,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374931146] [2024-10-24 09:01:23,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:01:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:01:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:01:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:01:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:01:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:01:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:01:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:01:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:01:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:01:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:01:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:01:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:01:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:01:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:01:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:01:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:01:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:01:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:01:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:01:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 09:01:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:01:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:01:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 09:01:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 09:01:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 09:01:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:27,984 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-24 09:01:27,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:01:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374931146] [2024-10-24 09:01:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374931146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:01:27,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:01:27,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 09:01:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171805053] [2024-10-24 09:01:27,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:01:27,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 09:01:27,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:01:27,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 09:01:27,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:01:27,987 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-24 09:01:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:01:28,325 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2024-10-24 09:01:28,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 09:01:28,326 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-24 09:01:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:01:28,327 INFO L225 Difference]: With dead ends: 69 [2024-10-24 09:01:28,328 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 09:01:28,328 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-24 09:01:28,330 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-24 09:01:28,330 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-24 09:01:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 09:01:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-10-24 09:01:28,338 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-24 09:01:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-24 09:01:28,339 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 147 [2024-10-24 09:01:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:01:28,340 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-24 09:01:28,340 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-24 09:01:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-24 09:01:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 09:01:28,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:28,342 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-24 09:01:28,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:01:28,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:28,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:28,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1391899011, now seen corresponding path program 1 times [2024-10-24 09:01:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:01:28,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360972372] [2024-10-24 09:01:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:28,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:01:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:01:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:01:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:01:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:01:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:01:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:01:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:01:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:01:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:01:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:01:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:01:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:01:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:01:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:01:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:01:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:01:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:01:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:01:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:01:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 09:01:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:01:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:01:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 09:01:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 09:01:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 09:01:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:35,482 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-24 09:01:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:01:35,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360972372] [2024-10-24 09:01:35,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360972372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:01:35,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:01:35,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 09:01:35,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654219919] [2024-10-24 09:01:35,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:01:35,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:01:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:01:35,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:01:35,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:01:35,486 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-24 09:01:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:01:36,417 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2024-10-24 09:01:36,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 09:01:36,417 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-24 09:01:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:01:36,419 INFO L225 Difference]: With dead ends: 68 [2024-10-24 09:01:36,419 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 09:01:36,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-24 09:01:36,421 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 28 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-24 09:01:36,421 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-24 09:01:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 09:01:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2024-10-24 09:01:36,428 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-24 09:01:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-24 09:01:36,429 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 147 [2024-10-24 09:01:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:01:36,430 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-24 09:01:36,430 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-24 09:01:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-24 09:01:36,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 09:01:36,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:01:36,432 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-24 09:01:36,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:01:36,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:01:36,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:01:36,433 INFO L85 PathProgramCache]: Analyzing trace with hash 198557344, now seen corresponding path program 1 times [2024-10-24 09:01:36,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:01:36,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976590235] [2024-10-24 09:01:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:01:36,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:01:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:01:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:01:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:01:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:01:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:01:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:01:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:01:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:01:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:01:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:01:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:01:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:01:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:01:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:01:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:01:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:01:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:01:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:01:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:01:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 09:01:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:01:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:01:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 09:01:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 09:01:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 09:01:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:43,742 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-24 09:01:43,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:01:43,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976590235] [2024-10-24 09:01:43,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976590235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:01:43,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:01:43,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 09:01:43,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364768425] [2024-10-24 09:01:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:01:43,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 09:01:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:01:43,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 09:01:43,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 09:01:43,745 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-24 09:01:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:01:44,558 INFO L93 Difference]: Finished difference Result 64 states and 96 transitions. [2024-10-24 09:01:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 09:01:44,559 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-24 09:01:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:01:44,559 INFO L225 Difference]: With dead ends: 64 [2024-10-24 09:01:44,560 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 09:01:44,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:01:44,561 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-24 09:01:44,561 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-24 09:01:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 09:01:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 09:01:44,562 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-24 09:01:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 09:01:44,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2024-10-24 09:01:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:01:44,563 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 09:01:44,563 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-24 09:01:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 09:01:44,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 09:01:44,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:01:44,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 09:01:44,571 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 09:01:44,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 09:01:44,609 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:01:44,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:01:44 BoogieIcfgContainer [2024-10-24 09:01:44,631 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:01:44,632 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:01:44,632 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:01:44,633 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:01:44,633 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:01:07" (3/4) ... [2024-10-24 09:01:44,635 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 09:01:44,638 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 09:01:44,645 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-24 09:01:44,645 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-24 09:01:44,646 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 09:01:44,646 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 09:01:44,751 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 09:01:44,752 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 09:01:44,752 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:01:44,753 INFO L158 Benchmark]: Toolchain (without parser) took 37734.83ms. Allocated memory was 163.6MB in the beginning and 1.1GB in the end (delta: 918.6MB). Free memory was 114.6MB in the beginning and 599.1MB in the end (delta: -484.5MB). Peak memory consumption was 433.7MB. Max. memory is 16.1GB. [2024-10-24 09:01:44,753 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:01:44,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.70ms. Allocated memory is still 163.6MB. Free memory was 114.6MB in the beginning and 100.7MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 09:01:44,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.74ms. Allocated memory is still 163.6MB. Free memory was 100.7MB in the beginning and 98.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:01:44,754 INFO L158 Benchmark]: Boogie Preprocessor took 43.64ms. Allocated memory is still 163.6MB. Free memory was 98.7MB in the beginning and 95.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:01:44,754 INFO L158 Benchmark]: RCFGBuilder took 545.57ms. Allocated memory is still 163.6MB. Free memory was 95.8MB in the beginning and 117.9MB in the end (delta: -22.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:01:44,754 INFO L158 Benchmark]: TraceAbstraction took 36657.93ms. Allocated memory was 163.6MB in the beginning and 1.1GB in the end (delta: 918.6MB). Free memory was 117.1MB in the beginning and 605.4MB in the end (delta: -488.3MB). Peak memory consumption was 433.3MB. Max. memory is 16.1GB. [2024-10-24 09:01:44,754 INFO L158 Benchmark]: Witness Printer took 119.92ms. Allocated memory is still 1.1GB. Free memory was 605.4MB in the beginning and 599.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:01:44,756 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.17ms. Allocated memory is still 100.7MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.70ms. Allocated memory is still 163.6MB. Free memory was 114.6MB in the beginning and 100.7MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.74ms. Allocated memory is still 163.6MB. Free memory was 100.7MB in the beginning and 98.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.64ms. Allocated memory is still 163.6MB. Free memory was 98.7MB in the beginning and 95.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 545.57ms. Allocated memory is still 163.6MB. Free memory was 95.8MB in the beginning and 117.9MB in the end (delta: -22.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 36657.93ms. Allocated memory was 163.6MB in the beginning and 1.1GB in the end (delta: 918.6MB). Free memory was 117.1MB in the beginning and 605.4MB in the end (delta: -488.3MB). Peak memory consumption was 433.3MB. Max. memory is 16.1GB. * Witness Printer took 119.92ms. Allocated memory is still 1.1GB. Free memory was 605.4MB in the beginning and 599.1MB 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: 36.5s, 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.1s 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, 32.8s 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 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) RESULT: Ultimate proved your program to be correct! [2024-10-24 09:01:44,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE