./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_loopvsstraightlinecode_25-1loop_file-6.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 6cf2561dad1c8b51aa2ba3c0e99715767de125185ed9dd0f295e3fa44621c8c9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:37:18,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:37:18,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:37:18,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:37:18,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:37:18,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:37:18,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:37:18,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:37:18,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:37:18,914 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:37:18,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:37:18,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:37:18,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:37:18,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:37:18,918 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:37:18,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:37:18,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:37:18,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:37:18,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:37:18,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:37:18,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:37:18,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:37:18,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:37:18,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:37:18,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:37:18,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:37:18,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:37:18,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:37:18,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:37:18,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:37:18,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:37:18,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:37:18,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:37:18,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:37:18,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:37:18,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:37:18,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:37:18,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:37:18,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:37:18,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:37:18,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:37:18,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:37:18,927 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 -> 6cf2561dad1c8b51aa2ba3c0e99715767de125185ed9dd0f295e3fa44621c8c9 [2024-10-14 11:37:19,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:37:19,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:37:19,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:37:19,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:37:19,160 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:37:19,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-6.i [2024-10-14 11:37:20,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:37:20,718 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:37:20,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-6.i [2024-10-14 11:37:20,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f07c35e/1187d094dfe8497bbb4eb49957ae4524/FLAG5b1d11668 [2024-10-14 11:37:20,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f07c35e/1187d094dfe8497bbb4eb49957ae4524 [2024-10-14 11:37:20,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:37:20,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:37:20,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:37:20,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:37:20,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:37:20,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:37:20" (1/1) ... [2024-10-14 11:37:20,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224c248a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:20, skipping insertion in model container [2024-10-14 11:37:20,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:37:20" (1/1) ... [2024-10-14 11:37:20,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:37:20,941 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-6.i[914,927] [2024-10-14 11:37:21,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:37:21,013 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:37:21,022 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-6.i[914,927] [2024-10-14 11:37:21,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:37:21,065 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:37:21,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21 WrapperNode [2024-10-14 11:37:21,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:37:21,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:37:21,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:37:21,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:37:21,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,106 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-10-14 11:37:21,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:37:21,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:37:21,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:37:21,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:37:21,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,136 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-14 11:37:21,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:37:21,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:37:21,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:37:21,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:37:21,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (1/1) ... [2024-10-14 11:37:21,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:37:21,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:37:21,182 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-14 11:37:21,185 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-14 11:37:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:37:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:37:21,221 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:37:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:37:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:37:21,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:37:21,288 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:37:21,290 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:37:21,543 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-14 11:37:21,544 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:37:21,582 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:37:21,583 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:37:21,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:37:21 BoogieIcfgContainer [2024-10-14 11:37:21,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:37:21,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:37:21,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:37:21,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:37:21,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:37:20" (1/3) ... [2024-10-14 11:37:21,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ac46bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:37:21, skipping insertion in model container [2024-10-14 11:37:21,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:21" (2/3) ... [2024-10-14 11:37:21,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ac46bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:37:21, skipping insertion in model container [2024-10-14 11:37:21,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:37:21" (3/3) ... [2024-10-14 11:37:21,592 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-6.i [2024-10-14 11:37:21,607 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:37:21,607 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:37:21,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:37:21,657 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;@26c81b8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:37:21,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:37:21,660 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-14 11:37:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 11:37:21,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:37:21,672 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-14 11:37:21,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:37:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:37:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1087530442, now seen corresponding path program 1 times [2024-10-14 11:37:21,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:37:21,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637900468] [2024-10-14 11:37:21,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:37:21,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:37:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:37:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:37:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:37:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:37:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:37:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:37:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:37:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:37:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:37:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:37:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:37:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:37:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:37:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:37:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:37:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 11:37:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:37:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:37:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:37:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:22,000 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-14 11:37:22,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:37:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637900468] [2024-10-14 11:37:22,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637900468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:37:22,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:37:22,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:37:22,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484840414] [2024-10-14 11:37:22,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:37:22,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:37:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:37:22,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:37:22,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:37:22,031 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-14 11:37:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:37:22,077 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2024-10-14 11:37:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:37:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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 114 [2024-10-14 11:37:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:37:22,085 INFO L225 Difference]: With dead ends: 95 [2024-10-14 11:37:22,085 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 11:37:22,088 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-14 11:37:22,091 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:37:22,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:37:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 11:37:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 11:37:22,148 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-14 11:37:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2024-10-14 11:37:22,152 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 114 [2024-10-14 11:37:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:37:22,156 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2024-10-14 11:37:22,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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-14 11:37:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2024-10-14 11:37:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 11:37:22,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:37:22,160 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-14 11:37:22,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:37:22,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:37:22,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:37:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1520950900, now seen corresponding path program 1 times [2024-10-14 11:37:22,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:37:22,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132292092] [2024-10-14 11:37:22,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:37:22,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:37:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:42,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:37:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:42,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:37:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:42,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:37:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:42,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:37:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:37:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:37:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:37:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:37:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:37:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:37:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:37:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:37:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:37:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:37:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:37:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 11:37:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:37:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:37:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:37:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:43,925 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-14 11:37:43,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:37:43,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132292092] [2024-10-14 11:37:43,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132292092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:37:43,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:37:43,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 11:37:43,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341638456] [2024-10-14 11:37:43,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:37:43,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 11:37:43,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:37:43,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 11:37:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:37:43,930 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 11:37:51,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 11:37:58,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 11:38:02,038 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-14 11:38:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:38:04,836 INFO L93 Difference]: Finished difference Result 136 states and 193 transitions. [2024-10-14 11:38:04,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 11:38:04,837 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 114 [2024-10-14 11:38:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:38:04,839 INFO L225 Difference]: With dead ends: 136 [2024-10-14 11:38:04,839 INFO L226 Difference]: Without dead ends: 134 [2024-10-14 11:38:04,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-10-14 11:38:04,842 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 188 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 95 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-10-14 11:38:04,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 309 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 188 Invalid, 2 Unknown, 0 Unchecked, 14.9s Time] [2024-10-14 11:38:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-14 11:38:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2024-10-14 11:38:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 11:38:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2024-10-14 11:38:04,868 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 114 [2024-10-14 11:38:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:38:04,868 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2024-10-14 11:38:04,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 11:38:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2024-10-14 11:38:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 11:38:04,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:38:04,872 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-14 11:38:04,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:38:04,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:38:04,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:38:04,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1520891318, now seen corresponding path program 1 times [2024-10-14 11:38:04,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:38:04,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690354957] [2024-10-14 11:38:04,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:38:04,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:38:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:38:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:38:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:38:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:38:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:38:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:38:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:38:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:38:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:38:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:38:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:38:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:38:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:38:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:38:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:38:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 11:38:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:38:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:38:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:38:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:16,071 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-14 11:38:16,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:38:16,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690354957] [2024-10-14 11:38:16,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690354957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:38:16,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:38:16,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:38:16,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972707478] [2024-10-14 11:38:16,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:38:16,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:38:16,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:38:16,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:38:16,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:38:16,073 INFO L87 Difference]: Start difference. First operand 94 states and 146 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-14 11:38:18,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 11:38:22,200 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-14 11:38:26,339 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-14 11:38:30,343 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-14 11:38:34,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 11:38:35,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 11:38:39,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 11:38:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:38:40,132 INFO L93 Difference]: Finished difference Result 137 states and 202 transitions. [2024-10-14 11:38:40,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:38:40,133 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-14 11:38:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:38:40,135 INFO L225 Difference]: With dead ends: 137 [2024-10-14 11:38:40,135 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 11:38:40,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:38:40,136 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 53 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:38:40,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 234 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 4 Unknown, 0 Unchecked, 22.4s Time] [2024-10-14 11:38:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 11:38:40,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2024-10-14 11:38:40,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 11:38:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2024-10-14 11:38:40,161 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 114 [2024-10-14 11:38:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:38:40,166 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2024-10-14 11:38:40,166 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-14 11:38:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2024-10-14 11:38:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 11:38:40,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:38:40,167 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-14 11:38:40,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:38:40,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:38:40,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:38:40,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1519103858, now seen corresponding path program 1 times [2024-10-14 11:38:40,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:38:40,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218716850] [2024-10-14 11:38:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:38:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:38:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:38:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:38:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:38:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:38:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 11:38:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:38:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:38:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:38:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:38:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:38:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:38:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:38:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:38:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:38:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:38:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 11:38:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:38:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:38:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:38:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:56,330 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-14 11:38:56,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:38:56,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218716850] [2024-10-14 11:38:56,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218716850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:38:56,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:38:56,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:38:56,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431232336] [2024-10-14 11:38:56,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:38:56,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:38:56,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:38:56,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:38:56,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:38:56,332 INFO L87 Difference]: Start difference. First operand 97 states and 152 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-14 11:39:00,714 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 []