./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa1b7e3020c9e54f93d45078f4a249ca3b737cc17c725ce83b71e2a4a5a42766 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:55:16,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:55:16,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:55:16,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:55:16,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:55:16,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:55:16,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:55:16,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:55:16,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:55:16,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:55:16,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:55:16,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:55:16,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:55:16,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:55:16,598 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:55:16,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:55:16,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:55:16,599 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:55:16,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:55:16,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:55:16,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:55:16,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:55:16,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:55:16,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:55:16,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:55:16,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:55:16,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:55:16,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:55:16,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:55:16,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:55:16,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:55:16,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:55:16,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:55:16,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:55:16,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:55:16,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:55:16,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:55:16,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:55:16,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:55:16,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:55:16,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:55:16,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:55:16,610 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa1b7e3020c9e54f93d45078f4a249ca3b737cc17c725ce83b71e2a4a5a42766 [2024-11-20 06:55:16,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:55:16,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:55:16,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:55:16,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:55:16,872 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:55:16,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-11-20 06:55:18,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:55:18,567 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:55:18,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-11-20 06:55:18,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aea2bde3d/5f8ee36a62a34fffae4ed95c69f2b5f1/FLAG10b97935d [2024-11-20 06:55:18,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aea2bde3d/5f8ee36a62a34fffae4ed95c69f2b5f1 [2024-11-20 06:55:18,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:55:18,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:55:18,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:55:18,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:55:18,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:55:18,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:55:18" (1/1) ... [2024-11-20 06:55:18,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f0ec1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:18, skipping insertion in model container [2024-11-20 06:55:18,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:55:18" (1/1) ... [2024-11-20 06:55:18,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:55:19,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i[915,928] [2024-11-20 06:55:19,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:55:19,214 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:55:19,224 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i[915,928] [2024-11-20 06:55:19,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:55:19,279 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:55:19,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19 WrapperNode [2024-11-20 06:55:19,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:55:19,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:55:19,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:55:19,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:55:19,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,353 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-20 06:55:19,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:55:19,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:55:19,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:55:19,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:55:19,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,395 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-20 06:55:19,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:55:19,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:55:19,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:55:19,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:55:19,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (1/1) ... [2024-11-20 06:55:19,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:55:19,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:55:19,467 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-20 06:55:19,475 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-20 06:55:19,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:55:19,523 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:55:19,523 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:55:19,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:55:19,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:55:19,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:55:19,614 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:55:19,617 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:55:20,038 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-20 06:55:20,038 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:55:20,058 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:55:20,060 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:55:20,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:55:20 BoogieIcfgContainer [2024-11-20 06:55:20,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:55:20,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:55:20,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:55:20,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:55:20,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:55:18" (1/3) ... [2024-11-20 06:55:20,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e930d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:55:20, skipping insertion in model container [2024-11-20 06:55:20,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:55:19" (2/3) ... [2024-11-20 06:55:20,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e930d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:55:20, skipping insertion in model container [2024-11-20 06:55:20,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:55:20" (3/3) ... [2024-11-20 06:55:20,073 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-11-20 06:55:20,091 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:55:20,092 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:55:20,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:55:20,160 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;@4a6b2a1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:55:20,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:55:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 06:55:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 06:55:20,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:55:20,177 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:55:20,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:55:20,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:55:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1526986655, now seen corresponding path program 1 times [2024-11-20 06:55:20,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:55:20,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946519867] [2024-11-20 06:55:20,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:55:20,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:55:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:55:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:55:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:55:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:55:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:55:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:55:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:55:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:55:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:55:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:55:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:55:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:55:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:55:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:55:20,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:55:20,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946519867] [2024-11-20 06:55:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946519867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:55:20,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:55:20,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:55:20,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088555706] [2024-11-20 06:55:20,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:55:20,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:55:20,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:55:20,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:55:20,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:55:20,690 INFO L87 Difference]: Start difference. First operand has 72 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 06:55:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:55:20,724 INFO L93 Difference]: Finished difference Result 141 states and 228 transitions. [2024-11-20 06:55:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:55:20,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2024-11-20 06:55:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:55:20,735 INFO L225 Difference]: With dead ends: 141 [2024-11-20 06:55:20,735 INFO L226 Difference]: Without dead ends: 68 [2024-11-20 06:55:20,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:55:20,743 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:55:20,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:55:20,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-20 06:55:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-20 06:55:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 06:55:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2024-11-20 06:55:20,791 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 94 [2024-11-20 06:55:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:55:20,792 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2024-11-20 06:55:20,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 06:55:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2024-11-20 06:55:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 06:55:20,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:55:20,798 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:55:20,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:55:20,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:55:20,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:55:20,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1654717725, now seen corresponding path program 1 times [2024-11-20 06:55:20,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:55:20,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291880133] [2024-11-20 06:55:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:55:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:55:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:55:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:55:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:55:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:55:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:55:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:55:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:55:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:55:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:55:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:55:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:55:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:55:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:55:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:55:21,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:55:21,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291880133] [2024-11-20 06:55:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291880133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:55:21,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:55:21,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:55:21,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562426901] [2024-11-20 06:55:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:55:21,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:55:21,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:55:21,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:55:21,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:55:21,307 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:55:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:55:21,496 INFO L93 Difference]: Finished difference Result 229 states and 346 transitions. [2024-11-20 06:55:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:55:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-11-20 06:55:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:55:21,501 INFO L225 Difference]: With dead ends: 229 [2024-11-20 06:55:21,501 INFO L226 Difference]: Without dead ends: 164 [2024-11-20 06:55:21,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:55:21,505 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 131 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:55:21,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 325 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:55:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-20 06:55:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 133. [2024-11-20 06:55:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 06:55:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 201 transitions. [2024-11-20 06:55:21,544 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 201 transitions. Word has length 94 [2024-11-20 06:55:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:55:21,547 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 201 transitions. [2024-11-20 06:55:21,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:55:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 201 transitions. [2024-11-20 06:55:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-20 06:55:21,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:55:21,549 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:55:21,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:55:21,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:55:21,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:55:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash -616898898, now seen corresponding path program 1 times [2024-11-20 06:55:21,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:55:21,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961253864] [2024-11-20 06:55:21,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:55:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:55:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:55:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:55:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:55:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:55:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:55:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:21,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:55:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:55:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:22,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:55:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:22,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:55:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:55:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:22,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:55:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:22,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:55:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:55:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:55:22,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:55:22,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961253864] [2024-11-20 06:55:22,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961253864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:55:22,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:55:22,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:55:22,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607221510] [2024-11-20 06:55:22,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:55:22,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:55:22,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:55:22,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:55:22,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:55:22,050 INFO L87 Difference]: Start difference. First operand 133 states and 201 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:55:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:55:22,334 INFO L93 Difference]: Finished difference Result 388 states and 586 transitions. [2024-11-20 06:55:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:55:22,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2024-11-20 06:55:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:55:22,339 INFO L225 Difference]: With dead ends: 388 [2024-11-20 06:55:22,339 INFO L226 Difference]: Without dead ends: 258 [2024-11-20 06:55:22,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:55:22,345 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 126 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:55:22,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 333 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:55:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-20 06:55:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 137. [2024-11-20 06:55:22,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 06:55:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2024-11-20 06:55:22,377 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 95 [2024-11-20 06:55:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:55:22,379 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2024-11-20 06:55:22,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:55:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2024-11-20 06:55:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 06:55:22,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:55:22,384 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:55:22,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:55:22,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:55:22,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:55:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1854308373, now seen corresponding path program 1 times [2024-11-20 06:55:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:55:22,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290456771] [2024-11-20 06:55:22,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:55:22,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:55:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:55:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:55:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:55:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:55:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:55:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:55:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:55:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:55:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:55:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:55:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:55:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:55:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:55:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:55:46,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:55:46,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290456771] [2024-11-20 06:55:46,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290456771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:55:46,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:55:46,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 06:55:46,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882358939] [2024-11-20 06:55:46,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:55:46,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 06:55:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:55:46,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 06:55:46,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-20 06:55:46,113 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:55:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:55:49,726 INFO L93 Difference]: Finished difference Result 551 states and 802 transitions. [2024-11-20 06:55:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 06:55:49,726 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-20 06:55:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:55:49,731 INFO L225 Difference]: With dead ends: 551 [2024-11-20 06:55:49,731 INFO L226 Difference]: Without dead ends: 417 [2024-11-20 06:55:49,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-11-20 06:55:49,733 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 540 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 06:55:49,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 574 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 06:55:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-20 06:55:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 251. [2024-11-20 06:55:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 208 states have (on average 1.4182692307692308) internal successors, (295), 208 states have internal predecessors, (295), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 06:55:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2024-11-20 06:55:49,781 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 96 [2024-11-20 06:55:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:55:49,782 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2024-11-20 06:55:49,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:55:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2024-11-20 06:55:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 06:55:49,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:55:49,785 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:55:49,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:55:49,786 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:55:49,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:55:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash -79301011, now seen corresponding path program 1 times [2024-11-20 06:55:49,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:55:49,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756876781] [2024-11-20 06:55:49,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:55:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:55:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:51,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:55:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:51,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:55:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:51,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:55:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:55:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:52,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:55:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:52,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:55:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:52,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:55:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:52,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:55:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:52,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:55:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:52,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:55:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:52,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:55:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:55:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:52,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:55:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:55:52,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:55:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756876781] [2024-11-20 06:55:52,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756876781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:55:52,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:55:52,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:55:52,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294093014] [2024-11-20 06:55:52,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:55:52,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:55:52,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:55:52,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:55:52,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:55:52,067 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:55:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:55:52,960 INFO L93 Difference]: Finished difference Result 618 states and 919 transitions. [2024-11-20 06:55:52,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:55:52,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-20 06:55:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:55:52,963 INFO L225 Difference]: With dead ends: 618 [2024-11-20 06:55:52,964 INFO L226 Difference]: Without dead ends: 468 [2024-11-20 06:55:52,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-20 06:55:52,969 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 406 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 06:55:52,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 350 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 06:55:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-20 06:55:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 296. [2024-11-20 06:55:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 253 states have (on average 1.4150197628458498) internal successors, (358), 253 states have internal predecessors, (358), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 06:55:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 436 transitions. [2024-11-20 06:55:53,011 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 436 transitions. Word has length 96 [2024-11-20 06:55:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:55:53,012 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 436 transitions. [2024-11-20 06:55:53,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:55:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 436 transitions. [2024-11-20 06:55:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 06:55:53,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:55:53,014 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:55:53,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:55:53,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:55:53,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:55:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1174250003, now seen corresponding path program 1 times [2024-11-20 06:55:53,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:55:53,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762219270] [2024-11-20 06:55:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:55:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:55:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:55:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:55:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:55:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:55:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:55:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:55:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:55:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:55:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:55:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:55:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:55:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:55:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:55:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:55:57,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:55:57,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762219270] [2024-11-20 06:55:57,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762219270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:55:57,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:55:57,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 06:55:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866851920] [2024-11-20 06:55:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:55:57,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:55:57,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:55:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:55:57,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:55:57,175 INFO L87 Difference]: Start difference. First operand 296 states and 436 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:55:58,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:55:58,610 INFO L93 Difference]: Finished difference Result 614 states and 896 transitions. [2024-11-20 06:55:58,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 06:55:58,610 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-20 06:55:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:55:58,613 INFO L225 Difference]: With dead ends: 614 [2024-11-20 06:55:58,613 INFO L226 Difference]: Without dead ends: 466 [2024-11-20 06:55:58,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-20 06:55:58,615 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 373 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 06:55:58,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 463 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 06:55:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-20 06:55:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 356. [2024-11-20 06:55:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 313 states have (on average 1.4568690095846646) internal successors, (456), 313 states have internal predecessors, (456), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 06:55:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 534 transitions. [2024-11-20 06:55:58,636 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 534 transitions. Word has length 96 [2024-11-20 06:55:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:55:58,637 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 534 transitions. [2024-11-20 06:55:58,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:55:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 534 transitions. [2024-11-20 06:55:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 06:55:58,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:55:58,638 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:55:58,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 06:55:58,639 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:55:58,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:55:58,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1170525852, now seen corresponding path program 1 times [2024-11-20 06:55:58,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:55:58,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904617139] [2024-11-20 06:55:58,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:55:58,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:55:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:55:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:55:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:55:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:55:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:55:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:55:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:55:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:55:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:55:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:55:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:55:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:55:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:55:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:55:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:55:59,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:55:59,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904617139] [2024-11-20 06:55:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904617139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:55:59,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:55:59,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 06:55:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091306324] [2024-11-20 06:55:59,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:55:59,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 06:55:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:55:59,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 06:55:59,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:55:59,870 INFO L87 Difference]: Start difference. First operand 356 states and 534 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:56:00,263 INFO L93 Difference]: Finished difference Result 664 states and 988 transitions. [2024-11-20 06:56:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 06:56:00,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-20 06:56:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:56:00,267 INFO L225 Difference]: With dead ends: 664 [2024-11-20 06:56:00,267 INFO L226 Difference]: Without dead ends: 478 [2024-11-20 06:56:00,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:56:00,271 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 166 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:56:00,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 316 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:56:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-20 06:56:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 362. [2024-11-20 06:56:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 319 states have (on average 1.4420062695924765) internal successors, (460), 319 states have internal predecessors, (460), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 06:56:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 538 transitions. [2024-11-20 06:56:00,300 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 538 transitions. Word has length 96 [2024-11-20 06:56:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:56:00,301 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 538 transitions. [2024-11-20 06:56:00,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 538 transitions. [2024-11-20 06:56:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 06:56:00,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:56:00,303 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:56:00,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 06:56:00,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:56:00,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:56:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1429541673, now seen corresponding path program 1 times [2024-11-20 06:56:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:56:00,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083344143] [2024-11-20 06:56:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:56:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:56:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:56:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:56:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:56:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:56:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:56:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:56:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:56:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:56:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:56:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:56:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:56:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:56:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:56:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:56:00,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:56:00,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083344143] [2024-11-20 06:56:00,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083344143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:56:00,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:56:00,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:56:00,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913602437] [2024-11-20 06:56:00,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:56:00,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:56:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:56:00,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:56:00,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:56:00,584 INFO L87 Difference]: Start difference. First operand 362 states and 538 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:56:00,769 INFO L93 Difference]: Finished difference Result 582 states and 865 transitions. [2024-11-20 06:56:00,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:56:00,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-20 06:56:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:56:00,773 INFO L225 Difference]: With dead ends: 582 [2024-11-20 06:56:00,773 INFO L226 Difference]: Without dead ends: 354 [2024-11-20 06:56:00,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:56:00,774 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 82 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:56:00,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 233 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:56:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-20 06:56:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 324. [2024-11-20 06:56:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 281 states have (on average 1.402135231316726) internal successors, (394), 281 states have internal predecessors, (394), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 06:56:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 472 transitions. [2024-11-20 06:56:00,805 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 472 transitions. Word has length 96 [2024-11-20 06:56:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:56:00,806 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 472 transitions. [2024-11-20 06:56:00,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 472 transitions. [2024-11-20 06:56:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 06:56:00,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:56:00,808 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:56:00,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 06:56:00,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:56:00,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:56:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1915436771, now seen corresponding path program 1 times [2024-11-20 06:56:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:56:00,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172076723] [2024-11-20 06:56:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:56:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:56:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:56:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:56:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:56:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:56:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:56:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:56:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:56:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:56:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:56:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:56:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:56:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:56:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:56:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:56:02,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:56:02,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172076723] [2024-11-20 06:56:02,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172076723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:56:02,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:56:02,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 06:56:02,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568449803] [2024-11-20 06:56:02,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:56:02,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 06:56:02,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:56:02,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 06:56:02,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:56:02,809 INFO L87 Difference]: Start difference. First operand 324 states and 472 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:03,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:56:03,981 INFO L93 Difference]: Finished difference Result 658 states and 947 transitions. [2024-11-20 06:56:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 06:56:03,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-20 06:56:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:56:03,985 INFO L225 Difference]: With dead ends: 658 [2024-11-20 06:56:03,985 INFO L226 Difference]: Without dead ends: 524 [2024-11-20 06:56:03,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-20 06:56:03,986 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 371 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 06:56:03,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 463 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 06:56:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-20 06:56:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 360. [2024-11-20 06:56:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 315 states have (on average 1.3714285714285714) internal successors, (432), 315 states have internal predecessors, (432), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 06:56:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2024-11-20 06:56:04,011 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 97 [2024-11-20 06:56:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:56:04,011 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2024-11-20 06:56:04,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2024-11-20 06:56:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 06:56:04,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:56:04,013 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:56:04,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 06:56:04,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:56:04,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:56:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1080344919, now seen corresponding path program 1 times [2024-11-20 06:56:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:56:04,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252699116] [2024-11-20 06:56:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:56:04,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:56:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:56:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:56:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:56:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:56:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:56:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:56:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:56:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:56:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:56:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:56:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:56:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:56:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:56:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:56:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:56:06,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252699116] [2024-11-20 06:56:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252699116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:56:06,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:56:06,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 06:56:06,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846986535] [2024-11-20 06:56:06,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:56:06,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 06:56:06,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:56:06,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 06:56:06,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:56:06,644 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:56:08,907 INFO L93 Difference]: Finished difference Result 855 states and 1214 transitions. [2024-11-20 06:56:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 06:56:08,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-20 06:56:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:56:08,911 INFO L225 Difference]: With dead ends: 855 [2024-11-20 06:56:08,911 INFO L226 Difference]: Without dead ends: 637 [2024-11-20 06:56:08,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2024-11-20 06:56:08,913 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 463 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 06:56:08,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 427 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 06:56:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-20 06:56:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 443. [2024-11-20 06:56:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 398 states have (on average 1.3894472361809045) internal successors, (553), 398 states have internal predecessors, (553), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 06:56:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 631 transitions. [2024-11-20 06:56:08,943 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 631 transitions. Word has length 97 [2024-11-20 06:56:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:56:08,944 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 631 transitions. [2024-11-20 06:56:08,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 631 transitions. [2024-11-20 06:56:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 06:56:08,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:56:08,945 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:56:08,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 06:56:08,946 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:56:08,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:56:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1760403289, now seen corresponding path program 1 times [2024-11-20 06:56:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:56:08,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815451887] [2024-11-20 06:56:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:56:08,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:56:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:56:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:56:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:56:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:56:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:56:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:56:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:56:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:56:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:56:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:56:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:56:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:56:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:56:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:56:15,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:56:15,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815451887] [2024-11-20 06:56:15,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815451887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:56:15,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:56:15,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 06:56:15,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862755729] [2024-11-20 06:56:15,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:56:15,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 06:56:15,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:56:15,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 06:56:15,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-20 06:56:15,162 INFO L87 Difference]: Start difference. First operand 443 states and 631 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 06:56:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:56:17,133 INFO L93 Difference]: Finished difference Result 844 states and 1182 transitions. [2024-11-20 06:56:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 06:56:17,134 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2024-11-20 06:56:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:56:17,136 INFO L225 Difference]: With dead ends: 844 [2024-11-20 06:56:17,137 INFO L226 Difference]: Without dead ends: 553 [2024-11-20 06:56:17,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-11-20 06:56:17,138 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 286 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:56:17,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 796 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 06:56:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-20 06:56:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 443. [2024-11-20 06:56:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 398 states have (on average 1.3869346733668342) internal successors, (552), 398 states have internal predecessors, (552), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 06:56:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 630 transitions. [2024-11-20 06:56:17,164 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 630 transitions. Word has length 97 [2024-11-20 06:56:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:56:17,165 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 630 transitions. [2024-11-20 06:56:17,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 06:56:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 630 transitions. [2024-11-20 06:56:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 06:56:17,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:56:17,166 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:56:17,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 06:56:17,167 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:56:17,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:56:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash -661313962, now seen corresponding path program 1 times [2024-11-20 06:56:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:56:17,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987794768] [2024-11-20 06:56:17,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:56:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:56:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:56:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:56:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:56:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:56:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:56:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:56:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:56:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:56:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:56:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:56:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:56:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:56:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:56:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:56:24,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:56:24,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987794768] [2024-11-20 06:56:24,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987794768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:56:24,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:56:24,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 06:56:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49166683] [2024-11-20 06:56:24,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:56:24,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 06:56:24,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:56:24,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 06:56:24,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-20 06:56:24,645 INFO L87 Difference]: Start difference. First operand 443 states and 630 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:56:27,004 INFO L93 Difference]: Finished difference Result 799 states and 1126 transitions. [2024-11-20 06:56:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 06:56:27,004 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-20 06:56:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:56:27,006 INFO L225 Difference]: With dead ends: 799 [2024-11-20 06:56:27,007 INFO L226 Difference]: Without dead ends: 569 [2024-11-20 06:56:27,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2024-11-20 06:56:27,008 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 400 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:56:27,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 575 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 06:56:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-20 06:56:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 423. [2024-11-20 06:56:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 378 states have (on average 1.3915343915343916) internal successors, (526), 378 states have internal predecessors, (526), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 06:56:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 604 transitions. [2024-11-20 06:56:27,036 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 604 transitions. Word has length 98 [2024-11-20 06:56:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:56:27,036 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 604 transitions. [2024-11-20 06:56:27,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 604 transitions. [2024-11-20 06:56:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 06:56:27,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:56:27,037 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:56:27,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 06:56:27,038 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:56:27,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:56:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash 18744408, now seen corresponding path program 1 times [2024-11-20 06:56:27,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:56:27,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708330506] [2024-11-20 06:56:27,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:56:27,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:56:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:56:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:56:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 06:56:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:56:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 06:56:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:56:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:56:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:56:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:56:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:56:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:56:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:56:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 06:56:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:56:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-20 06:56:29,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:56:29,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708330506] [2024-11-20 06:56:29,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708330506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:56:29,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:56:29,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:56:29,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214186043] [2024-11-20 06:56:29,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:56:29,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:56:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:56:29,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:56:29,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:56:29,074 INFO L87 Difference]: Start difference. First operand 423 states and 604 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:56:29,641 INFO L93 Difference]: Finished difference Result 727 states and 1026 transitions. [2024-11-20 06:56:29,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:56:29,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-20 06:56:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:56:29,645 INFO L225 Difference]: With dead ends: 727 [2024-11-20 06:56:29,645 INFO L226 Difference]: Without dead ends: 493 [2024-11-20 06:56:29,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-20 06:56:29,646 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 214 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:56:29,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 390 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 06:56:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-20 06:56:29,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 413. [2024-11-20 06:56:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 368 states have (on average 1.391304347826087) internal successors, (512), 368 states have internal predecessors, (512), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 06:56:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 590 transitions. [2024-11-20 06:56:29,679 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 590 transitions. Word has length 98 [2024-11-20 06:56:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:56:29,680 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 590 transitions. [2024-11-20 06:56:29,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-20 06:56:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 590 transitions. [2024-11-20 06:56:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 06:56:29,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:56:29,681 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:56:29,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 06:56:29,681 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:56:29,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:56:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash 633811080, now seen corresponding path program 1 times [2024-11-20 06:56:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:56:29,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066060392] [2024-11-20 06:56:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:56:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:56:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat