./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_50-1loop_file-34.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 aa1b7e3020c9e54f93d45078f4a249ca3b737cc17c725ce83b71e2a4a5a42766 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:02:01,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:02:01,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:02:01,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:02:01,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:02:01,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:02:01,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:02:01,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:02:01,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:02:01,390 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:02:01,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:02:01,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:02:01,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:02:01,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:02:01,395 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:02:01,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:02:01,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:02:01,396 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:02:01,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:02:01,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:02:01,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:02:01,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:02:01,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:02:01,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:02:01,404 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:02:01,405 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:02:01,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:02:01,405 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:02:01,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:02:01,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:02:01,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:02:01,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:02:01,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:02:01,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:02:01,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:02:01,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:02:01,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:02:01,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:02:01,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:02:01,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:02:01,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:02:01,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:02:01,411 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 -> aa1b7e3020c9e54f93d45078f4a249ca3b737cc17c725ce83b71e2a4a5a42766 [2024-11-09 00:02:01,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:02:01,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:02:01,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:02:01,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:02:01,735 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:02:01,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-11-09 00:02:03,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:02:03,496 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:02:03,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-11-09 00:02:03,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46a7c47bb/9ae6c26a82db438fb2184ebc373cf8cc/FLAGc22fd5995 [2024-11-09 00:02:03,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46a7c47bb/9ae6c26a82db438fb2184ebc373cf8cc [2024-11-09 00:02:03,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:02:03,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:02:03,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:02:03,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:02:03,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:02:03,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:02:03" (1/1) ... [2024-11-09 00:02:03,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39bbc771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:03, skipping insertion in model container [2024-11-09 00:02:03,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:02:03" (1/1) ... [2024-11-09 00:02:03,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:02:04,155 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_50-1loop_file-34.i[915,928] [2024-11-09 00:02:04,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:02:04,221 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:02:04,233 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_50-1loop_file-34.i[915,928] [2024-11-09 00:02:04,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:02:04,279 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:02:04,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04 WrapperNode [2024-11-09 00:02:04,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:02:04,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:02:04,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:02:04,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:02:04,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,366 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-09 00:02:04,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:02:04,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:02:04,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:02:04,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:02:04,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,418 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-09 00:02:04,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:02:04,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:02:04,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:02:04,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:02:04,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (1/1) ... [2024-11-09 00:02:04,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:02:04,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:02:04,495 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-09 00:02:04,498 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-09 00:02:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:02:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:02:04,543 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:02:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:02:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:02:04,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:02:04,619 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:02:04,621 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:02:05,040 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-09 00:02:05,041 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:02:05,058 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:02:05,059 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:02:05,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:02:05 BoogieIcfgContainer [2024-11-09 00:02:05,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:02:05,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:02:05,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:02:05,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:02:05,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:02:03" (1/3) ... [2024-11-09 00:02:05,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ebfde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:02:05, skipping insertion in model container [2024-11-09 00:02:05,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:02:04" (2/3) ... [2024-11-09 00:02:05,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ebfde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:02:05, skipping insertion in model container [2024-11-09 00:02:05,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:02:05" (3/3) ... [2024-11-09 00:02:05,070 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-11-09 00:02:05,083 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:02:05,083 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:02:05,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:02:05,150 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;@1ef3ee4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:02:05,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:02:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 00:02:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:02:05,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:02:05,170 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:05,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:02:05,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:02:05,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1526986655, now seen corresponding path program 1 times [2024-11-09 00:02:05,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:02:05,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152570679] [2024-11-09 00:02:05,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:02:05,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:02:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:02:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:02:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:02:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:02:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:02:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:02:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:02:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:02:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:02:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:02:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:02:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:02:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:05,643 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:02:05,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:02:05,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152570679] [2024-11-09 00:02:05,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152570679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:02:05,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:02:05,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:02:05,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103120134] [2024-11-09 00:02:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:02:05,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:02:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:02:05,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:02:05,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:02:05,675 INFO L87 Difference]: Start difference. First operand has 72 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:02:05,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:02:05,700 INFO L93 Difference]: Finished difference Result 141 states and 228 transitions. [2024-11-09 00:02:05,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:02:05,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2024-11-09 00:02:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:02:05,710 INFO L225 Difference]: With dead ends: 141 [2024-11-09 00:02:05,710 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 00:02:05,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-09 00:02:05,717 INFO L432 NwaCegarLoop]: 106 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, 106 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-09 00:02:05,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:02:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 00:02:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-09 00:02:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 00:02:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2024-11-09 00:02:05,764 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 94 [2024-11-09 00:02:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:02:05,765 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2024-11-09 00:02:05,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:02:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2024-11-09 00:02:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:02:05,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:02:05,770 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:05,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:02:05,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:02:05,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:02:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1654717725, now seen corresponding path program 1 times [2024-11-09 00:02:05,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:02:05,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026204092] [2024-11-09 00:02:05,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:02:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:02:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:02:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:02:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:02:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:02:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:02:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:02:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:02:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:02:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:02:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:02:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:02:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:02:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:02:06,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:02:06,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026204092] [2024-11-09 00:02:06,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026204092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:02:06,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:02:06,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:02:06,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768777180] [2024-11-09 00:02:06,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:02:06,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:02:06,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:02:06,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:02:06,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:02:06,333 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:02:06,500 INFO L93 Difference]: Finished difference Result 229 states and 346 transitions. [2024-11-09 00:02:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:02:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-11-09 00:02:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:02:06,504 INFO L225 Difference]: With dead ends: 229 [2024-11-09 00:02:06,504 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 00:02:06,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:02:06,508 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 131 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:02:06,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 325 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:02:06,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 00:02:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 133. [2024-11-09 00:02:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 00:02:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 201 transitions. [2024-11-09 00:02:06,540 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 201 transitions. Word has length 94 [2024-11-09 00:02:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:02:06,541 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 201 transitions. [2024-11-09 00:02:06,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 201 transitions. [2024-11-09 00:02:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 00:02:06,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:02:06,544 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:06,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:02:06,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:02:06,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:02:06,545 INFO L85 PathProgramCache]: Analyzing trace with hash -616898898, now seen corresponding path program 1 times [2024-11-09 00:02:06,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:02:06,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162799721] [2024-11-09 00:02:06,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:02:06,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:02:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:02:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:02:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:02:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:02:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:02:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:02:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:02:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:02:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:02:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:02:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:02:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:02:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:02:06,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:02:06,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162799721] [2024-11-09 00:02:06,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162799721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:02:06,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:02:06,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:02:06,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386517122] [2024-11-09 00:02:06,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:02:06,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:02:06,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:02:06,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:02:06,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:02:06,989 INFO L87 Difference]: Start difference. First operand 133 states and 201 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:02:07,226 INFO L93 Difference]: Finished difference Result 388 states and 586 transitions. [2024-11-09 00:02:07,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:02:07,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2024-11-09 00:02:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:02:07,229 INFO L225 Difference]: With dead ends: 388 [2024-11-09 00:02:07,231 INFO L226 Difference]: Without dead ends: 258 [2024-11-09 00:02:07,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:02:07,234 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 126 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:02:07,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 333 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:02:07,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-09 00:02:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 137. [2024-11-09 00:02:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 00:02:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2024-11-09 00:02:07,266 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 95 [2024-11-09 00:02:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:02:07,267 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2024-11-09 00:02:07,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2024-11-09 00:02:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 00:02:07,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:02:07,269 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:07,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:02:07,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:02:07,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:02:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1854308373, now seen corresponding path program 1 times [2024-11-09 00:02:07,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:02:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459333957] [2024-11-09 00:02:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:02:07,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:02:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:02:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:02:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:02:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:02:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:02:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:02:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:02:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:02:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:02:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:02:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:02:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:02:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:02:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:02:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459333957] [2024-11-09 00:02:31,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459333957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:02:31,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:02:31,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 00:02:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144795222] [2024-11-09 00:02:31,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:02:31,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:02:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:02:31,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:02:31,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:02:31,995 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:02:35,474 INFO L93 Difference]: Finished difference Result 551 states and 802 transitions. [2024-11-09 00:02:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 00:02:35,474 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-09 00:02:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:02:35,477 INFO L225 Difference]: With dead ends: 551 [2024-11-09 00:02:35,477 INFO L226 Difference]: Without dead ends: 417 [2024-11-09 00:02:35,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-11-09 00:02:35,481 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 540 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 00:02:35,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 574 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 00:02:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-09 00:02:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 251. [2024-11-09 00:02:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 208 states have (on average 1.4182692307692308) internal successors, (295), 208 states have internal predecessors, (295), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 00:02:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2024-11-09 00:02:35,527 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 96 [2024-11-09 00:02:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:02:35,528 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2024-11-09 00:02:35,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2024-11-09 00:02:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 00:02:35,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:02:35,530 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:35,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:02:35,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:02:35,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:02:35,534 INFO L85 PathProgramCache]: Analyzing trace with hash -79301011, now seen corresponding path program 1 times [2024-11-09 00:02:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:02:35,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674848496] [2024-11-09 00:02:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:02:35,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:02:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:02:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:02:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:02:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:02:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:02:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:02:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:02:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:02:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:02:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:02:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:02:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:02:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:02:37,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:02:37,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674848496] [2024-11-09 00:02:37,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674848496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:02:37,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:02:37,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:02:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907057688] [2024-11-09 00:02:37,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:02:37,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:02:37,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:02:37,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:02:37,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:02:37,635 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:02:38,679 INFO L93 Difference]: Finished difference Result 618 states and 919 transitions. [2024-11-09 00:02:38,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:02:38,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-09 00:02:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:02:38,683 INFO L225 Difference]: With dead ends: 618 [2024-11-09 00:02:38,684 INFO L226 Difference]: Without dead ends: 468 [2024-11-09 00:02:38,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:02:38,686 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 406 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:02:38,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 350 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:02:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-09 00:02:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 296. [2024-11-09 00:02:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 253 states have (on average 1.4150197628458498) internal successors, (358), 253 states have internal predecessors, (358), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 00:02:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 436 transitions. [2024-11-09 00:02:38,727 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 436 transitions. Word has length 96 [2024-11-09 00:02:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:02:38,728 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 436 transitions. [2024-11-09 00:02:38,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 436 transitions. [2024-11-09 00:02:38,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 00:02:38,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:02:38,733 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:38,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:02:38,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:02:38,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:02:38,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1174250003, now seen corresponding path program 1 times [2024-11-09 00:02:38,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:02:38,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957147500] [2024-11-09 00:02:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:02:38,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:02:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:02:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:02:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:02:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:02:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:02:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:02:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:02:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:02:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:02:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:02:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:02:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:02:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:02:42,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:02:42,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957147500] [2024-11-09 00:02:42,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957147500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:02:42,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:02:42,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 00:02:42,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941843865] [2024-11-09 00:02:42,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:02:42,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 00:02:42,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:02:42,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 00:02:42,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:02:42,725 INFO L87 Difference]: Start difference. First operand 296 states and 436 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:02:44,167 INFO L93 Difference]: Finished difference Result 614 states and 896 transitions. [2024-11-09 00:02:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 00:02:44,167 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-09 00:02:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:02:44,170 INFO L225 Difference]: With dead ends: 614 [2024-11-09 00:02:44,170 INFO L226 Difference]: Without dead ends: 466 [2024-11-09 00:02:44,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-09 00:02:44,172 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 373 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 00:02:44,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 463 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 00:02:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-09 00:02:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 356. [2024-11-09 00:02:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 313 states have (on average 1.4568690095846646) internal successors, (456), 313 states have internal predecessors, (456), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 00:02:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 534 transitions. [2024-11-09 00:02:44,196 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 534 transitions. Word has length 96 [2024-11-09 00:02:44,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:02:44,197 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 534 transitions. [2024-11-09 00:02:44,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 534 transitions. [2024-11-09 00:02:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 00:02:44,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:02:44,199 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:44,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 00:02:44,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:02:44,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:02:44,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1170525852, now seen corresponding path program 1 times [2024-11-09 00:02:44,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:02:44,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249465015] [2024-11-09 00:02:44,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:02:44,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:02:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:02:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:02:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:02:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:02:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:02:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:02:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:02:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:02:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:02:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:02:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:02:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:02:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:45,437 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:02:45,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:02:45,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249465015] [2024-11-09 00:02:45,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249465015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:02:45,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:02:45,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:02:45,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471302338] [2024-11-09 00:02:45,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:02:45,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:02:45,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:02:45,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:02:45,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:02:45,440 INFO L87 Difference]: Start difference. First operand 356 states and 534 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:02:45,845 INFO L93 Difference]: Finished difference Result 664 states and 988 transitions. [2024-11-09 00:02:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 00:02:45,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-09 00:02:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:02:45,849 INFO L225 Difference]: With dead ends: 664 [2024-11-09 00:02:45,849 INFO L226 Difference]: Without dead ends: 478 [2024-11-09 00:02:45,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:02:45,851 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 166 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:02:45,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 316 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:02:45,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-09 00:02:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 362. [2024-11-09 00:02:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 319 states have (on average 1.4420062695924765) internal successors, (460), 319 states have internal predecessors, (460), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 00:02:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 538 transitions. [2024-11-09 00:02:45,881 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 538 transitions. Word has length 96 [2024-11-09 00:02:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:02:45,882 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 538 transitions. [2024-11-09 00:02:45,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 538 transitions. [2024-11-09 00:02:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 00:02:45,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:02:45,885 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:45,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 00:02:45,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:02:45,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:02:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1429541673, now seen corresponding path program 1 times [2024-11-09 00:02:45,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:02:45,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612100189] [2024-11-09 00:02:45,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:02:45,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:02:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:02:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:02:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:02:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:02:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:02:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:02:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:02:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:02:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:02:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:02:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:02:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:02:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:02:46,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:02:46,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612100189] [2024-11-09 00:02:46,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612100189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:02:46,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:02:46,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:02:46,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729973596] [2024-11-09 00:02:46,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:02:46,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:02:46,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:02:46,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:02:46,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:02:46,166 INFO L87 Difference]: Start difference. First operand 362 states and 538 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:02:46,329 INFO L93 Difference]: Finished difference Result 582 states and 865 transitions. [2024-11-09 00:02:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:02:46,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-09 00:02:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:02:46,332 INFO L225 Difference]: With dead ends: 582 [2024-11-09 00:02:46,333 INFO L226 Difference]: Without dead ends: 354 [2024-11-09 00:02:46,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:02:46,335 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 82 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:02:46,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 233 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:02:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-09 00:02:46,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 324. [2024-11-09 00:02:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 281 states have (on average 1.402135231316726) internal successors, (394), 281 states have internal predecessors, (394), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 00:02:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 472 transitions. [2024-11-09 00:02:46,366 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 472 transitions. Word has length 96 [2024-11-09 00:02:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:02:46,367 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 472 transitions. [2024-11-09 00:02:46,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 472 transitions. [2024-11-09 00:02:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 00:02:46,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:02:46,368 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:46,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 00:02:46,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:02:46,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:02:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1915436771, now seen corresponding path program 1 times [2024-11-09 00:02:46,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:02:46,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050359712] [2024-11-09 00:02:46,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:02:46,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:02:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:02:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:02:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:02:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:02:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:02:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:02:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:02:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:02:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:02:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:02:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:02:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:02:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:02:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:02:48,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050359712] [2024-11-09 00:02:48,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050359712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:02:48,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:02:48,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 00:02:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727842111] [2024-11-09 00:02:48,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:02:48,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 00:02:48,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:02:48,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 00:02:48,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:02:48,595 INFO L87 Difference]: Start difference. First operand 324 states and 472 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:49,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:02:49,856 INFO L93 Difference]: Finished difference Result 658 states and 947 transitions. [2024-11-09 00:02:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 00:02:49,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-09 00:02:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:02:49,861 INFO L225 Difference]: With dead ends: 658 [2024-11-09 00:02:49,861 INFO L226 Difference]: Without dead ends: 524 [2024-11-09 00:02:49,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:02:49,863 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 371 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:02:49,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 463 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:02:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-09 00:02:49,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 360. [2024-11-09 00:02:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 315 states have (on average 1.3714285714285714) internal successors, (432), 315 states have internal predecessors, (432), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 00:02:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2024-11-09 00:02:49,892 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 97 [2024-11-09 00:02:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:02:49,892 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2024-11-09 00:02:49,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2024-11-09 00:02:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 00:02:49,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:02:49,894 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:49,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 00:02:49,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:02:49,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:02:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1080344919, now seen corresponding path program 1 times [2024-11-09 00:02:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:02:49,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141900208] [2024-11-09 00:02:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:02:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:02:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:02:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:02:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:02:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:02:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:02:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:02:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:02:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:02:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:02:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:02:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:02:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:02:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:02:52,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:02:52,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141900208] [2024-11-09 00:02:52,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141900208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:02:52,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:02:52,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 00:02:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001146258] [2024-11-09 00:02:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:02:52,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 00:02:52,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:02:52,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 00:02:52,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-09 00:02:52,491 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:54,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:02:54,714 INFO L93 Difference]: Finished difference Result 855 states and 1214 transitions. [2024-11-09 00:02:54,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 00:02:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-09 00:02:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:02:54,718 INFO L225 Difference]: With dead ends: 855 [2024-11-09 00:02:54,719 INFO L226 Difference]: Without dead ends: 637 [2024-11-09 00:02:54,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2024-11-09 00:02:54,720 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 463 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:02:54,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 427 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:02:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-09 00:02:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 443. [2024-11-09 00:02:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 398 states have (on average 1.3894472361809045) internal successors, (553), 398 states have internal predecessors, (553), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 00:02:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 631 transitions. [2024-11-09 00:02:54,758 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 631 transitions. Word has length 97 [2024-11-09 00:02:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:02:54,759 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 631 transitions. [2024-11-09 00:02:54,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:02:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 631 transitions. [2024-11-09 00:02:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 00:02:54,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:02:54,761 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:02:54,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 00:02:54,761 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:02:54,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:02:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1760403289, now seen corresponding path program 1 times [2024-11-09 00:02:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:02:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107766363] [2024-11-09 00:02:54,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:02:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:03:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:03:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:03:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:03:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:03:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:03:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:03:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:03:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:03:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:03:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:03:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:03:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:03:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:03:00,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:03:00,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107766363] [2024-11-09 00:03:00,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107766363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:03:00,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:03:00,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 00:03:00,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202424083] [2024-11-09 00:03:00,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:03:00,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:03:00,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:03:00,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:03:00,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:03:00,794 INFO L87 Difference]: Start difference. First operand 443 states and 631 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:03:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:03:02,678 INFO L93 Difference]: Finished difference Result 844 states and 1182 transitions. [2024-11-09 00:03:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 00:03:02,679 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2024-11-09 00:03:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:03:02,682 INFO L225 Difference]: With dead ends: 844 [2024-11-09 00:03:02,682 INFO L226 Difference]: Without dead ends: 553 [2024-11-09 00:03:02,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-11-09 00:03:02,683 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 286 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:03:02,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 796 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 00:03:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-09 00:03:02,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 443. [2024-11-09 00:03:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 398 states have (on average 1.3869346733668342) internal successors, (552), 398 states have internal predecessors, (552), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 00:03:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 630 transitions. [2024-11-09 00:03:02,722 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 630 transitions. Word has length 97 [2024-11-09 00:03:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:03:02,724 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 630 transitions. [2024-11-09 00:03:02,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 00:03:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 630 transitions. [2024-11-09 00:03:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 00:03:02,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:03:02,726 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:03:02,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 00:03:02,726 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:03:02,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:03:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash -661313962, now seen corresponding path program 1 times [2024-11-09 00:03:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:03:02,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592266574] [2024-11-09 00:03:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:03:02,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:03:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:03:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:03:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:03:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:03:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:03:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:03:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:03:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:03:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:03:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:03:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:03:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:03:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:03:10,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:03:10,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592266574] [2024-11-09 00:03:10,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592266574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:03:10,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:03:10,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 00:03:10,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123783491] [2024-11-09 00:03:10,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:03:10,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 00:03:10,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:03:10,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 00:03:10,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:03:10,636 INFO L87 Difference]: Start difference. First operand 443 states and 630 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:03:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:03:12,923 INFO L93 Difference]: Finished difference Result 799 states and 1126 transitions. [2024-11-09 00:03:12,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 00:03:12,923 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-09 00:03:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:03:12,926 INFO L225 Difference]: With dead ends: 799 [2024-11-09 00:03:12,926 INFO L226 Difference]: Without dead ends: 569 [2024-11-09 00:03:12,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2024-11-09 00:03:12,928 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 400 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:03:12,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 575 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 00:03:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-09 00:03:12,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 423. [2024-11-09 00:03:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 378 states have (on average 1.3915343915343916) internal successors, (526), 378 states have internal predecessors, (526), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 00:03:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 604 transitions. [2024-11-09 00:03:12,959 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 604 transitions. Word has length 98 [2024-11-09 00:03:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:03:12,960 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 604 transitions. [2024-11-09 00:03:12,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:03:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 604 transitions. [2024-11-09 00:03:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 00:03:12,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:03:12,961 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:03:12,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 00:03:12,962 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:03:12,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:03:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash 18744408, now seen corresponding path program 1 times [2024-11-09 00:03:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:03:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831402278] [2024-11-09 00:03:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:03:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:03:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:03:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:03:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:03:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:03:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:03:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:03:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:03:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:03:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:03:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:03:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:03:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:03:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 00:03:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:03:14,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831402278] [2024-11-09 00:03:14,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831402278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:03:14,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:03:14,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 00:03:14,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967960781] [2024-11-09 00:03:14,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:03:14,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:03:14,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:03:14,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:03:14,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:03:14,846 INFO L87 Difference]: Start difference. First operand 423 states and 604 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:03:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:03:15,462 INFO L93 Difference]: Finished difference Result 727 states and 1026 transitions. [2024-11-09 00:03:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:03:15,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-09 00:03:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:03:15,465 INFO L225 Difference]: With dead ends: 727 [2024-11-09 00:03:15,465 INFO L226 Difference]: Without dead ends: 493 [2024-11-09 00:03:15,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-09 00:03:15,466 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 214 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:03:15,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 390 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:03:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-09 00:03:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 413. [2024-11-09 00:03:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 368 states have (on average 1.391304347826087) internal successors, (512), 368 states have internal predecessors, (512), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 00:03:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 590 transitions. [2024-11-09 00:03:15,492 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 590 transitions. Word has length 98 [2024-11-09 00:03:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:03:15,493 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 590 transitions. [2024-11-09 00:03:15,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-09 00:03:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 590 transitions. [2024-11-09 00:03:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 00:03:15,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:03:15,494 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:03:15,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 00:03:15,494 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:03:15,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:03:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash 633811080, now seen corresponding path program 1 times [2024-11-09 00:03:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:03:15,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465141467] [2024-11-09 00:03:15,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:03:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat