./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_loopvsstraightlinecode_100-1loop_file-61.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 dbe45afa86e2c578c058b9245371f9cd8d3f7cde9f82c7f7a0cfc33405a8ed29 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:01:25,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:01:25,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:01:25,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:01:25,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:01:25,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:01:25,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:01:25,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:01:25,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:01:25,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:01:25,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:01:25,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:01:25,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:01:25,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:01:25,980 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:01:25,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:01:25,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:01:25,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:01:25,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:01:25,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:01:25,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:01:25,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:01:25,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:01:25,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:01:25,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:01:25,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:01:25,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:01:25,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:01:25,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:01:25,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:01:25,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:01:25,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:01:25,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:01:25,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:01:25,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:01:25,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:01:25,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:01:25,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:01:25,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:01:25,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:01:25,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:01:25,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:01:25,992 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 -> dbe45afa86e2c578c058b9245371f9cd8d3f7cde9f82c7f7a0cfc33405a8ed29 [2024-11-12 05:01:26,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:01:26,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:01:26,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:01:26,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:01:26,330 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:01:26,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i [2024-11-12 05:01:27,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:01:28,081 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:01:28,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i [2024-11-12 05:01:28,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e736d85/e9f0cb379855428591670bbf580c66d7/FLAG094308428 [2024-11-12 05:01:28,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e736d85/e9f0cb379855428591670bbf580c66d7 [2024-11-12 05:01:28,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:01:28,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:01:28,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:01:28,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:01:28,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:01:28,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:28,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea8b6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28, skipping insertion in model container [2024-11-12 05:01:28,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:28,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:01:28,701 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_loopvsstraightlinecode_100-1loop_file-61.i[916,929] [2024-11-12 05:01:28,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:01:28,829 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:01:28,840 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_loopvsstraightlinecode_100-1loop_file-61.i[916,929] [2024-11-12 05:01:28,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:01:28,910 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:01:28,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28 WrapperNode [2024-11-12 05:01:28,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:01:28,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:01:28,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:01:28,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:01:28,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:28,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:28,992 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-11-12 05:01:28,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:01:28,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:01:28,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:01:28,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:01:29,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:29,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:29,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:29,058 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-12 05:01:29,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:29,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:29,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:29,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:29,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:29,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:29,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:01:29,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:01:29,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:01:29,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:01:29,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (1/1) ... [2024-11-12 05:01:29,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:01:29,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:01:29,162 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-12 05:01:29,165 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-12 05:01:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:01:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:01:29,218 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:01:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:01:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:01:29,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:01:29,380 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:01:29,383 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:01:30,047 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-12 05:01:30,047 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:01:30,072 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:01:30,072 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:01:30,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:30 BoogieIcfgContainer [2024-11-12 05:01:30,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:01:30,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:01:30,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:01:30,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:01:30,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:01:28" (1/3) ... [2024-11-12 05:01:30,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f853bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:01:30, skipping insertion in model container [2024-11-12 05:01:30,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:28" (2/3) ... [2024-11-12 05:01:30,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f853bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:01:30, skipping insertion in model container [2024-11-12 05:01:30,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:30" (3/3) ... [2024-11-12 05:01:30,084 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-61.i [2024-11-12 05:01:30,103 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:01:30,104 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:01:30,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:01:30,200 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;@10c051bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:01:30,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:01:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 05:01:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 05:01:30,223 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:30,224 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:30,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:30,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1895177401, now seen corresponding path program 1 times [2024-11-12 05:01:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:30,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581157355] [2024-11-12 05:01:30,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:30,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:01:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:01:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:01:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:01:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:01:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:01:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:01:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:01:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:01:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 05:01:30,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:30,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581157355] [2024-11-12 05:01:30,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581157355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:30,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:30,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:01:30,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057056574] [2024-11-12 05:01:30,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:30,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:01:30,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:01:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:01:30,940 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 05:01:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:30,989 INFO L93 Difference]: Finished difference Result 211 states and 357 transitions. [2024-11-12 05:01:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:01:30,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2024-11-12 05:01:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:31,004 INFO L225 Difference]: With dead ends: 211 [2024-11-12 05:01:31,005 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 05:01:31,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-12 05:01:31,022 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:31,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:01:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 05:01:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-12 05:01:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.44) internal successors, (108), 75 states have internal predecessors, (108), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 05:01:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 160 transitions. [2024-11-12 05:01:31,094 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 160 transitions. Word has length 175 [2024-11-12 05:01:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:31,095 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 160 transitions. [2024-11-12 05:01:31,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 05:01:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 160 transitions. [2024-11-12 05:01:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 05:01:31,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:31,102 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:31,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:01:31,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:31,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash -852836495, now seen corresponding path program 1 times [2024-11-12 05:01:31,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:31,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035391617] [2024-11-12 05:01:31,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:31,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:01:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:01:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:01:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:01:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:01:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:01:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:01:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:01:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:01:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 05:01:38,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:38,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035391617] [2024-11-12 05:01:38,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035391617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:38,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:38,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 05:01:38,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937283597] [2024-11-12 05:01:38,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:38,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 05:01:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 05:01:38,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:01:38,427 INFO L87 Difference]: Start difference. First operand 103 states and 160 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:40,681 INFO L93 Difference]: Finished difference Result 470 states and 729 transitions. [2024-11-12 05:01:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 05:01:40,682 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 05:01:40,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:40,689 INFO L225 Difference]: With dead ends: 470 [2024-11-12 05:01:40,689 INFO L226 Difference]: Without dead ends: 370 [2024-11-12 05:01:40,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-12 05:01:40,693 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 589 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:40,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 688 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 05:01:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-12 05:01:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 169. [2024-11-12 05:01:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 05:01:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 266 transitions. [2024-11-12 05:01:40,743 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 266 transitions. Word has length 175 [2024-11-12 05:01:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:40,743 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 266 transitions. [2024-11-12 05:01:40,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 266 transitions. [2024-11-12 05:01:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 05:01:40,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:40,749 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:40,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:01:40,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:40,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:40,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1873904849, now seen corresponding path program 1 times [2024-11-12 05:01:40,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:40,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134813094] [2024-11-12 05:01:40,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:40,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:01:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:01:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:01:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:01:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:01:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:01:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:01:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:01:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:01:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 05:01:41,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:41,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134813094] [2024-11-12 05:01:41,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134813094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:41,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:41,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:01:41,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933962489] [2024-11-12 05:01:41,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:41,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:01:41,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:41,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:01:41,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:01:41,086 INFO L87 Difference]: Start difference. First operand 169 states and 266 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:41,164 INFO L93 Difference]: Finished difference Result 277 states and 429 transitions. [2024-11-12 05:01:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:01:41,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 05:01:41,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:41,168 INFO L225 Difference]: With dead ends: 277 [2024-11-12 05:01:41,168 INFO L226 Difference]: Without dead ends: 177 [2024-11-12 05:01:41,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:01:41,169 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 95 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:41,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 181 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:01:41,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-12 05:01:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-12 05:01:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 05:01:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 270 transitions. [2024-11-12 05:01:41,201 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 270 transitions. Word has length 175 [2024-11-12 05:01:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:41,204 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 270 transitions. [2024-11-12 05:01:41,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 270 transitions. [2024-11-12 05:01:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 05:01:41,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:41,207 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:41,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:01:41,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:41,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash 342217516, now seen corresponding path program 1 times [2024-11-12 05:01:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044839631] [2024-11-12 05:01:41,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:01:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:01:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:01:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:01:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:01:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:01:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:01:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:01:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:01:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 05:01:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044839631] [2024-11-12 05:01:43,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044839631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:43,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:43,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 05:01:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013588532] [2024-11-12 05:01:43,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:43,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:01:43,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:43,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:01:43,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:01:43,835 INFO L87 Difference]: Start difference. First operand 177 states and 270 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:45,035 INFO L93 Difference]: Finished difference Result 425 states and 649 transitions. [2024-11-12 05:01:45,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 05:01:45,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-12 05:01:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:45,041 INFO L225 Difference]: With dead ends: 425 [2024-11-12 05:01:45,041 INFO L226 Difference]: Without dead ends: 321 [2024-11-12 05:01:45,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:01:45,043 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 322 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:45,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 521 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 05:01:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-12 05:01:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 191. [2024-11-12 05:01:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 134 states have (on average 1.4104477611940298) internal successors, (189), 134 states have internal predecessors, (189), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 05:01:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 293 transitions. [2024-11-12 05:01:45,067 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 293 transitions. Word has length 176 [2024-11-12 05:01:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:45,068 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 293 transitions. [2024-11-12 05:01:45,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 293 transitions. [2024-11-12 05:01:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 05:01:45,072 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:45,072 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:45,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:01:45,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:45,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash -244588498, now seen corresponding path program 1 times [2024-11-12 05:01:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:45,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752030444] [2024-11-12 05:01:45,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:45,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:01:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:01:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:01:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:01:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:01:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:01:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:01:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:01:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:01:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 05:01:46,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752030444] [2024-11-12 05:01:46,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752030444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:46,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:46,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 05:01:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286112612] [2024-11-12 05:01:46,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:46,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 05:01:46,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:46,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 05:01:46,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:01:46,809 INFO L87 Difference]: Start difference. First operand 191 states and 293 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:48,478 INFO L93 Difference]: Finished difference Result 480 states and 725 transitions. [2024-11-12 05:01:48,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 05:01:48,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-12 05:01:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:48,484 INFO L225 Difference]: With dead ends: 480 [2024-11-12 05:01:48,485 INFO L226 Difference]: Without dead ends: 376 [2024-11-12 05:01:48,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2024-11-12 05:01:48,487 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 639 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:48,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 763 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 05:01:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-12 05:01:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 221. [2024-11-12 05:01:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 164 states have (on average 1.451219512195122) internal successors, (238), 164 states have internal predecessors, (238), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 05:01:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 342 transitions. [2024-11-12 05:01:48,519 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 342 transitions. Word has length 176 [2024-11-12 05:01:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:48,520 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 342 transitions. [2024-11-12 05:01:48,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 342 transitions. [2024-11-12 05:01:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-12 05:01:48,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:48,523 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:48,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 05:01:48,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:48,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:48,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1762387447, now seen corresponding path program 1 times [2024-11-12 05:01:48,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:48,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170954697] [2024-11-12 05:01:48,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:48,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:01:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:01:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:01:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:01:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:01:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:01:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:01:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:01:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:01:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 05:01:48,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:48,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170954697] [2024-11-12 05:01:48,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170954697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:48,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:48,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 05:01:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277401068] [2024-11-12 05:01:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:48,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 05:01:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 05:01:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:01:48,922 INFO L87 Difference]: Start difference. First operand 221 states and 342 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:49,097 INFO L93 Difference]: Finished difference Result 355 states and 550 transitions. [2024-11-12 05:01:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:01:49,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2024-11-12 05:01:49,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:49,101 INFO L225 Difference]: With dead ends: 355 [2024-11-12 05:01:49,101 INFO L226 Difference]: Without dead ends: 217 [2024-11-12 05:01:49,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:01:49,104 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 133 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:49,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 396 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:01:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-12 05:01:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-12 05:01:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 160 states have (on average 1.43125) internal successors, (229), 160 states have internal predecessors, (229), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 05:01:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 333 transitions. [2024-11-12 05:01:49,124 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 333 transitions. Word has length 178 [2024-11-12 05:01:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:49,125 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 333 transitions. [2024-11-12 05:01:49,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 333 transitions. [2024-11-12 05:01:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-12 05:01:49,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:49,128 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:49,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 05:01:49,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:49,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash 192520944, now seen corresponding path program 1 times [2024-11-12 05:01:49,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:49,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289671939] [2024-11-12 05:01:49,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:49,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:01:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:01:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:01:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:01:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:01:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:01:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:01:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:01:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:01:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 05:01:49,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:49,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289671939] [2024-11-12 05:01:49,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289671939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:01:49,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78255489] [2024-11-12 05:01:49,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:49,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:01:49,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:01:49,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:01:49,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:01:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:49,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:01:49,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:01:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 05:01:50,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:01:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 05:01:50,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78255489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:01:50,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:01:50,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-12 05:01:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618934073] [2024-11-12 05:01:50,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:01:50,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:01:50,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:50,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:01:50,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:01:50,414 INFO L87 Difference]: Start difference. First operand 217 states and 333 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-12 05:01:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:50,634 INFO L93 Difference]: Finished difference Result 345 states and 515 transitions. [2024-11-12 05:01:50,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 05:01:50,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) Word has length 180 [2024-11-12 05:01:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:50,637 INFO L225 Difference]: With dead ends: 345 [2024-11-12 05:01:50,637 INFO L226 Difference]: Without dead ends: 222 [2024-11-12 05:01:50,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:01:50,639 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 135 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:50,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 285 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:01:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-12 05:01:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 214. [2024-11-12 05:01:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 155 states have (on average 1.3806451612903226) internal successors, (214), 155 states have internal predecessors, (214), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 05:01:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 318 transitions. [2024-11-12 05:01:50,668 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 318 transitions. Word has length 180 [2024-11-12 05:01:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:50,669 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 318 transitions. [2024-11-12 05:01:50,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-12 05:01:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 318 transitions. [2024-11-12 05:01:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-12 05:01:50,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:50,671 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:50,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 05:01:50,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:01:50,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:50,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1208730944, now seen corresponding path program 1 times [2024-11-12 05:01:50,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:50,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866513753] [2024-11-12 05:01:50,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:01:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:01:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:01:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:01:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:01:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:01:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:01:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:01:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:01:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 05:01:51,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:51,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866513753] [2024-11-12 05:01:51,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866513753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:51,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:51,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 05:01:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074532434] [2024-11-12 05:01:51,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:51,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 05:01:51,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:51,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 05:01:51,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:01:51,199 INFO L87 Difference]: Start difference. First operand 214 states and 318 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:51,409 INFO L93 Difference]: Finished difference Result 492 states and 719 transitions. [2024-11-12 05:01:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:01:51,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-11-12 05:01:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:51,412 INFO L225 Difference]: With dead ends: 492 [2024-11-12 05:01:51,412 INFO L226 Difference]: Without dead ends: 330 [2024-11-12 05:01:51,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:01:51,413 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 172 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:51,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 710 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:01:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-12 05:01:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 262. [2024-11-12 05:01:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 203 states have (on average 1.4039408866995073) internal successors, (285), 203 states have internal predecessors, (285), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 05:01:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 389 transitions. [2024-11-12 05:01:51,435 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 389 transitions. Word has length 180 [2024-11-12 05:01:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:51,436 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 389 transitions. [2024-11-12 05:01:51,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 389 transitions. [2024-11-12 05:01:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-12 05:01:51,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:51,438 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:51,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 05:01:51,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:51,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash -896951336, now seen corresponding path program 1 times [2024-11-12 05:01:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:51,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822990028] [2024-11-12 05:01:51,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:01:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:01:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:01:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:01:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:01:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:01:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:01:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:01:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:01:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 05:01:51,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:51,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822990028] [2024-11-12 05:01:51,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822990028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:51,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:51,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:01:51,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287441821] [2024-11-12 05:01:51,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:51,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:01:51,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:51,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:01:51,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:01:51,578 INFO L87 Difference]: Start difference. First operand 262 states and 389 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:51,649 INFO L93 Difference]: Finished difference Result 465 states and 687 transitions. [2024-11-12 05:01:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:01:51,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-11-12 05:01:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:51,652 INFO L225 Difference]: With dead ends: 465 [2024-11-12 05:01:51,652 INFO L226 Difference]: Without dead ends: 332 [2024-11-12 05:01:51,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:01:51,654 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 48 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:51,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 292 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:01:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-12 05:01:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 310. [2024-11-12 05:01:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 251 states have (on average 1.4342629482071714) internal successors, (360), 251 states have internal predecessors, (360), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 05:01:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 464 transitions. [2024-11-12 05:01:51,679 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 464 transitions. Word has length 180 [2024-11-12 05:01:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:51,681 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 464 transitions. [2024-11-12 05:01:51,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 464 transitions. [2024-11-12 05:01:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-12 05:01:51,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:51,684 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:51,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 05:01:51,685 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:51,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:51,685 INFO L85 PathProgramCache]: Analyzing trace with hash -357697633, now seen corresponding path program 1 times [2024-11-12 05:01:51,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:51,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960707961] [2024-11-12 05:01:51,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:51,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:01:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:01:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:01:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:01:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:01:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:01:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:01:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:01:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:01:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 05:01:51,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:51,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960707961] [2024-11-12 05:01:51,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960707961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:51,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:51,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:01:51,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327605446] [2024-11-12 05:01:51,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:51,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:01:51,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:51,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:01:51,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:01:51,969 INFO L87 Difference]: Start difference. First operand 310 states and 464 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:52,159 INFO L93 Difference]: Finished difference Result 666 states and 1000 transitions. [2024-11-12 05:01:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:01:52,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-11-12 05:01:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:52,163 INFO L225 Difference]: With dead ends: 666 [2024-11-12 05:01:52,165 INFO L226 Difference]: Without dead ends: 436 [2024-11-12 05:01:52,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:01:52,167 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 257 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:52,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 515 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:01:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-12 05:01:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 310. [2024-11-12 05:01:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 251 states have (on average 1.4302788844621515) internal successors, (359), 251 states have internal predecessors, (359), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 05:01:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 463 transitions. [2024-11-12 05:01:52,193 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 463 transitions. Word has length 180 [2024-11-12 05:01:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:52,193 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 463 transitions. [2024-11-12 05:01:52,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 05:01:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 463 transitions. [2024-11-12 05:01:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-12 05:01:52,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:52,197 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:52,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 05:01:52,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash -867170723, now seen corresponding path program 1 times [2024-11-12 05:01:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43975410] [2024-11-12 05:01:52,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:01:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:01:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:01:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:01:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:01:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:01:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 05:01:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:01:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:01:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:01:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 05:01:53,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:53,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43975410] [2024-11-12 05:01:53,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43975410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:53,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:53,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 05:01:53,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186185693] [2024-11-12 05:01:53,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:53,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 05:01:53,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:53,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 05:01:53,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-12 05:01:53,280 INFO L87 Difference]: Start difference. First operand 310 states and 463 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 05:01:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:54,786 INFO L93 Difference]: Finished difference Result 621 states and 904 transitions. [2024-11-12 05:01:54,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 05:01:54,787 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 180 [2024-11-12 05:01:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:54,790 INFO L225 Difference]: With dead ends: 621 [2024-11-12 05:01:54,790 INFO L226 Difference]: Without dead ends: 430 [2024-11-12 05:01:54,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-11-12 05:01:54,791 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 336 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:54,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1073 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 05:01:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-12 05:01:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 310. [2024-11-12 05:01:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 251 states have (on average 1.4262948207171315) internal successors, (358), 251 states have internal predecessors, (358), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 05:01:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 462 transitions. [2024-11-12 05:01:54,828 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 462 transitions. Word has length 180 [2024-11-12 05:01:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:54,829 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 462 transitions. [2024-11-12 05:01:54,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 05:01:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 462 transitions. [2024-11-12 05:01:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-12 05:01:54,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:54,832 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:01:54,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 05:01:54,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:54,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:54,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1203464344, now seen corresponding path program 1 times [2024-11-12 05:01:54,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:54,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417749692] [2024-11-12 05:01:54,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat