./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_variablewrapping_normal_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-71.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4307cdea03121abd6b33299d493d0c8e8ec5dc2377a00797e547372a86173d4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:09:00,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:09:00,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:09:00,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:09:00,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:09:00,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:09:00,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:09:00,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:09:00,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:09:00,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:09:00,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:09:00,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:09:00,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:09:00,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:09:00,949 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:09:00,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:09:00,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:09:00,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:09:00,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:09:00,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:09:00,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:09:00,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:09:00,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:09:00,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:09:00,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:09:00,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:09:00,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:09:00,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:09:00,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:09:00,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:09:00,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:09:00,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:09:00,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:09:00,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:09:00,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:09:00,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:09:00,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:09:00,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:09:00,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:09:00,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:09:00,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:09:00,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:09:00,961 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d4307cdea03121abd6b33299d493d0c8e8ec5dc2377a00797e547372a86173d4 [2024-10-24 11:09:01,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:09:01,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:09:01,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:09:01,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:09:01,208 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:09:01,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-71.i [2024-10-24 11:09:02,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:09:02,810 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:09:02,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-71.i [2024-10-24 11:09:02,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7748941da/5ec1a13d94414e30bc709800cfdf06e1/FLAGa3ac724cd [2024-10-24 11:09:02,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7748941da/5ec1a13d94414e30bc709800cfdf06e1 [2024-10-24 11:09:02,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:09:02,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:09:02,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:09:02,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:09:02,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:09:02,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:09:02" (1/1) ... [2024-10-24 11:09:02,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19199302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:02, skipping insertion in model container [2024-10-24 11:09:02,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:09:02" (1/1) ... [2024-10-24 11:09:02,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:09:02,990 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_variablewrapping_normal_file-71.i[913,926] [2024-10-24 11:09:03,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:09:03,058 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:09:03,068 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_variablewrapping_normal_file-71.i[913,926] [2024-10-24 11:09:03,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:09:03,117 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:09:03,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03 WrapperNode [2024-10-24 11:09:03,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:09:03,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:09:03,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:09:03,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:09:03,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,192 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-24 11:09:03,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:09:03,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:09:03,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:09:03,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:09:03,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,249 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:09:03,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:09:03,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:09:03,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:09:03,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:09:03,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (1/1) ... [2024-10-24 11:09:03,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:09:03,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:09:03,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:09:03,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:09:03,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:09:03,339 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:09:03,339 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:09:03,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:09:03,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:09:03,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:09:03,416 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:09:03,418 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:09:03,623 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 11:09:03,623 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:09:03,671 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:09:03,672 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:09:03,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:09:03 BoogieIcfgContainer [2024-10-24 11:09:03,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:09:03,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:09:03,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:09:03,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:09:03,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:09:02" (1/3) ... [2024-10-24 11:09:03,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1ae133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:09:03, skipping insertion in model container [2024-10-24 11:09:03,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:03" (2/3) ... [2024-10-24 11:09:03,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1ae133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:09:03, skipping insertion in model container [2024-10-24 11:09:03,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:09:03" (3/3) ... [2024-10-24 11:09:03,682 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-71.i [2024-10-24 11:09:03,698 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:09:03,698 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:09:03,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:09:03,756 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;@7c256170, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:09:03,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:09:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:09:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:09:03,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:03,774 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:03,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:03,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1398522392, now seen corresponding path program 1 times [2024-10-24 11:09:03,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:03,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656231610] [2024-10-24 11:09:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:03,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:09:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:09:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:09:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:09:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:09:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:09:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:09:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:09:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:09:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:09:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:09:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:09:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:09:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:09:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:09:04,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:04,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656231610] [2024-10-24 11:09:04,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656231610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:04,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:04,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:09:04,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127187196] [2024-10-24 11:09:04,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:04,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:09:04,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:04,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:09:04,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:09:04,166 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:09:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:04,195 INFO L93 Difference]: Finished difference Result 93 states and 167 transitions. [2024-10-24 11:09:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:09:04,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 113 [2024-10-24 11:09:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:04,207 INFO L225 Difference]: With dead ends: 93 [2024-10-24 11:09:04,207 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 11:09:04,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:09:04,213 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:04,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:09:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 11:09:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 11:09:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:09:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2024-10-24 11:09:04,259 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 113 [2024-10-24 11:09:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:04,262 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2024-10-24 11:09:04,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:09:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2024-10-24 11:09:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:09:04,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:04,269 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:04,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:09:04,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:04,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:04,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2060733338, now seen corresponding path program 1 times [2024-10-24 11:09:04,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:04,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167615486] [2024-10-24 11:09:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:04,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:09:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:09:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:09:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:09:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:09:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:09:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:09:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:09:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:09:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:09:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:09:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:09:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:09:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:09:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:09:10,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:10,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167615486] [2024-10-24 11:09:10,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167615486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:10,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:10,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:09:10,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563686577] [2024-10-24 11:09:10,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:10,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:09:10,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:10,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:09:10,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:09:10,822 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:09:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:13,067 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2024-10-24 11:09:13,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:09:13,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 113 [2024-10-24 11:09:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:13,069 INFO L225 Difference]: With dead ends: 56 [2024-10-24 11:09:13,070 INFO L226 Difference]: Without dead ends: 54 [2024-10-24 11:09:13,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:09:13,071 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:13,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 199 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 11:09:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-24 11:09:13,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-10-24 11:09:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:09:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-24 11:09:13,079 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 113 [2024-10-24 11:09:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:13,080 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-24 11:09:13,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:09:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-24 11:09:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:09:13,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:13,082 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:13,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:09:13,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:13,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1010226216, now seen corresponding path program 1 times [2024-10-24 11:09:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234315071] [2024-10-24 11:09:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:09:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:09:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:09:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:09:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:09:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:09:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:09:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:09:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:09:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:09:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:09:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:09:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:09:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:09:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:09:13,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234315071] [2024-10-24 11:09:13,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234315071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:13,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:13,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:09:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290547030] [2024-10-24 11:09:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:13,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:09:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:13,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:09:13,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:09:13,227 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:09:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:13,310 INFO L93 Difference]: Finished difference Result 137 states and 205 transitions. [2024-10-24 11:09:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:09:13,310 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 114 [2024-10-24 11:09:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:13,314 INFO L225 Difference]: With dead ends: 137 [2024-10-24 11:09:13,315 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:09:13,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-24 11:09:13,316 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 53 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:13,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 170 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:09:13,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:09:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-10-24 11:09:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 52 states have internal predecessors, (66), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:09:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 124 transitions. [2024-10-24 11:09:13,335 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 124 transitions. Word has length 114 [2024-10-24 11:09:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:13,335 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 124 transitions. [2024-10-24 11:09:13,335 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:09:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 124 transitions. [2024-10-24 11:09:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:09:13,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:13,339 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:13,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:09:13,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:13,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash 952967914, now seen corresponding path program 1 times [2024-10-24 11:09:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:13,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516048870] [2024-10-24 11:09:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:09:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:09:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:09:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:09:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:09:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:09:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:09:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:09:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:09:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:09:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:09:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:09:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:09:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:09:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:09:23,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:23,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516048870] [2024-10-24 11:09:23,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516048870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:23,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:23,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:09:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820808313] [2024-10-24 11:09:23,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:23,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:09:23,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:23,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:09:23,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:09:23,593 INFO L87 Difference]: Start difference. First operand 83 states and 124 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:09:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:25,732 INFO L93 Difference]: Finished difference Result 96 states and 139 transitions. [2024-10-24 11:09:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:09:25,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 114 [2024-10-24 11:09:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:25,736 INFO L225 Difference]: With dead ends: 96 [2024-10-24 11:09:25,737 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 11:09:25,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:09:25,738 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:25,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 217 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:09:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 11:09:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2024-10-24 11:09:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 52 states have internal predecessors, (66), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:09:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 124 transitions. [2024-10-24 11:09:25,756 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 124 transitions. Word has length 114 [2024-10-24 11:09:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:25,756 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 124 transitions. [2024-10-24 11:09:25,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:09:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 124 transitions. [2024-10-24 11:09:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 11:09:25,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:25,758 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:25,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:09:25,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:25,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:25,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1863242987, now seen corresponding path program 1 times [2024-10-24 11:09:25,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:25,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249259465] [2024-10-24 11:09:25,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:25,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:09:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:09:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:09:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:09:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:09:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:09:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:09:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:09:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:09:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:09:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:09:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:09:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:09:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:09:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:09:32,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:32,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249259465] [2024-10-24 11:09:32,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249259465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:32,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:32,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:09:32,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352388446] [2024-10-24 11:09:32,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:32,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:09:32,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:32,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:09:32,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:09:32,782 INFO L87 Difference]: Start difference. First operand 83 states and 124 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:09:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:34,272 INFO L93 Difference]: Finished difference Result 106 states and 154 transitions. [2024-10-24 11:09:34,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:09:34,273 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 115 [2024-10-24 11:09:34,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:34,274 INFO L225 Difference]: With dead ends: 106 [2024-10-24 11:09:34,275 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 11:09:34,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:09:34,275 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:34,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 256 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:09:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 11:09:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2024-10-24 11:09:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 53 states have internal predecessors, (68), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:09:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-10-24 11:09:34,285 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 115 [2024-10-24 11:09:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:34,285 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-10-24 11:09:34,285 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:09:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-10-24 11:09:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 11:09:34,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:34,287 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:34,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:09:34,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:34,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1805984685, now seen corresponding path program 1 times [2024-10-24 11:09:34,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:34,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463657047] [2024-10-24 11:09:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:09:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:09:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:09:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:09:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:09:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:09:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:09:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:09:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:09:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:09:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:09:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:09:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:09:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:09:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:09:45,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463657047] [2024-10-24 11:09:45,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463657047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:45,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:45,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:09:45,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466849156] [2024-10-24 11:09:45,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:45,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:09:45,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:45,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:09:45,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:09:45,368 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:09:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:49,157 INFO L93 Difference]: Finished difference Result 104 states and 152 transitions. [2024-10-24 11:09:49,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:09:49,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 115 [2024-10-24 11:09:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:49,160 INFO L225 Difference]: With dead ends: 104 [2024-10-24 11:09:49,161 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 11:09:49,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:09:49,161 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 48 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:49,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 285 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:09:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 11:09:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2024-10-24 11:09:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 52 states have internal predecessors, (66), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:09:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 124 transitions. [2024-10-24 11:09:49,178 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 124 transitions. Word has length 115 [2024-10-24 11:09:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:49,178 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 124 transitions. [2024-10-24 11:09:49,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:09:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 124 transitions. [2024-10-24 11:09:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 11:09:49,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:49,179 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:49,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:09:49,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:49,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash -656716947, now seen corresponding path program 1 times [2024-10-24 11:09:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658210970] [2024-10-24 11:09:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:49,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:09:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:09:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:09:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:09:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:09:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:09:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:09:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:09:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:09:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:09:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:09:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:09:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:09:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:09:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:09:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:09:59,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:59,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658210970] [2024-10-24 11:09:59,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658210970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:59,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:59,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:09:59,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411180835] [2024-10-24 11:09:59,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:59,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:09:59,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:59,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:09:59,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:09:59,047 INFO L87 Difference]: Start difference. First operand 83 states and 124 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:10:02,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:10:02,050 INFO L93 Difference]: Finished difference Result 102 states and 149 transitions. [2024-10-24 11:10:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:10:02,051 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 115 [2024-10-24 11:10:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:10:02,052 INFO L225 Difference]: With dead ends: 102 [2024-10-24 11:10:02,052 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:10:02,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:10:02,053 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 46 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:10:02,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 255 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:10:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:10:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2024-10-24 11:10:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:10:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-10-24 11:10:02,068 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 115 [2024-10-24 11:10:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:10:02,068 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-10-24 11:10:02,069 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:10:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-10-24 11:10:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 11:10:02,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:10:02,070 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:10:02,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:10:02,070 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:10:02,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:10:02,070 INFO L85 PathProgramCache]: Analyzing trace with hash -713975249, now seen corresponding path program 1 times [2024-10-24 11:10:02,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:10:02,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197233856] [2024-10-24 11:10:02,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:10:02,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:10:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:10:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:10:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:10:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:10:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:10:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:10:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:10:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:10:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:10:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:10:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:10:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:10:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:10:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:10:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:10:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:10:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:10:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:10:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:10:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:10:11,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:10:11,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197233856] [2024-10-24 11:10:11,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197233856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:10:11,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:10:11,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:10:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529421496] [2024-10-24 11:10:11,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:10:11,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:10:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:10:11,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:10:11,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:10:11,165 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:10:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:10:12,569 INFO L93 Difference]: Finished difference Result 105 states and 150 transitions. [2024-10-24 11:10:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:10:12,570 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 115 [2024-10-24 11:10:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:10:12,571 INFO L225 Difference]: With dead ends: 105 [2024-10-24 11:10:12,571 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 11:10:12,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:10:12,572 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:10:12,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 332 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:10:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 11:10:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2024-10-24 11:10:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:10:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-10-24 11:10:12,582 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 115 [2024-10-24 11:10:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:10:12,582 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-10-24 11:10:12,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:10:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-10-24 11:10:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:10:12,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:10:12,583 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:10:12,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:10:12,584 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:10:12,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:10:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash -668073484, now seen corresponding path program 1 times [2024-10-24 11:10:12,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:10:12,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651130364] [2024-10-24 11:10:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:10:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:10:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:10:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:10:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:10:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:10:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:10:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:10:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:10:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:10:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:10:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:10:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:10:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:10:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:10:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:10:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:10:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 11:10:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:10:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:10:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 11:10:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:10:15,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:10:15,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651130364] [2024-10-24 11:10:15,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651130364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:10:15,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:10:15,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:10:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109306688] [2024-10-24 11:10:15,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:10:15,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:10:15,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:10:15,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:10:15,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:10:15,486 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:10:20,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 11:10:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:10:21,299 INFO L93 Difference]: Finished difference Result 93 states and 136 transitions. [2024-10-24 11:10:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:10:21,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2024-10-24 11:10:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:10:21,300 INFO L225 Difference]: With dead ends: 93 [2024-10-24 11:10:21,301 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 11:10:21,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:10:21,304 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 45 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:10:21,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 344 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 292 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2024-10-24 11:10:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 11:10:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 11:10:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 11:10:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 11:10:21,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2024-10-24 11:10:21,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:10:21,305 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 11:10:21,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:10:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 11:10:21,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 11:10:21,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:10:21,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:10:21,312 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:10:21,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 11:10:24,058 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:10:24,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:10:24 BoogieIcfgContainer [2024-10-24 11:10:24,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:10:24,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:10:24,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:10:24,116 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:10:24,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:09:03" (3/4) ... [2024-10-24 11:10:24,118 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 11:10:24,121 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 11:10:24,125 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-24 11:10:24,126 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-24 11:10:24,126 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 11:10:24,126 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 11:10:24,218 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 11:10:24,219 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 11:10:24,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:10:24,219 INFO L158 Benchmark]: Toolchain (without parser) took 81384.59ms. Allocated memory was 176.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 107.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 598.0MB. Max. memory is 16.1GB. [2024-10-24 11:10:24,220 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory was 132.9MB in the beginning and 132.7MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:10:24,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.93ms. Allocated memory is still 176.2MB. Free memory was 106.8MB in the beginning and 92.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:10:24,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.01ms. Allocated memory is still 176.2MB. Free memory was 92.1MB in the beginning and 146.1MB in the end (delta: -53.9MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-24 11:10:24,221 INFO L158 Benchmark]: Boogie Preprocessor took 69.36ms. Allocated memory is still 176.2MB. Free memory was 146.1MB in the beginning and 140.5MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:10:24,221 INFO L158 Benchmark]: RCFGBuilder took 408.40ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 118.2MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 11:10:24,221 INFO L158 Benchmark]: TraceAbstraction took 80438.88ms. Allocated memory was 176.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 117.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-24 11:10:24,222 INFO L158 Benchmark]: Witness Printer took 103.24ms. Allocated memory is still 2.1GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:10:24,223 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory was 132.9MB in the beginning and 132.7MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.93ms. Allocated memory is still 176.2MB. Free memory was 106.8MB in the beginning and 92.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.01ms. Allocated memory is still 176.2MB. Free memory was 92.1MB in the beginning and 146.1MB in the end (delta: -53.9MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.36ms. Allocated memory is still 176.2MB. Free memory was 146.1MB in the beginning and 140.5MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 408.40ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 118.2MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 80438.88ms. Allocated memory was 176.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 117.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 103.24ms. Allocated memory is still 2.1GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.6s, OverallIterations: 9, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 344 mSDsluCounter, 2125 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1579 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1309 IncrementalHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 546 mSDtfsCounter, 1309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 478 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=5, InterpolantAutomatonStates: 88, 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, 9 MinimizatonAttempts, 102 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 56.8s InterpolantComputationTime, 1030 NumberOfCodeBlocks, 1030 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1021 ConstructedInterpolants, 0 QuantifiedInterpolants, 6130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 6156/6156 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: 106]: Loop Invariant Derived loop invariant: ((((((((((var_1_3 < var_1_5) || (128 == var_1_9)) || ((var_1_4 / var_1_11) < (((((__int128) ((unsigned long long) var_1_15 * var_1_15) + ((long long) var_1_5 * var_1_15)) % 4294967296) + ((((var_1_4 / var_1_11) >= 0) ? ((var_1_4 / var_1_11) / 4294967296) : (((var_1_4 / var_1_11) / 4294967296) - 1)) * 4294967296)) + 1))) && ((var_1_2 == 0) || (((((var_1_1 == 50) || (49 < var_1_5)) || (50 < ((short) var_1_4 + var_1_3))) && (((var_1_1 == (((short) var_1_4 + var_1_3) % 256)) || (((short) var_1_4 + var_1_3) < (var_1_5 + 1))) || (((short) var_1_4 + var_1_3) < 51))) && ((var_1_1 == var_1_5) || (((var_1_5 < 50) || (50 < ((short) var_1_4 + var_1_3))) && ((((short) var_1_4 + var_1_3) < 51) || (var_1_5 < ((short) var_1_4 + var_1_3)))))))) && (var_1_14 == var_1_13)) && (var_1_8 == var_1_5)) && (var_1_15 == var_1_3)) && (((128 == var_1_9) || (var_1_10 < ((short) var_1_4 + var_1_5))) || ((var_1_4 / var_1_11) < (((((__int128) ((unsigned long long) var_1_15 * var_1_15) + ((long long) var_1_5 * var_1_15)) % 4294967296) + ((((var_1_4 / var_1_11) >= 0) ? ((var_1_4 / var_1_11) / 4294967296) : (((var_1_4 / var_1_11) / 4294967296) - 1)) * 4294967296)) + 1)))) || (var_1_2 == 0)) || ((var_1_7 < 1) && ((var_1_2 == 0) || (((((var_1_1 == 50) || (49 < var_1_5)) || (50 < ((short) var_1_4 + var_1_3))) && (((var_1_1 == (((short) var_1_4 + var_1_3) % 256)) || (((short) var_1_4 + var_1_3) < (var_1_5 + 1))) || (((short) var_1_4 + var_1_3) < 51))) && ((var_1_1 == var_1_5) || (((var_1_5 < 50) || (50 < ((short) var_1_4 + var_1_3))) && ((((short) var_1_4 + var_1_3) < 51) || (var_1_5 < ((short) var_1_4 + var_1_3))))))))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) RESULT: Ultimate proved your program to be correct! [2024-10-24 11:10:24,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE