./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-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec3847cd5673658302b62e6c9d30f5f024379aa30b6673222fdbc3270a2b4500 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:55:01,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:55:01,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:55:01,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:55:01,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:55:01,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:55:01,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:55:01,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:55:01,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:55:01,913 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:55:01,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:55:01,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:55:01,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:55:01,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:55:01,915 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:55:01,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:55:01,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:55:01,916 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:55:01,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:55:01,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:55:01,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:55:01,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:55:01,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:55:01,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:55:01,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:55:01,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:55:01,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:55:01,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:55:01,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:55:01,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:55:01,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:55:01,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:55:01,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:01,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:55:01,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:55:01,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:55:01,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:55:01,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:55:01,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:55:01,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:55:01,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:55:01,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:55:01,926 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec3847cd5673658302b62e6c9d30f5f024379aa30b6673222fdbc3270a2b4500 [2024-10-11 10:55:02,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:55:02,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:55:02,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:55:02,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:55:02,219 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:55:02,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i [2024-10-11 10:55:03,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:55:03,872 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:55:03,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i [2024-10-11 10:55:03,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c3aa521d6/1b591841f29e4bd9843eb04cea951bb6/FLAGe28ef0fcb [2024-10-11 10:55:03,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c3aa521d6/1b591841f29e4bd9843eb04cea951bb6 [2024-10-11 10:55:03,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:55:03,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:55:03,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:03,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:55:03,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:55:03,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:03" (1/1) ... [2024-10-11 10:55:03,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5aadc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:03, skipping insertion in model container [2024-10-11 10:55:03,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:03" (1/1) ... [2024-10-11 10:55:03,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:55:04,134 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-32.i[916,929] [2024-10-11 10:55:04,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:04,185 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:55:04,199 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-32.i[916,929] [2024-10-11 10:55:04,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:04,242 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:55:04,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04 WrapperNode [2024-10-11 10:55:04,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:04,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:04,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:55:04,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:55:04,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,297 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-10-11 10:55:04,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:04,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:55:04,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:55:04,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:55:04,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,340 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:55:04,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:55:04,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:55:04,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:55:04,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:55:04,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (1/1) ... [2024-10-11 10:55:04,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:04,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:04,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:55:04,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:55:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:55:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:55:04,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:55:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:55:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:55:04,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:55:04,554 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:55:04,558 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:55:04,820 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 10:55:04,820 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:55:04,865 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:55:04,866 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:55:04,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:04 BoogieIcfgContainer [2024-10-11 10:55:04,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:55:04,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:55:04,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:55:04,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:55:04,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:55:03" (1/3) ... [2024-10-11 10:55:04,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db2f919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:04, skipping insertion in model container [2024-10-11 10:55:04,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:04" (2/3) ... [2024-10-11 10:55:04,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db2f919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:04, skipping insertion in model container [2024-10-11 10:55:04,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:04" (3/3) ... [2024-10-11 10:55:04,876 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-32.i [2024-10-11 10:55:04,897 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:55:04,897 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:55:04,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:55:04,977 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;@41a107a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:55:04,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:55:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:55:04,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 10:55:04,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:04,996 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:04,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:05,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:05,002 INFO L85 PathProgramCache]: Analyzing trace with hash 887830059, now seen corresponding path program 1 times [2024-10-11 10:55:05,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:05,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365407685] [2024-10-11 10:55:05,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:05,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:55:05,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:05,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365407685] [2024-10-11 10:55:05,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365407685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:05,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:05,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:55:05,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261701471] [2024-10-11 10:55:05,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:05,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:55:05,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:05,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:55:05,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:55:05,763 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:05,931 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2024-10-11 10:55:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:55:05,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2024-10-11 10:55:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:05,944 INFO L225 Difference]: With dead ends: 95 [2024-10-11 10:55:05,951 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 10:55:05,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:55:05,959 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:05,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:55:05,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 10:55:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 10:55:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:55:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2024-10-11 10:55:06,012 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 109 [2024-10-11 10:55:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:06,014 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2024-10-11 10:55:06,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2024-10-11 10:55:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 10:55:06,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:06,020 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:06,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:55:06,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:06,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:06,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1697176685, now seen corresponding path program 1 times [2024-10-11 10:55:06,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:06,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861603472] [2024-10-11 10:55:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:06,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:12,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:55:12,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:12,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861603472] [2024-10-11 10:55:12,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861603472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:12,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 10:55:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877663804] [2024-10-11 10:55:12,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:12,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:55:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:12,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:55:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:55:12,022 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 10:55:13,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:13,175 INFO L93 Difference]: Finished difference Result 151 states and 213 transitions. [2024-10-11 10:55:13,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 10:55:13,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 109 [2024-10-11 10:55:13,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:13,179 INFO L225 Difference]: With dead ends: 151 [2024-10-11 10:55:13,179 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 10:55:13,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2024-10-11 10:55:13,183 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 215 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:13,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 318 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 10:55:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 10:55:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 73. [2024-10-11 10:55:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 10:55:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2024-10-11 10:55:13,216 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 109 [2024-10-11 10:55:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:13,217 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2024-10-11 10:55:13,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 10:55:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2024-10-11 10:55:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 10:55:13,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:13,220 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:13,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:55:13,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:13,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1057797391, now seen corresponding path program 1 times [2024-10-11 10:55:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:13,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655702565] [2024-10-11 10:55:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:55:17,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:17,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655702565] [2024-10-11 10:55:17,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655702565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:17,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:17,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:55:17,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046467952] [2024-10-11 10:55:17,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:17,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:55:17,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:17,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:55:17,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:55:17,139 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:17,422 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2024-10-11 10:55:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:55:17,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 110 [2024-10-11 10:55:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:17,426 INFO L225 Difference]: With dead ends: 92 [2024-10-11 10:55:17,426 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 10:55:17,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:55:17,428 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:17,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 259 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:55:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 10:55:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2024-10-11 10:55:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 10:55:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2024-10-11 10:55:17,447 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 108 transitions. Word has length 110 [2024-10-11 10:55:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:17,448 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 108 transitions. [2024-10-11 10:55:17,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 108 transitions. [2024-10-11 10:55:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 10:55:17,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:17,450 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:17,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:55:17,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:17,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1577699368, now seen corresponding path program 1 times [2024-10-11 10:55:17,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:17,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656782703] [2024-10-11 10:55:17,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:17,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:55:22,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:22,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656782703] [2024-10-11 10:55:22,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656782703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:22,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:22,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:55:22,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230579542] [2024-10-11 10:55:22,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:22,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:55:22,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:22,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:55:22,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:55:22,571 INFO L87 Difference]: Start difference. First operand 74 states and 108 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:23,191 INFO L93 Difference]: Finished difference Result 86 states and 121 transitions. [2024-10-11 10:55:23,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 10:55:23,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-10-11 10:55:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:23,193 INFO L225 Difference]: With dead ends: 86 [2024-10-11 10:55:23,193 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 10:55:23,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:55:23,195 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 37 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:23,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 360 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:55:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 10:55:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2024-10-11 10:55:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 10:55:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 107 transitions. [2024-10-11 10:55:23,213 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 107 transitions. Word has length 111 [2024-10-11 10:55:23,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:23,214 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 107 transitions. [2024-10-11 10:55:23,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 107 transitions. [2024-10-11 10:55:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 10:55:23,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:23,218 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:23,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:55:23,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:23,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash 958873527, now seen corresponding path program 1 times [2024-10-11 10:55:23,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:23,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449760845] [2024-10-11 10:55:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:55:24,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449760845] [2024-10-11 10:55:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449760845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:24,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 10:55:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345374331] [2024-10-11 10:55:24,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:24,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:55:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:24,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:55:24,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:55:24,927 INFO L87 Difference]: Start difference. First operand 73 states and 107 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:25,457 INFO L93 Difference]: Finished difference Result 164 states and 233 transitions. [2024-10-11 10:55:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 10:55:25,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-10-11 10:55:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:25,459 INFO L225 Difference]: With dead ends: 164 [2024-10-11 10:55:25,459 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 10:55:25,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 10:55:25,461 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 43 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:25,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:55:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 10:55:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2024-10-11 10:55:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 10:55:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2024-10-11 10:55:25,489 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 111 [2024-10-11 10:55:25,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:25,489 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2024-10-11 10:55:25,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2024-10-11 10:55:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 10:55:25,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:25,492 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:25,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:55:25,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:25,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:25,493 INFO L85 PathProgramCache]: Analyzing trace with hash -354764027, now seen corresponding path program 1 times [2024-10-11 10:55:25,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492384014] [2024-10-11 10:55:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:55:26,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:26,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492384014] [2024-10-11 10:55:26,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492384014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:26,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:26,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 10:55:26,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424098188] [2024-10-11 10:55:26,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:26,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:55:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:26,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:55:26,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:55:26,800 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:27,544 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2024-10-11 10:55:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 10:55:27,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2024-10-11 10:55:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:27,546 INFO L225 Difference]: With dead ends: 90 [2024-10-11 10:55:27,546 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 10:55:27,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-10-11 10:55:27,547 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 55 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:27,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 317 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 10:55:27,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 10:55:27,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2024-10-11 10:55:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 10:55:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2024-10-11 10:55:27,563 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 112 [2024-10-11 10:55:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:27,564 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2024-10-11 10:55:27,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2024-10-11 10:55:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 10:55:27,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:27,568 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:27,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:55:27,568 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:27,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1877596512, now seen corresponding path program 1 times [2024-10-11 10:55:27,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:27,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339121973] [2024-10-11 10:55:27,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:27,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:55:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339121973] [2024-10-11 10:55:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339121973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:32,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:32,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 10:55:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235524125] [2024-10-11 10:55:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:55:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:32,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:55:32,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:55:32,338 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:33,170 INFO L93 Difference]: Finished difference Result 84 states and 117 transitions. [2024-10-11 10:55:33,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 10:55:33,171 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-10-11 10:55:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:33,171 INFO L225 Difference]: With dead ends: 84 [2024-10-11 10:55:33,171 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 10:55:33,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-10-11 10:55:33,172 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 50 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:33,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 192 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:55:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 10:55:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 10:55:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 10:55:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 10:55:33,173 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2024-10-11 10:55:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:33,174 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 10:55:33,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:55:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 10:55:33,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 10:55:33,177 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:55:33,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:55:33,180 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:33,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 10:56:23,115 WARN L286 SmtUtils]: Spent 49.92s on a formula simplification. DAG size of input: 240 DAG size of output: 410 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-11 10:56:24,794 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:56:24,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:56:24 BoogieIcfgContainer [2024-10-11 10:56:24,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:56:24,815 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:56:24,815 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:56:24,815 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:56:24,818 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:04" (3/4) ... [2024-10-11 10:56:24,821 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 10:56:24,824 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 10:56:24,829 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 10:56:24,830 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 10:56:24,831 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 10:56:24,831 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 10:56:24,936 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 10:56:24,936 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 10:56:24,936 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:56:24,937 INFO L158 Benchmark]: Toolchain (without parser) took 81022.40ms. Allocated memory was 167.8MB in the beginning and 828.4MB in the end (delta: 660.6MB). Free memory was 111.9MB in the beginning and 768.5MB in the end (delta: -656.6MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-11 10:56:24,937 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:56:24,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.97ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 97.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:56:24,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.82ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 93.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:56:24,938 INFO L158 Benchmark]: Boogie Preprocessor took 67.86ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 89.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:56:24,938 INFO L158 Benchmark]: RCFGBuilder took 496.95ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 68.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 10:56:24,939 INFO L158 Benchmark]: TraceAbstraction took 79945.52ms. Allocated memory was 167.8MB in the beginning and 828.4MB in the end (delta: 660.6MB). Free memory was 67.9MB in the beginning and 774.8MB in the end (delta: -706.9MB). Peak memory consumption was 434.2MB. Max. memory is 16.1GB. [2024-10-11 10:56:24,939 INFO L158 Benchmark]: Witness Printer took 121.67ms. Allocated memory is still 828.4MB. Free memory was 774.8MB in the beginning and 768.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 10:56:24,941 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 167.8MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.97ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 97.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.82ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 93.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.86ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 89.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 496.95ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 68.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 79945.52ms. Allocated memory was 167.8MB in the beginning and 828.4MB in the end (delta: 660.6MB). Free memory was 67.9MB in the beginning and 774.8MB in the end (delta: -706.9MB). Peak memory consumption was 434.2MB. Max. memory is 16.1GB. * Witness Printer took 121.67ms. Allocated memory is still 828.4MB. Free memory was 774.8MB in the beginning and 768.5MB 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, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.2s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 482 mSDsluCounter, 1694 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1271 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1222 IncrementalHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 423 mSDtfsCounter, 1222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=3, InterpolantAutomatonStates: 76, 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, 7 MinimizatonAttempts, 137 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 23.0s InterpolantComputationTime, 775 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 9206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4284/4284 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: 104]: Loop Invariant Derived loop invariant: (((var_1_6 == 0) && (0 <= last_1_var_1_6)) || (((((var_1_1 == ((int) var_1_4 + var_1_3)) && ((var_1_5 + 1) <= ((int) var_1_4 + var_1_3))) || ((((int) var_1_4 + var_1_3) <= var_1_5) && (var_1_1 == var_1_5))) && (0 <= last_1_var_1_6)) && (0 <= var_1_6))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((0 <= last_1_var_1_6) && (0 <= var_1_6)) Ensures: ((0 <= last_1_var_1_6) && (0 <= var_1_6)) RESULT: Ultimate proved your program to be correct! [2024-10-11 10:56:25,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE