./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-86.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 f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:48:58,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:48:58,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:48:58,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:48:58,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:48:58,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:48:58,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:48:58,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:48:58,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:48:58,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:48:58,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:48:58,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:48:58,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:48:58,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:48:58,976 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:48:58,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:48:58,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:48:58,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:48:58,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:48:58,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:48:58,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:48:58,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:48:58,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:48:58,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:48:58,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:48:58,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:48:58,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:48:58,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:48:58,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:48:58,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:48:58,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:48:58,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:48:58,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:48:58,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:48:58,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:48:58,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:48:58,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:48:58,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:48:58,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:48:58,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:48:58,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:48:58,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:48:58,989 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 -> f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b [2024-11-16 16:48:59,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:48:59,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:48:59,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:48:59,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:48:59,260 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:48:59,261 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-86.i [2024-11-16 16:49:00,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:49:01,027 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:49:01,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i [2024-11-16 16:49:01,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0f7c982/354e2367ed484ec79df8a5d5d88830fd/FLAGff0ca28ac [2024-11-16 16:49:01,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0f7c982/354e2367ed484ec79df8a5d5d88830fd [2024-11-16 16:49:01,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:49:01,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:49:01,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:49:01,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:49:01,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:49:01,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdaf23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01, skipping insertion in model container [2024-11-16 16:49:01,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:49:01,275 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-86.i[915,928] [2024-11-16 16:49:01,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:49:01,373 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:49:01,385 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-86.i[915,928] [2024-11-16 16:49:01,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:49:01,454 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:49:01,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01 WrapperNode [2024-11-16 16:49:01,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:49:01,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:49:01,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:49:01,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:49:01,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,521 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-16 16:49:01,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:49:01,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:49:01,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:49:01,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:49:01,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,566 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-16 16:49:01,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:49:01,604 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:49:01,604 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:49:01,605 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:49:01,606 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (1/1) ... [2024-11-16 16:49:01,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:49:01,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:49:01,648 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-16 16:49:01,651 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-16 16:49:01,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:49:01,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:49:01,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:49:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:49:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:49:01,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:49:01,756 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:49:01,757 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:49:02,166 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-16 16:49:02,166 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:49:02,184 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:49:02,184 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:49:02,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:49:02 BoogieIcfgContainer [2024-11-16 16:49:02,185 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:49:02,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:49:02,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:49:02,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:49:02,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:49:01" (1/3) ... [2024-11-16 16:49:02,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f352764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:49:02, skipping insertion in model container [2024-11-16 16:49:02,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:49:01" (2/3) ... [2024-11-16 16:49:02,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f352764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:49:02, skipping insertion in model container [2024-11-16 16:49:02,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:49:02" (3/3) ... [2024-11-16 16:49:02,198 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-86.i [2024-11-16 16:49:02,212 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:49:02,212 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:49:02,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:49:02,273 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;@3faf8523, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:49:02,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:49:02,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 16:49:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 16:49:02,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:49:02,291 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:49:02,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:49:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:49:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash -639058245, now seen corresponding path program 1 times [2024-11-16 16:49:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:49:02,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470542890] [2024-11-16 16:49:02,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:49:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:49:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:49:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:49:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:49:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:49:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:49:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:49:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:49:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:49:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:49:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:49:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:49:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:49:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:49:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:49:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:49:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:49:02,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:49:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470542890] [2024-11-16 16:49:02,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470542890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:49:02,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:49:02,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:49:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78595706] [2024-11-16 16:49:02,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:49:02,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:49:02,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:49:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:49:02,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:49:02,822 INFO L87 Difference]: Start difference. First operand has 58 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 16:49:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:49:02,845 INFO L93 Difference]: Finished difference Result 112 states and 181 transitions. [2024-11-16 16:49:02,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:49:02,847 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2024-11-16 16:49:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:49:02,855 INFO L225 Difference]: With dead ends: 112 [2024-11-16 16:49:02,855 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 16:49:02,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-16 16:49:02,862 INFO L432 NwaCegarLoop]: 81 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, 81 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-16 16:49:02,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:49:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 16:49:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 16:49:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 16:49:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2024-11-16 16:49:02,909 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 103 [2024-11-16 16:49:02,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:49:02,911 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2024-11-16 16:49:02,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 16:49:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2024-11-16 16:49:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 16:49:02,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:49:02,916 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:49:02,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:49:02,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:49:02,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:49:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash 736521978, now seen corresponding path program 1 times [2024-11-16 16:49:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:49:02,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79985754] [2024-11-16 16:49:02,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:49:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:49:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:49:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:49:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:49:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:49:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:49:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:49:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:49:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:49:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:49:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:49:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:49:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:49:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:49:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:49:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:49:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:49:03,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:49:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79985754] [2024-11-16 16:49:03,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79985754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:49:03,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:49:03,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:49:03,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946931429] [2024-11-16 16:49:03,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:49:03,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:49:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:49:03,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:49:03,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:49:03,498 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:49:03,742 INFO L93 Difference]: Finished difference Result 155 states and 227 transitions. [2024-11-16 16:49:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:49:03,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-16 16:49:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:49:03,745 INFO L225 Difference]: With dead ends: 155 [2024-11-16 16:49:03,745 INFO L226 Difference]: Without dead ends: 105 [2024-11-16 16:49:03,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:49:03,751 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 70 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:49:03,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 248 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:49:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-16 16:49:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2024-11-16 16:49:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 16:49:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2024-11-16 16:49:03,777 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 103 [2024-11-16 16:49:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:49:03,781 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2024-11-16 16:49:03,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2024-11-16 16:49:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 16:49:03,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:49:03,783 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:49:03,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:49:03,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:49:03,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:49:03,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2050893509, now seen corresponding path program 1 times [2024-11-16 16:49:03,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:49:03,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470960757] [2024-11-16 16:49:03,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:49:03,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:49:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:49:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:49:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:49:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:49:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:49:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:49:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:49:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:49:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:49:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:49:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:49:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:49:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:49:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:49:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:49:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:49:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:49:09,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470960757] [2024-11-16 16:49:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470960757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:49:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:49:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 16:49:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821594338] [2024-11-16 16:49:09,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:49:09,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 16:49:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:49:09,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 16:49:09,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-16 16:49:09,245 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 16:49:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:49:10,588 INFO L93 Difference]: Finished difference Result 218 states and 310 transitions. [2024-11-16 16:49:10,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 16:49:10,590 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2024-11-16 16:49:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:49:10,592 INFO L225 Difference]: With dead ends: 218 [2024-11-16 16:49:10,592 INFO L226 Difference]: Without dead ends: 168 [2024-11-16 16:49:10,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2024-11-16 16:49:10,598 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 286 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 16:49:10,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 536 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 16:49:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-16 16:49:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 100. [2024-11-16 16:49:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 states have internal predecessors, (84), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 16:49:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2024-11-16 16:49:10,625 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 103 [2024-11-16 16:49:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:49:10,628 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2024-11-16 16:49:10,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-16 16:49:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2024-11-16 16:49:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 16:49:10,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:49:10,632 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:49:10,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:49:10,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:49:10,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:49:10,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1921810790, now seen corresponding path program 1 times [2024-11-16 16:49:10,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:49:10,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280892737] [2024-11-16 16:49:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:49:10,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:49:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:49:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:49:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:49:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:49:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:49:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:49:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:49:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:49:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:49:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:49:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:49:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:49:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:49:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:49:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:49:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:49:10,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:49:10,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280892737] [2024-11-16 16:49:10,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280892737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:49:10,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:49:10,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:49:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221413674] [2024-11-16 16:49:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:49:10,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:49:10,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:49:10,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:49:10,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:49:10,733 INFO L87 Difference]: Start difference. First operand 100 states and 144 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:49:10,777 INFO L93 Difference]: Finished difference Result 199 states and 290 transitions. [2024-11-16 16:49:10,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:49:10,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-16 16:49:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:49:10,780 INFO L225 Difference]: With dead ends: 199 [2024-11-16 16:49:10,781 INFO L226 Difference]: Without dead ends: 149 [2024-11-16 16:49:10,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:49:10,783 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 69 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:49:10,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 155 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:49:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-16 16:49:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-16 16:49:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 97 states have internal predecessors, (121), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 16:49:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2024-11-16 16:49:10,801 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 103 [2024-11-16 16:49:10,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:49:10,801 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2024-11-16 16:49:10,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2024-11-16 16:49:10,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 16:49:10,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:49:10,803 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:49:10,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 16:49:10,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:49:10,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:49:10,804 INFO L85 PathProgramCache]: Analyzing trace with hash -726479667, now seen corresponding path program 1 times [2024-11-16 16:49:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:49:10,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408581311] [2024-11-16 16:49:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:49:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:49:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:49:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:49:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:49:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:49:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:49:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:49:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:49:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:49:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:49:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:49:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:49:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:49:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:49:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:49:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:49:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:49:17,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:49:17,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408581311] [2024-11-16 16:49:17,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408581311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:49:17,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:49:17,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 16:49:17,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457658960] [2024-11-16 16:49:17,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:49:17,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 16:49:17,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:49:17,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 16:49:17,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-16 16:49:17,760 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:49:20,090 INFO L93 Difference]: Finished difference Result 205 states and 278 transitions. [2024-11-16 16:49:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 16:49:20,091 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-11-16 16:49:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:49:20,092 INFO L225 Difference]: With dead ends: 205 [2024-11-16 16:49:20,092 INFO L226 Difference]: Without dead ends: 202 [2024-11-16 16:49:20,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2024-11-16 16:49:20,094 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 265 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 16:49:20,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 491 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 16:49:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-16 16:49:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 147. [2024-11-16 16:49:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 98 states have internal predecessors, (122), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 16:49:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 212 transitions. [2024-11-16 16:49:20,120 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 212 transitions. Word has length 104 [2024-11-16 16:49:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:49:20,121 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 212 transitions. [2024-11-16 16:49:20,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 212 transitions. [2024-11-16 16:49:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 16:49:20,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:49:20,123 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:49:20,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 16:49:20,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:49:20,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:49:20,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1804347856, now seen corresponding path program 1 times [2024-11-16 16:49:20,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:49:20,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637712383] [2024-11-16 16:49:20,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:49:20,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:49:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:49:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:49:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:49:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:49:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:49:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:49:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:49:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:49:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:49:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:49:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:49:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:49:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:49:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:49:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:49:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:49:20,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:49:20,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637712383] [2024-11-16 16:49:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637712383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:49:20,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:49:20,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:49:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266710369] [2024-11-16 16:49:20,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:49:20,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:49:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:49:20,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:49:20,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:49:20,303 INFO L87 Difference]: Start difference. First operand 147 states and 212 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:49:20,325 INFO L93 Difference]: Finished difference Result 254 states and 368 transitions. [2024-11-16 16:49:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:49:20,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-11-16 16:49:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:49:20,329 INFO L225 Difference]: With dead ends: 254 [2024-11-16 16:49:20,329 INFO L226 Difference]: Without dead ends: 155 [2024-11-16 16:49:20,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:49:20,333 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:49:20,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:49:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-16 16:49:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2024-11-16 16:49:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 98 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 16:49:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 209 transitions. [2024-11-16 16:49:20,358 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 209 transitions. Word has length 104 [2024-11-16 16:49:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:49:20,361 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 209 transitions. [2024-11-16 16:49:20,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 209 transitions. [2024-11-16 16:49:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 16:49:20,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:49:20,363 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:49:20,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 16:49:20,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:49:20,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:49:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash -61537521, now seen corresponding path program 1 times [2024-11-16 16:49:20,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:49:20,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856252781] [2024-11-16 16:49:20,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:49:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:49:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:49:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:49:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:49:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:49:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:49:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:49:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:49:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:49:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:49:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:49:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:49:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:49:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:49:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:49:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:49:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:49:23,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:49:23,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856252781] [2024-11-16 16:49:23,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856252781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:49:23,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:49:23,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 16:49:23,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145512684] [2024-11-16 16:49:23,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:49:23,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 16:49:23,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:49:23,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 16:49:23,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-16 16:49:23,220 INFO L87 Difference]: Start difference. First operand 147 states and 209 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 16:49:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:49:24,245 INFO L93 Difference]: Finished difference Result 205 states and 273 transitions. [2024-11-16 16:49:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 16:49:24,246 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-11-16 16:49:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:49:24,248 INFO L225 Difference]: With dead ends: 205 [2024-11-16 16:49:24,248 INFO L226 Difference]: Without dead ends: 202 [2024-11-16 16:49:24,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2024-11-16 16:49:24,249 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 379 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 16:49:24,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 481 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 16:49:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-16 16:49:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 147. [2024-11-16 16:49:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 98 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 16:49:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 209 transitions. [2024-11-16 16:49:24,275 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 209 transitions. Word has length 104 [2024-11-16 16:49:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:49:24,277 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 209 transitions. [2024-11-16 16:49:24,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 16:49:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 209 transitions. [2024-11-16 16:49:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 16:49:24,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:49:24,278 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:49:24,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 16:49:24,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:49:24,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:49:24,279 INFO L85 PathProgramCache]: Analyzing trace with hash 247389489, now seen corresponding path program 1 times [2024-11-16 16:49:24,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:49:24,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642362916] [2024-11-16 16:49:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:49:24,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:49:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:49:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:49:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:49:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:49:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:49:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:49:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:49:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:49:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:49:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:49:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:49:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:49:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:49:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:49:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:49:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:49:30,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:49:30,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642362916] [2024-11-16 16:49:30,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642362916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:49:30,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:49:30,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-16 16:49:30,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387537814] [2024-11-16 16:49:30,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:49:30,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 16:49:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:49:30,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 16:49:30,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-16 16:49:30,679 INFO L87 Difference]: Start difference. First operand 147 states and 209 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:49:35,953 INFO L93 Difference]: Finished difference Result 229 states and 300 transitions. [2024-11-16 16:49:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 16:49:35,954 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-11-16 16:49:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:49:35,956 INFO L225 Difference]: With dead ends: 229 [2024-11-16 16:49:35,956 INFO L226 Difference]: Without dead ends: 226 [2024-11-16 16:49:35,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2024-11-16 16:49:35,957 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 206 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 16:49:35,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 529 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 16:49:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-16 16:49:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 157. [2024-11-16 16:49:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 108 states have internal predecessors, (132), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 16:49:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 222 transitions. [2024-11-16 16:49:35,972 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 222 transitions. Word has length 104 [2024-11-16 16:49:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:49:35,973 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 222 transitions. [2024-11-16 16:49:35,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 222 transitions. [2024-11-16 16:49:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 16:49:35,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:49:35,975 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:49:35,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 16:49:35,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:49:35,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:49:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash 50875984, now seen corresponding path program 1 times [2024-11-16 16:49:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:49:35,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191903093] [2024-11-16 16:49:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:49:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:49:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:49:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:49:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:49:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:49:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:49:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:49:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:49:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:49:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:49:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:49:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:49:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:49:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:49:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:49:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:49:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:49:40,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:49:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191903093] [2024-11-16 16:49:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191903093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:49:40,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:49:40,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 16:49:40,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630939497] [2024-11-16 16:49:40,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:49:40,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 16:49:40,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:49:40,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 16:49:40,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-16 16:49:40,098 INFO L87 Difference]: Start difference. First operand 157 states and 222 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:49:43,058 INFO L93 Difference]: Finished difference Result 221 states and 292 transitions. [2024-11-16 16:49:43,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 16:49:43,060 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-11-16 16:49:43,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:49:43,061 INFO L225 Difference]: With dead ends: 221 [2024-11-16 16:49:43,061 INFO L226 Difference]: Without dead ends: 218 [2024-11-16 16:49:43,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2024-11-16 16:49:43,063 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 196 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:49:43,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 530 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 16:49:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-16 16:49:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 157. [2024-11-16 16:49:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 108 states have internal predecessors, (132), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 16:49:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 222 transitions. [2024-11-16 16:49:43,076 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 222 transitions. Word has length 104 [2024-11-16 16:49:43,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:49:43,076 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 222 transitions. [2024-11-16 16:49:43,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 222 transitions. [2024-11-16 16:49:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 16:49:43,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:49:43,078 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:49:43,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 16:49:43,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:49:43,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:49:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash 354573597, now seen corresponding path program 1 times [2024-11-16 16:49:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:49:43,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094546234] [2024-11-16 16:49:43,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:49:43,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:49:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:49:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:49:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:49:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:49:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:49:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:49:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:49:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:49:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:49:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:49:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:49:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:49:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:49:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:49:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:49:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:49:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:49:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:49:50,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094546234] [2024-11-16 16:49:50,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094546234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:49:50,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:49:50,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-16 16:49:50,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49421467] [2024-11-16 16:49:50,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:49:50,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 16:49:50,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:49:50,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 16:49:50,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-16 16:49:50,581 INFO L87 Difference]: Start difference. First operand 157 states and 222 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:49:54,108 INFO L93 Difference]: Finished difference Result 231 states and 304 transitions. [2024-11-16 16:49:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 16:49:54,113 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-11-16 16:49:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:49:54,114 INFO L225 Difference]: With dead ends: 231 [2024-11-16 16:49:54,114 INFO L226 Difference]: Without dead ends: 228 [2024-11-16 16:49:54,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=318, Invalid=804, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 16:49:54,115 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 242 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:49:54,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 435 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 16:49:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-16 16:49:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 161. [2024-11-16 16:49:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 16:49:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2024-11-16 16:49:54,131 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 227 transitions. Word has length 105 [2024-11-16 16:49:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:49:54,131 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 227 transitions. [2024-11-16 16:49:54,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:49:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 227 transitions. [2024-11-16 16:49:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 16:49:54,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:49:54,133 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:49:54,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 16:49:54,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:49:54,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:49:54,133 INFO L85 PathProgramCache]: Analyzing trace with hash 158060092, now seen corresponding path program 1 times [2024-11-16 16:49:54,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:49:54,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468782875] [2024-11-16 16:49:54,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:49:54,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:49:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:50:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:50:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:50:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:50:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:50:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:50:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:50:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:50:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:50:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:50:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:50:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:50:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:50:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:50:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:50:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:50:03,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:50:03,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468782875] [2024-11-16 16:50:03,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468782875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:50:03,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:50:03,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-16 16:50:03,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412998885] [2024-11-16 16:50:03,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:50:03,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 16:50:03,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:50:03,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 16:50:03,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2024-11-16 16:50:03,628 INFO L87 Difference]: Start difference. First operand 161 states and 227 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:50:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:50:08,462 INFO L93 Difference]: Finished difference Result 223 states and 296 transitions. [2024-11-16 16:50:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 16:50:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-11-16 16:50:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:50:08,465 INFO L225 Difference]: With dead ends: 223 [2024-11-16 16:50:08,465 INFO L226 Difference]: Without dead ends: 220 [2024-11-16 16:50:08,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=341, Invalid=849, Unknown=0, NotChecked=0, Total=1190 [2024-11-16 16:50:08,466 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 169 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:50:08,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 492 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 16:50:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-16 16:50:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 158. [2024-11-16 16:50:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 16:50:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2024-11-16 16:50:08,485 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 105 [2024-11-16 16:50:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:50:08,487 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2024-11-16 16:50:08,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:50:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2024-11-16 16:50:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 16:50:08,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:50:08,489 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:50:08,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 16:50:08,489 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:50:08,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:50:08,490 INFO L85 PathProgramCache]: Analyzing trace with hash 814013817, now seen corresponding path program 1 times [2024-11-16 16:50:08,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:50:08,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84133539] [2024-11-16 16:50:08,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:50:08,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:50:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:50:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:50:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:50:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:50:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:50:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:50:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:50:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:50:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:50:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:50:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:50:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:50:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:50:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:50:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:50:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:50:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 16:50:13,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:50:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84133539] [2024-11-16 16:50:13,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84133539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:50:13,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:50:13,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 16:50:13,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229404049] [2024-11-16 16:50:13,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:50:13,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 16:50:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:50:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 16:50:13,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-16 16:50:13,446 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:50:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:50:15,775 INFO L93 Difference]: Finished difference Result 212 states and 282 transitions. [2024-11-16 16:50:15,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 16:50:15,777 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-11-16 16:50:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:50:15,778 INFO L225 Difference]: With dead ends: 212 [2024-11-16 16:50:15,778 INFO L226 Difference]: Without dead ends: 209 [2024-11-16 16:50:15,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2024-11-16 16:50:15,780 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 290 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 16:50:15,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 456 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 16:50:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-16 16:50:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 155. [2024-11-16 16:50:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 106 states have internal predecessors, (129), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-16 16:50:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 219 transitions. [2024-11-16 16:50:15,796 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 219 transitions. Word has length 105 [2024-11-16 16:50:15,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:50:15,796 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 219 transitions. [2024-11-16 16:50:15,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 16:50:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 219 transitions. [2024-11-16 16:50:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 16:50:15,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:50:15,799 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:50:15,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 16:50:15,800 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:50:15,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:50:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1829445686, now seen corresponding path program 1 times [2024-11-16 16:50:15,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:50:15,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594336108] [2024-11-16 16:50:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:50:15,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:50:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat