./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-10.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 1825bc9a0285763e27450cd61a02fb9d706f8ecf9bea3df3659a486d8c0885be --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:28:17,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:28:17,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:28:17,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:28:17,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:28:17,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:28:17,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:28:17,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:28:17,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:28:17,464 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:28:17,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:28:17,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:28:17,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:28:17,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:28:17,465 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:28:17,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:28:17,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:28:17,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:28:17,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:28:17,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:28:17,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:28:17,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:28:17,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:28:17,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:28:17,471 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:28:17,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:28:17,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:28:17,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:28:17,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:28:17,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:28:17,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:28:17,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:28:17,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:28:17,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:28:17,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:28:17,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:28:17,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:28:17,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:28:17,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:28:17,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:28:17,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:28:17,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:28:17,477 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 -> 1825bc9a0285763e27450cd61a02fb9d706f8ecf9bea3df3659a486d8c0885be [2024-11-10 03:28:17,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:28:17,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:28:17,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:28:17,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:28:17,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:28:17,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-10.i [2024-11-10 03:28:19,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:28:19,428 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:28:19,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-10.i [2024-11-10 03:28:19,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45aa3f30b/1056330b68f0445eba920b641cdf953e/FLAG5c37dc7dd [2024-11-10 03:28:19,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45aa3f30b/1056330b68f0445eba920b641cdf953e [2024-11-10 03:28:19,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:28:19,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:28:19,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:28:19,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:28:19,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:28:19,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:19" (1/1) ... [2024-11-10 03:28:19,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b65dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:19, skipping insertion in model container [2024-11-10 03:28:19,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:19" (1/1) ... [2024-11-10 03:28:19,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:28:19,988 WARN L250 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_codestructure_steplocals_file-10.i[917,930] [2024-11-10 03:28:20,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:28:20,076 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:28:20,088 WARN L250 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_codestructure_steplocals_file-10.i[917,930] [2024-11-10 03:28:20,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:28:20,147 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:28:20,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20 WrapperNode [2024-11-10 03:28:20,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:28:20,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:28:20,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:28:20,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:28:20,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,241 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-10 03:28:20,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:28:20,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:28:20,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:28:20,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:28:20,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,282 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-11-10 03:28:20,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:28:20,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:28:20,307 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:28:20,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:28:20,308 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (1/1) ... [2024-11-10 03:28:20,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:28:20,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:28:20,351 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-11-10 03:28:20,357 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-11-10 03:28:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:28:20,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:28:20,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:28:20,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:28:20,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:28:20,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:28:20,498 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:28:20,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:28:20,867 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~bitwise19#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1; [2024-11-10 03:28:20,907 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-10 03:28:20,908 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:28:20,936 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:28:20,936 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:28:20,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:28:20 BoogieIcfgContainer [2024-11-10 03:28:20,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:28:20,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:28:20,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:28:20,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:28:20,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:28:19" (1/3) ... [2024-11-10 03:28:20,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54435435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:20, skipping insertion in model container [2024-11-10 03:28:20,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:20" (2/3) ... [2024-11-10 03:28:20,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54435435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:20, skipping insertion in model container [2024-11-10 03:28:20,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:28:20" (3/3) ... [2024-11-10 03:28:20,943 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-10.i [2024-11-10 03:28:20,955 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:28:20,955 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:28:21,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:28:21,039 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;@4093dd56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:28:21,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:28:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 03:28:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 03:28:21,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:28:21,073 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:28:21,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:28:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:28:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1901256122, now seen corresponding path program 1 times [2024-11-10 03:28:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:28:21,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324083355] [2024-11-10 03:28:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:28:21,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:28:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:28:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:28:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:28:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:28:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:28:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:28:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:28:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:28:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:28:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:28:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:28:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:28:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:28:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:28:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:28:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:28:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:28:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:28:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:28:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:28:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:28:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:28:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:28:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:28:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:28:21,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:28:21,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324083355] [2024-11-10 03:28:21,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324083355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:28:21,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:28:21,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:28:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530046706] [2024-11-10 03:28:21,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:28:21,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:28:21,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:28:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:28:21,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:28:21,589 INFO L87 Difference]: Start difference. First operand has 85 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 03:28:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:28:21,628 INFO L93 Difference]: Finished difference Result 162 states and 271 transitions. [2024-11-10 03:28:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:28:21,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2024-11-10 03:28:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:28:21,642 INFO L225 Difference]: With dead ends: 162 [2024-11-10 03:28:21,645 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 03:28:21,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-11-10 03:28:21,654 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:28:21,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:28:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 03:28:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-10 03:28:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 03:28:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 119 transitions. [2024-11-10 03:28:21,706 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 119 transitions. Word has length 156 [2024-11-10 03:28:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:28:21,707 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 119 transitions. [2024-11-10 03:28:21,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 03:28:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 119 transitions. [2024-11-10 03:28:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 03:28:21,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:28:21,712 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:28:21,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:28:21,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:28:21,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:28:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash 934738502, now seen corresponding path program 1 times [2024-11-10 03:28:21,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:28:21,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051958995] [2024-11-10 03:28:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:28:21,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:28:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:28:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:28:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:28:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:28:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:28:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:28:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:28:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:28:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:28:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:28:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:28:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:28:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:28:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:28:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:28:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:28:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:28:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:28:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:28:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:28:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:28:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:28:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:28:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:28:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:28:39,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:28:39,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051958995] [2024-11-10 03:28:39,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051958995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:28:39,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:28:39,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 03:28:39,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099811535] [2024-11-10 03:28:39,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:28:39,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 03:28:39,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:28:39,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 03:28:39,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-10 03:28:39,975 INFO L87 Difference]: Start difference. First operand 80 states and 119 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 03:28:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:28:44,073 INFO L93 Difference]: Finished difference Result 255 states and 370 transitions. [2024-11-10 03:28:44,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:28:44,074 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2024-11-10 03:28:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:28:44,077 INFO L225 Difference]: With dead ends: 255 [2024-11-10 03:28:44,077 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 03:28:44,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-10 03:28:44,079 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 365 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:28:44,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 532 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 03:28:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 03:28:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 110. [2024-11-10 03:28:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 03:28:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 164 transitions. [2024-11-10 03:28:44,099 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 164 transitions. Word has length 156 [2024-11-10 03:28:44,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:28:44,104 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 164 transitions. [2024-11-10 03:28:44,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 03:28:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 164 transitions. [2024-11-10 03:28:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 03:28:44,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:28:44,110 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:28:44,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:28:44,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:28:44,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:28:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1852676985, now seen corresponding path program 1 times [2024-11-10 03:28:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:28:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782442889] [2024-11-10 03:28:44,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:28:44,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:28:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:28:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:28:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:28:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:28:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:28:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:28:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:28:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:28:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:28:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:28:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:28:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:28:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:28:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:28:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:28:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:28:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:28:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:28:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:28:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:28:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:28:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:28:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:28:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:28:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:28:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:28:49,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:28:49,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782442889] [2024-11-10 03:28:49,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782442889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:28:49,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:28:49,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 03:28:49,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854703229] [2024-11-10 03:28:49,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:28:49,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:28:49,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:28:49,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:28:49,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:28:49,234 INFO L87 Difference]: Start difference. First operand 110 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:28:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:28:51,008 INFO L93 Difference]: Finished difference Result 285 states and 411 transitions. [2024-11-10 03:28:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:28:51,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2024-11-10 03:28:51,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:28:51,011 INFO L225 Difference]: With dead ends: 285 [2024-11-10 03:28:51,011 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 03:28:51,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:28:51,014 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 148 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:28:51,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 623 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 03:28:51,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 03:28:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 110. [2024-11-10 03:28:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 03:28:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 164 transitions. [2024-11-10 03:28:51,034 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 164 transitions. Word has length 156 [2024-11-10 03:28:51,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:28:51,035 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 164 transitions. [2024-11-10 03:28:51,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:28:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 164 transitions. [2024-11-10 03:28:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 03:28:51,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:28:51,041 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:28:51,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:28:51,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:28:51,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:28:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash -390452526, now seen corresponding path program 1 times [2024-11-10 03:28:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:28:51,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692618031] [2024-11-10 03:28:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:28:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:28:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:29:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:29:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:29:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:29:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:29:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:29:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:29:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:29:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:29:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:29:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:29:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:29:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:29:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:29:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:29:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:29:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:29:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:29:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:29:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:29:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:29:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:29:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:29:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:29:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:29:05,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:29:05,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692618031] [2024-11-10 03:29:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692618031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:29:05,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:29:05,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 03:29:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917191526] [2024-11-10 03:29:05,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:29:05,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 03:29:05,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:29:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 03:29:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:29:05,053 INFO L87 Difference]: Start difference. First operand 110 states and 164 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:29:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:29:09,388 INFO L93 Difference]: Finished difference Result 300 states and 434 transitions. [2024-11-10 03:29:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:29:09,390 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-10 03:29:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:29:09,392 INFO L225 Difference]: With dead ends: 300 [2024-11-10 03:29:09,392 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 03:29:09,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:29:09,398 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 140 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:29:09,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 871 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 03:29:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 03:29:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 111. [2024-11-10 03:29:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.388235294117647) internal successors, (118), 85 states have internal predecessors, (118), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 03:29:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 166 transitions. [2024-11-10 03:29:09,420 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 166 transitions. Word has length 157 [2024-11-10 03:29:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:29:09,420 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 166 transitions. [2024-11-10 03:29:09,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:29:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 166 transitions. [2024-11-10 03:29:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 03:29:09,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:29:09,423 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:29:09,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:29:09,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:29:09,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:29:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1117099283, now seen corresponding path program 1 times [2024-11-10 03:29:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:29:09,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920417317] [2024-11-10 03:29:09,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:29:09,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:29:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:29:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:29:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:29:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:29:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:29:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:29:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:29:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:29:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:29:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:29:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:29:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:29:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:29:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:29:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:29:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:29:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:29:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:29:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:29:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:29:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:29:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:29:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:29:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:29:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:29:16,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:29:16,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920417317] [2024-11-10 03:29:16,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920417317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:29:16,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:29:16,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 03:29:16,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105736910] [2024-11-10 03:29:16,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:29:16,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:29:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:29:16,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:29:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:29:16,755 INFO L87 Difference]: Start difference. First operand 111 states and 166 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:29:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:29:19,467 INFO L93 Difference]: Finished difference Result 301 states and 435 transitions. [2024-11-10 03:29:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:29:19,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-10 03:29:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:29:19,470 INFO L225 Difference]: With dead ends: 301 [2024-11-10 03:29:19,470 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 03:29:19,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:29:19,471 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 116 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:29:19,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 816 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 03:29:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 03:29:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 110. [2024-11-10 03:29:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 03:29:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 164 transitions. [2024-11-10 03:29:19,484 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 164 transitions. Word has length 157 [2024-11-10 03:29:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:29:19,484 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 164 transitions. [2024-11-10 03:29:19,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:29:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 164 transitions. [2024-11-10 03:29:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 03:29:19,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:29:19,486 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:29:19,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:29:19,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:29:19,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:29:19,487 INFO L85 PathProgramCache]: Analyzing trace with hash -900986703, now seen corresponding path program 1 times [2024-11-10 03:29:19,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:29:19,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202463709] [2024-11-10 03:29:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:29:19,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:29:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:29:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:29:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:29:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:29:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:29:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:29:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:29:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:29:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:29:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:29:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:29:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:29:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:29:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:29:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:29:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:29:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:29:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:29:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:29:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:29:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:29:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:29:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:29:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:29:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:29:28,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:29:28,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202463709] [2024-11-10 03:29:28,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202463709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:29:28,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:29:28,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 03:29:28,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082276248] [2024-11-10 03:29:28,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:29:28,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 03:29:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:29:28,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 03:29:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-10 03:29:28,178 INFO L87 Difference]: Start difference. First operand 110 states and 164 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 03:29:32,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:29:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:29:37,361 INFO L93 Difference]: Finished difference Result 285 states and 411 transitions. [2024-11-10 03:29:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 03:29:37,364 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-11-10 03:29:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:29:37,366 INFO L225 Difference]: With dead ends: 285 [2024-11-10 03:29:37,366 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 03:29:37,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-10 03:29:37,367 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 341 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:29:37,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 612 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1074 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2024-11-10 03:29:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 03:29:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 122. [2024-11-10 03:29:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 03:29:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2024-11-10 03:29:37,383 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 157 [2024-11-10 03:29:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:29:37,384 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2024-11-10 03:29:37,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 03:29:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2024-11-10 03:29:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-10 03:29:37,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:29:37,385 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:29:37,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:29:37,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:29:37,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:29:37,386 INFO L85 PathProgramCache]: Analyzing trace with hash 606565106, now seen corresponding path program 1 times [2024-11-10 03:29:37,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:29:37,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354797201] [2024-11-10 03:29:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:29:37,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:29:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat