./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-while_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-86.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e1047099521e87044ce5ae27d41e430db32c7eb9b2cde271d3abaa7b618de5ae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:05:24,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:05:24,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:05:24,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:05:24,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:05:24,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:05:24,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:05:24,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:05:24,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:05:24,420 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:05:24,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:05:24,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:05:24,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:05:24,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:05:24,422 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:05:24,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:05:24,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:05:24,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:05:24,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:05:24,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:05:24,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:05:24,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:05:24,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:05:24,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:05:24,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:05:24,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:05:24,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:05:24,428 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:05:24,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:05:24,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:05:24,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:05:24,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:05:24,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:05:24,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:05:24,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:05:24,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:05:24,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:05:24,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:05:24,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:05:24,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:05:24,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:05:24,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:05:24,433 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-clean/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-clean/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 -> e1047099521e87044ce5ae27d41e430db32c7eb9b2cde271d3abaa7b618de5ae [2024-10-11 12:05:24,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:05:24,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:05:24,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:05:24,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:05:24,782 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:05:24,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-86.i [2024-10-11 12:05:26,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:05:26,631 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:05:26,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-86.i [2024-10-11 12:05:26,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/062ce6af7/cc741b494abc46e682cd5d6d70602958/FLAG99ed02847 [2024-10-11 12:05:27,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/062ce6af7/cc741b494abc46e682cd5d6d70602958 [2024-10-11 12:05:27,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:05:27,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:05:27,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:05:27,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:05:27,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:05:27,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a5c2c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27, skipping insertion in model container [2024-10-11 12:05:27,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:05:27,256 WARN L248 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-while_file-86.i[915,928] [2024-10-11 12:05:27,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:05:27,362 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:05:27,377 WARN L248 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-while_file-86.i[915,928] [2024-10-11 12:05:27,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:05:27,452 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:05:27,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27 WrapperNode [2024-10-11 12:05:27,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:05:27,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:05:27,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:05:27,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:05:27,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,543 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-10-11 12:05:27,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:05:27,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:05:27,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:05:27,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:05:27,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,598 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-10-11 12:05:27,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:05:27,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:05:27,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:05:27,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:05:27,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (1/1) ... [2024-10-11 12:05:27,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:05:27,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:05:27,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:05:27,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:05:27,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:05:27,740 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:05:27,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:05:27,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:05:27,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:05:27,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:05:27,827 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:05:27,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:05:28,292 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 12:05:28,296 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:05:28,363 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:05:28,363 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:05:28,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:05:28 BoogieIcfgContainer [2024-10-11 12:05:28,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:05:28,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:05:28,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:05:28,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:05:28,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:05:27" (1/3) ... [2024-10-11 12:05:28,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b30a721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:05:28, skipping insertion in model container [2024-10-11 12:05:28,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:05:27" (2/3) ... [2024-10-11 12:05:28,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b30a721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:05:28, skipping insertion in model container [2024-10-11 12:05:28,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:05:28" (3/3) ... [2024-10-11 12:05:28,378 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-86.i [2024-10-11 12:05:28,398 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:05:28,398 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:05:28,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:05:28,490 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;@1630a2f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:05:28,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:05:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 12:05:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 12:05:28,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:05:28,509 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:05:28,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:05:28,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:05:28,515 INFO L85 PathProgramCache]: Analyzing trace with hash -418828216, now seen corresponding path program 1 times [2024-10-11 12:05:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:05:28,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894361502] [2024-10-11 12:05:28,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:05:28,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:05:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:05:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:05:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:05:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:05:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:05:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:05:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:05:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:05:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:05:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:05:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:05:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:05:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:05:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:05:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:05:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:05:29,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:05:29,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894361502] [2024-10-11 12:05:29,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894361502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:05:29,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:05:29,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:05:29,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232989568] [2024-10-11 12:05:29,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:05:29,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:05:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:05:29,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:05:29,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:05:29,072 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:05:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:05:29,126 INFO L93 Difference]: Finished difference Result 95 states and 165 transitions. [2024-10-11 12:05:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:05:29,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-10-11 12:05:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:05:29,139 INFO L225 Difference]: With dead ends: 95 [2024-10-11 12:05:29,140 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 12:05:29,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:05:29,150 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:05:29,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:05:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 12:05:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 12:05:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 12:05:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2024-10-11 12:05:29,208 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 97 [2024-10-11 12:05:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:05:29,209 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2024-10-11 12:05:29,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:05:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2024-10-11 12:05:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 12:05:29,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:05:29,215 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:05:29,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:05:29,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:05:29,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:05:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1564567482, now seen corresponding path program 1 times [2024-10-11 12:05:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:05:29,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090291123] [2024-10-11 12:05:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:05:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:05:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:05:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:05:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:05:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:05:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:05:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:05:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:05:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:05:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:05:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:05:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:05:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:05:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:05:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:05:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:05:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:05:29,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:05:29,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090291123] [2024-10-11 12:05:29,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090291123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:05:29,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:05:29,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:05:29,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205372887] [2024-10-11 12:05:29,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:05:29,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:05:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:05:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:05:29,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:05:29,770 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:05:30,014 INFO L93 Difference]: Finished difference Result 140 states and 212 transitions. [2024-10-11 12:05:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:05:30,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-10-11 12:05:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:05:30,019 INFO L225 Difference]: With dead ends: 140 [2024-10-11 12:05:30,020 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 12:05:30,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:05:30,023 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 63 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:05:30,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 227 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:05:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 12:05:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2024-10-11 12:05:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:05:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2024-10-11 12:05:30,056 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 97 [2024-10-11 12:05:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:05:30,057 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2024-10-11 12:05:30,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2024-10-11 12:05:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 12:05:30,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:05:30,060 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:05:30,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:05:30,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:05:30,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:05:30,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2143593800, now seen corresponding path program 1 times [2024-10-11 12:05:30,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:05:30,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985220764] [2024-10-11 12:05:30,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:05:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:05:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:05:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:05:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:05:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:05:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:05:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:05:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:05:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:05:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:05:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:05:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:05:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:05:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:05:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:05:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:05:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:05:39,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:05:39,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985220764] [2024-10-11 12:05:39,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985220764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:05:39,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:05:39,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 12:05:39,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888515293] [2024-10-11 12:05:39,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:05:39,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 12:05:39,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:05:39,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 12:05:39,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 12:05:39,475 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:05:42,692 INFO L93 Difference]: Finished difference Result 192 states and 284 transitions. [2024-10-11 12:05:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 12:05:42,694 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-10-11 12:05:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:05:42,698 INFO L225 Difference]: With dead ends: 192 [2024-10-11 12:05:42,698 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 12:05:42,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2024-10-11 12:05:42,701 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 202 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:05:42,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 394 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 12:05:42,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 12:05:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 91. [2024-10-11 12:05:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:05:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2024-10-11 12:05:42,725 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 97 [2024-10-11 12:05:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:05:42,726 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2024-10-11 12:05:42,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2024-10-11 12:05:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 12:05:42,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:05:42,733 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:05:42,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:05:42,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:05:42,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:05:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1750566790, now seen corresponding path program 1 times [2024-10-11 12:05:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:05:42,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173130122] [2024-10-11 12:05:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:05:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:05:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:05:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:05:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:05:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:05:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:05:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:05:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:05:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:05:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:05:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:05:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:05:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:05:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:05:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:05:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:05:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:05:42,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:05:42,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173130122] [2024-10-11 12:05:42,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173130122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:05:42,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:05:42,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:05:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811651896] [2024-10-11 12:05:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:05:42,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:05:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:05:42,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:05:42,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:05:42,879 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:05:42,939 INFO L93 Difference]: Finished difference Result 182 states and 273 transitions. [2024-10-11 12:05:42,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:05:42,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-10-11 12:05:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:05:42,944 INFO L225 Difference]: With dead ends: 182 [2024-10-11 12:05:42,945 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 12:05:42,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:05:42,950 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 63 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:05:42,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 139 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:05:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 12:05:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-10-11 12:05:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 85 states have internal predecessors, (109), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 12:05:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2024-10-11 12:05:42,986 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 97 [2024-10-11 12:05:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:05:42,987 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2024-10-11 12:05:42,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2024-10-11 12:05:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 12:05:42,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:05:42,989 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:05:42,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:05:42,992 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:05:42,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:05:42,992 INFO L85 PathProgramCache]: Analyzing trace with hash -612437910, now seen corresponding path program 1 times [2024-10-11 12:05:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:05:42,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534120544] [2024-10-11 12:05:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:05:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:05:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:05:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:05:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:05:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:05:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:05:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:05:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:05:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:05:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:05:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:05:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:05:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:05:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:05:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:05:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:05:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:05:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:05:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534120544] [2024-10-11 12:05:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534120544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:05:43,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:05:43,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:05:43,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732870870] [2024-10-11 12:05:43,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:05:43,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:05:43,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:05:43,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:05:43,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:05:43,351 INFO L87 Difference]: Start difference. First operand 134 states and 199 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:05:43,402 INFO L93 Difference]: Finished difference Result 235 states and 349 transitions. [2024-10-11 12:05:43,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:05:43,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-11 12:05:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:05:43,405 INFO L225 Difference]: With dead ends: 235 [2024-10-11 12:05:43,405 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 12:05:43,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:05:43,408 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:05:43,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 182 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:05:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 12:05:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2024-10-11 12:05:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 85 states have internal predecessors, (106), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 12:05:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 196 transitions. [2024-10-11 12:05:43,442 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 196 transitions. Word has length 98 [2024-10-11 12:05:43,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:05:43,445 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 196 transitions. [2024-10-11 12:05:43,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 196 transitions. [2024-10-11 12:05:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 12:05:43,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:05:43,447 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:05:43,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:05:43,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:05:43,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:05:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash -555179608, now seen corresponding path program 1 times [2024-10-11 12:05:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:05:43,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035687321] [2024-10-11 12:05:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:05:43,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:05:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:05:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:05:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:05:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:05:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:05:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:05:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:05:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:05:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:05:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:05:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:05:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:05:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:05:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:05:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:05:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:05:47,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:05:47,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035687321] [2024-10-11 12:05:47,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035687321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:05:47,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:05:47,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 12:05:47,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414960864] [2024-10-11 12:05:47,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:05:47,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 12:05:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:05:47,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 12:05:47,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:05:47,414 INFO L87 Difference]: Start difference. First operand 134 states and 196 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:05:48,695 INFO L93 Difference]: Finished difference Result 186 states and 254 transitions. [2024-10-11 12:05:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 12:05:48,696 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-11 12:05:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:05:48,697 INFO L225 Difference]: With dead ends: 186 [2024-10-11 12:05:48,698 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 12:05:48,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2024-10-11 12:05:48,701 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 225 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:05:48,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 369 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:05:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 12:05:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2024-10-11 12:05:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 12:05:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2024-10-11 12:05:48,718 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 98 [2024-10-11 12:05:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:05:48,719 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2024-10-11 12:05:48,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2024-10-11 12:05:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 12:05:48,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:05:48,723 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:05:48,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:05:48,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:05:48,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:05:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2026805188, now seen corresponding path program 1 times [2024-10-11 12:05:48,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:05:48,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998654721] [2024-10-11 12:05:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:05:48,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:05:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:05:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:05:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:05:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:05:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:05:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:05:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:05:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:05:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:05:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:05:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:05:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:05:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:05:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:05:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:05:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:05:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:05:53,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:05:53,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998654721] [2024-10-11 12:05:53,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998654721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:05:53,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:05:53,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 12:05:53,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154068909] [2024-10-11 12:05:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:05:53,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 12:05:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:05:53,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 12:05:53,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:05:53,431 INFO L87 Difference]: Start difference. First operand 132 states and 193 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:05:56,406 INFO L93 Difference]: Finished difference Result 182 states and 250 transitions. [2024-10-11 12:05:56,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 12:05:56,407 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-11 12:05:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:05:56,409 INFO L225 Difference]: With dead ends: 182 [2024-10-11 12:05:56,409 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 12:05:56,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2024-10-11 12:05:56,411 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 208 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:05:56,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 306 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 12:05:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 12:05:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 135. [2024-10-11 12:05:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 12:05:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 197 transitions. [2024-10-11 12:05:56,439 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 197 transitions. Word has length 98 [2024-10-11 12:05:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:05:56,439 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 197 transitions. [2024-10-11 12:05:56,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:05:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 197 transitions. [2024-10-11 12:05:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 12:05:56,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:05:56,442 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:05:56,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 12:05:56,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:05:56,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:05:56,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2062893163, now seen corresponding path program 1 times [2024-10-11 12:05:56,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:05:56,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573748609] [2024-10-11 12:05:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:05:56,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:05:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:06:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:06:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:06:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:06:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:06:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:06:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:06:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:06:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:06:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:06:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:06:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:06:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:06:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:06:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:06:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:06:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:06:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573748609] [2024-10-11 12:06:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573748609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:06:01,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:06:01,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 12:06:01,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944599218] [2024-10-11 12:06:01,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:06:01,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 12:06:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:06:01,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 12:06:01,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:06:01,212 INFO L87 Difference]: Start difference. First operand 135 states and 197 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:06:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:06:03,868 INFO L93 Difference]: Finished difference Result 199 states and 270 transitions. [2024-10-11 12:06:03,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 12:06:03,870 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-11 12:06:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:06:03,872 INFO L225 Difference]: With dead ends: 199 [2024-10-11 12:06:03,872 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 12:06:03,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2024-10-11 12:06:03,877 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 195 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 12:06:03,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 389 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 12:06:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 12:06:03,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 144. [2024-10-11 12:06:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 12:06:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-10-11 12:06:03,914 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 98 [2024-10-11 12:06:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:06:03,915 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-10-11 12:06:03,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 12:06:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-10-11 12:06:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 12:06:03,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:06:03,920 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:06:03,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 12:06:03,920 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:06:03,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:06:03,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1253546537, now seen corresponding path program 1 times [2024-10-11 12:06:03,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:06:03,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648943189] [2024-10-11 12:06:03,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:06:03,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:06:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:06:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:06:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:06:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:06:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:06:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:06:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:06:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:06:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:06:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:06:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:06:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:06:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:06:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:06:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:06:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:06:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:06:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648943189] [2024-10-11 12:06:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648943189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:06:08,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:06:08,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 12:06:08,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619370345] [2024-10-11 12:06:08,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:06:08,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 12:06:08,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:06:08,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 12:06:08,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-11 12:06:08,431 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:06:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:06:10,589 INFO L93 Difference]: Finished difference Result 193 states and 264 transitions. [2024-10-11 12:06:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 12:06:10,590 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-10-11 12:06:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:06:10,591 INFO L225 Difference]: With dead ends: 193 [2024-10-11 12:06:10,591 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 12:06:10,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=280, Invalid=650, Unknown=0, NotChecked=0, Total=930 [2024-10-11 12:06:10,593 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 187 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 12:06:10,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 395 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 12:06:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 12:06:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 144. [2024-10-11 12:06:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 12:06:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-10-11 12:06:10,618 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 98 [2024-10-11 12:06:10,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:06:10,618 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-10-11 12:06:10,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:06:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-10-11 12:06:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 12:06:10,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:06:10,620 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:06:10,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 12:06:10,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:06:10,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:06:10,621 INFO L85 PathProgramCache]: Analyzing trace with hash -30791836, now seen corresponding path program 1 times [2024-10-11 12:06:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:06:10,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934997576] [2024-10-11 12:06:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:06:10,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:06:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:06:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:06:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:06:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:06:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:06:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:06:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:06:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:06:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:06:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:06:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:06:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:06:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:06:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:06:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:06:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:06:15,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:06:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934997576] [2024-10-11 12:06:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934997576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:06:15,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:06:15,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 12:06:15,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195687946] [2024-10-11 12:06:15,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:06:15,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 12:06:15,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:06:15,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 12:06:15,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-11 12:06:15,378 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 12:06:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:06:18,555 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2024-10-11 12:06:18,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 12:06:18,556 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 99 [2024-10-11 12:06:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:06:18,557 INFO L225 Difference]: With dead ends: 182 [2024-10-11 12:06:18,557 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 12:06:18,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2024-10-11 12:06:18,559 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 236 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 12:06:18,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 337 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 12:06:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 12:06:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 141. [2024-10-11 12:06:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 12:06:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 205 transitions. [2024-10-11 12:06:18,575 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 205 transitions. Word has length 99 [2024-10-11 12:06:18,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:06:18,576 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 205 transitions. [2024-10-11 12:06:18,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 12:06:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 205 transitions. [2024-10-11 12:06:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 12:06:18,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:06:18,577 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:06:18,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 12:06:18,578 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:06:18,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:06:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1238067941, now seen corresponding path program 1 times [2024-10-11 12:06:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:06:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325230207] [2024-10-11 12:06:18,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:06:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:06:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:06:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:06:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:06:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:06:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:06:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:06:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:06:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:06:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:06:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:06:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:06:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:06:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:06:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:06:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:06:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:06:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:06:25,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:06:25,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325230207] [2024-10-11 12:06:25,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325230207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:06:25,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:06:25,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 12:06:25,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902694606] [2024-10-11 12:06:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:06:25,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 12:06:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:06:25,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 12:06:25,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-11 12:06:25,899 INFO L87 Difference]: Start difference. First operand 141 states and 205 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:06:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:06:31,222 INFO L93 Difference]: Finished difference Result 198 states and 269 transitions. [2024-10-11 12:06:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 12:06:31,223 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2024-10-11 12:06:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:06:31,224 INFO L225 Difference]: With dead ends: 198 [2024-10-11 12:06:31,225 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 12:06:31,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=304, Invalid=818, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 12:06:31,226 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 305 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 12:06:31,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 346 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 12:06:31,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 12:06:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 144. [2024-10-11 12:06:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 12:06:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-10-11 12:06:31,242 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 99 [2024-10-11 12:06:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:06:31,243 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-10-11 12:06:31,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:06:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-10-11 12:06:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 12:06:31,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:06:31,245 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:06:31,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 12:06:31,245 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:06:31,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:06:31,245 INFO L85 PathProgramCache]: Analyzing trace with hash -474854977, now seen corresponding path program 1 times [2024-10-11 12:06:31,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:06:31,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722409499] [2024-10-11 12:06:31,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:06:31,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:06:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat