./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-34.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9a63cb7f0f4bcb602d996a2f5bca04060f41dddcdd6e5c22a959463569230eb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:52:20,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:52:20,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:52:20,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:52:20,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:52:20,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:52:20,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:52:20,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:52:20,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:52:20,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:52:20,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:52:20,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:52:20,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:52:20,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:52:20,449 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:52:20,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:52:20,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:52:20,449 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:52:20,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:52:20,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:52:20,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:52:20,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:52:20,452 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:52:20,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:52:20,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:52:20,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:52:20,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:52:20,453 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:52:20,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:52:20,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:52:20,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:52:20,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:52:20,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:52:20,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:52:20,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:52:20,453 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 9a63cb7f0f4bcb602d996a2f5bca04060f41dddcdd6e5c22a959463569230eb1 [2025-01-09 11:52:20,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:52:20,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:52:20,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:52:20,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:52:20,774 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:52:20,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-34.i [2025-01-09 11:52:22,116 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ff9a980d/e6af4c3fea614a4da0b1445efe1e4b3b/FLAG081904442 [2025-01-09 11:52:22,396 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:52:22,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-34.i [2025-01-09 11:52:22,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ff9a980d/e6af4c3fea614a4da0b1445efe1e4b3b/FLAG081904442 [2025-01-09 11:52:22,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ff9a980d/e6af4c3fea614a4da0b1445efe1e4b3b [2025-01-09 11:52:22,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:52:22,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:52:22,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:52:22,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:52:22,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:52:22,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727a9924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22, skipping insertion in model container [2025-01-09 11:52:22,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:52:22,598 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-34.i[919,932] [2025-01-09 11:52:22,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:52:22,719 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:52:22,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-34.i[919,932] [2025-01-09 11:52:22,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:52:22,790 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:52:22,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22 WrapperNode [2025-01-09 11:52:22,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:52:22,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:52:22,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:52:22,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:52:22,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,869 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-01-09 11:52:22,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:52:22,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:52:22,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:52:22,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:52:22,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,919 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]. [2025-01-09 11:52:22,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:52:22,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:52:22,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:52:22,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:52:22,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (1/1) ... [2025-01-09 11:52:22,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:52:22,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:52:23,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:52:23,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:52:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:52:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:52:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:52:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:52:23,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:52:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:52:23,130 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:52:23,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:52:23,612 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 11:52:23,614 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:52:23,630 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:52:23,631 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:52:23,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:52:23 BoogieIcfgContainer [2025-01-09 11:52:23,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:52:23,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:52:23,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:52:23,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:52:23,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:52:22" (1/3) ... [2025-01-09 11:52:23,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da65f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:52:23, skipping insertion in model container [2025-01-09 11:52:23,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:52:22" (2/3) ... [2025-01-09 11:52:23,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da65f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:52:23, skipping insertion in model container [2025-01-09 11:52:23,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:52:23" (3/3) ... [2025-01-09 11:52:23,644 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-34.i [2025-01-09 11:52:23,657 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:52:23,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-34.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:52:23,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:52:23,736 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;@1e51835d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:52:23,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:52:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 11:52:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 11:52:23,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:23,757 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:52:23,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2020641536, now seen corresponding path program 1 times [2025-01-09 11:52:23,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:52:23,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545053770] [2025-01-09 11:52:23,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:52:23,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 11:52:23,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 11:52:23,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:23,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 11:52:24,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:52:24,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545053770] [2025-01-09 11:52:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545053770] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:52:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322157708] [2025-01-09 11:52:24,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:24,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:52:24,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:52:24,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:52:24,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:52:24,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 11:52:24,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 11:52:24,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:24,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:24,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:52:24,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:52:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 11:52:24,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:52:24,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322157708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:24,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:52:24,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:52:24,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677698628] [2025-01-09 11:52:24,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:24,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:52:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:52:24,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:52:24,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:52:24,493 INFO L87 Difference]: Start difference. First operand has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:52:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:24,524 INFO L93 Difference]: Finished difference Result 216 states and 380 transitions. [2025-01-09 11:52:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:52:24,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 212 [2025-01-09 11:52:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:24,535 INFO L225 Difference]: With dead ends: 216 [2025-01-09 11:52:24,537 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 11:52:24,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:52:24,543 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:24,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:52:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 11:52:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 11:52:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 11:52:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 171 transitions. [2025-01-09 11:52:24,602 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 171 transitions. Word has length 212 [2025-01-09 11:52:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:24,604 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 171 transitions. [2025-01-09 11:52:24,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:52:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 171 transitions. [2025-01-09 11:52:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 11:52:24,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:24,608 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:52:24,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:52:24,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 11:52:24,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:24,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash -754533638, now seen corresponding path program 1 times [2025-01-09 11:52:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:52:24,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083162056] [2025-01-09 11:52:24,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:52:24,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 11:52:24,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 11:52:24,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:24,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:25,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:52:25,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083162056] [2025-01-09 11:52:25,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083162056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:25,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:25,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:52:25,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511771541] [2025-01-09 11:52:25,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:25,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:52:25,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:52:25,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:52:25,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:52:25,575 INFO L87 Difference]: Start difference. First operand 108 states and 171 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:25,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:25,837 INFO L93 Difference]: Finished difference Result 348 states and 552 transitions. [2025-01-09 11:52:25,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:52:25,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-01-09 11:52:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:25,842 INFO L225 Difference]: With dead ends: 348 [2025-01-09 11:52:25,842 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 11:52:25,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:52:25,844 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 171 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:25,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 531 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:52:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 11:52:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 213. [2025-01-09 11:52:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 144 states have (on average 1.4375) internal successors, (207), 144 states have internal predecessors, (207), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 11:52:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 339 transitions. [2025-01-09 11:52:25,901 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 339 transitions. Word has length 212 [2025-01-09 11:52:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:25,902 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 339 transitions. [2025-01-09 11:52:25,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 339 transitions. [2025-01-09 11:52:25,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 11:52:25,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:25,907 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:52:25,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:52:25,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:25,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1519004105, now seen corresponding path program 1 times [2025-01-09 11:52:25,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:52:25,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272851907] [2025-01-09 11:52:25,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:25,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:52:25,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 11:52:25,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 11:52:25,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:25,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:52:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272851907] [2025-01-09 11:52:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272851907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:26,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:52:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529276710] [2025-01-09 11:52:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:26,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:52:26,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:52:26,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:52:26,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:52:26,316 INFO L87 Difference]: Start difference. First operand 213 states and 339 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:26,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:26,706 INFO L93 Difference]: Finished difference Result 628 states and 1000 transitions. [2025-01-09 11:52:26,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:52:26,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2025-01-09 11:52:26,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:26,720 INFO L225 Difference]: With dead ends: 628 [2025-01-09 11:52:26,721 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 11:52:26,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:52:26,723 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 197 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:26,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 625 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:52:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 11:52:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 217. [2025-01-09 11:52:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 148 states have (on average 1.4256756756756757) internal successors, (211), 148 states have internal predecessors, (211), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 11:52:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 343 transitions. [2025-01-09 11:52:26,780 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 343 transitions. Word has length 213 [2025-01-09 11:52:26,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:26,781 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 343 transitions. [2025-01-09 11:52:26,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 343 transitions. [2025-01-09 11:52:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:52:26,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:26,786 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:52:26,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:52:26,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:26,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:26,787 INFO L85 PathProgramCache]: Analyzing trace with hash -65824638, now seen corresponding path program 1 times [2025-01-09 11:52:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:52:26,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125216672] [2025-01-09 11:52:26,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:52:26,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:52:27,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:52:27,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:27,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:34,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:52:34,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125216672] [2025-01-09 11:52:34,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125216672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:34,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:34,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:52:34,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930730514] [2025-01-09 11:52:34,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:34,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:52:34,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:52:34,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:52:34,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:52:34,969 INFO L87 Difference]: Start difference. First operand 217 states and 343 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:37,396 INFO L93 Difference]: Finished difference Result 689 states and 1066 transitions. [2025-01-09 11:52:37,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:52:37,397 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:52:37,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:37,401 INFO L225 Difference]: With dead ends: 689 [2025-01-09 11:52:37,401 INFO L226 Difference]: Without dead ends: 475 [2025-01-09 11:52:37,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2025-01-09 11:52:37,403 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 736 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:37,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 950 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 11:52:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-01-09 11:52:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 317. [2025-01-09 11:52:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 214 states have (on average 1.411214953271028) internal successors, (302), 214 states have internal predecessors, (302), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:52:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 500 transitions. [2025-01-09 11:52:37,464 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 500 transitions. Word has length 214 [2025-01-09 11:52:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:37,465 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 500 transitions. [2025-01-09 11:52:37,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 500 transitions. [2025-01-09 11:52:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:52:37,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:37,469 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:52:37,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:52:37,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:37,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1709182724, now seen corresponding path program 1 times [2025-01-09 11:52:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:52:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486328653] [2025-01-09 11:52:37,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:52:37,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:52:37,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:52:37,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:37,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:39,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:52:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486328653] [2025-01-09 11:52:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486328653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:39,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:39,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:52:39,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697336258] [2025-01-09 11:52:39,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:39,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:52:39,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:52:39,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:52:39,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:52:39,651 INFO L87 Difference]: Start difference. First operand 317 states and 500 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:40,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:40,794 INFO L93 Difference]: Finished difference Result 722 states and 1118 transitions. [2025-01-09 11:52:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:52:40,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:52:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:40,798 INFO L225 Difference]: With dead ends: 722 [2025-01-09 11:52:40,799 INFO L226 Difference]: Without dead ends: 508 [2025-01-09 11:52:40,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:52:40,801 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 437 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:40,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 673 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:52:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-01-09 11:52:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 358. [2025-01-09 11:52:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 255 states have (on average 1.423529411764706) internal successors, (363), 255 states have internal predecessors, (363), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:52:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 561 transitions. [2025-01-09 11:52:40,851 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 561 transitions. Word has length 214 [2025-01-09 11:52:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:40,851 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 561 transitions. [2025-01-09 11:52:40,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 561 transitions. [2025-01-09 11:52:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:52:40,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:40,854 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:52:40,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:52:40,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:40,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:40,856 INFO L85 PathProgramCache]: Analyzing trace with hash 614233732, now seen corresponding path program 1 times [2025-01-09 11:52:40,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:52:40,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886229869] [2025-01-09 11:52:40,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:40,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:52:40,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:52:40,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:52:40,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:40,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:43,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:52:43,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886229869] [2025-01-09 11:52:43,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886229869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:43,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:43,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:52:43,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017775917] [2025-01-09 11:52:43,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:43,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:52:43,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:52:43,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:52:43,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:52:43,298 INFO L87 Difference]: Start difference. First operand 358 states and 561 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:44,114 INFO L93 Difference]: Finished difference Result 794 states and 1215 transitions. [2025-01-09 11:52:44,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:52:44,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:52:44,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:44,118 INFO L225 Difference]: With dead ends: 794 [2025-01-09 11:52:44,119 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 11:52:44,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:52:44,122 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 272 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:44,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 740 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:52:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 11:52:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 461. [2025-01-09 11:52:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 358 states have (on average 1.4301675977653632) internal successors, (512), 358 states have internal predecessors, (512), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:52:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 710 transitions. [2025-01-09 11:52:44,162 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 710 transitions. Word has length 214 [2025-01-09 11:52:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:44,163 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 710 transitions. [2025-01-09 11:52:44,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 710 transitions. [2025-01-09 11:52:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:52:44,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:44,165 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:52:44,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:52:44,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:44,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:44,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1335957709, now seen corresponding path program 1 times [2025-01-09 11:52:44,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:52:44,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816812477] [2025-01-09 11:52:44,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:44,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:52:44,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:52:44,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:52:44,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:44,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:45,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:52:45,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816812477] [2025-01-09 11:52:45,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816812477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:45,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:45,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:52:45,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895075008] [2025-01-09 11:52:45,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:45,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:52:45,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:52:45,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:52:45,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:52:45,179 INFO L87 Difference]: Start difference. First operand 461 states and 710 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:45,649 INFO L93 Difference]: Finished difference Result 817 states and 1250 transitions. [2025-01-09 11:52:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 11:52:45,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:52:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:45,654 INFO L225 Difference]: With dead ends: 817 [2025-01-09 11:52:45,654 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 11:52:45,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:52:45,657 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 214 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:45,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 615 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:52:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 11:52:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 463. [2025-01-09 11:52:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 360 states have (on average 1.4166666666666667) internal successors, (510), 360 states have internal predecessors, (510), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:52:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 708 transitions. [2025-01-09 11:52:45,701 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 708 transitions. Word has length 214 [2025-01-09 11:52:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:45,701 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 708 transitions. [2025-01-09 11:52:45,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 708 transitions. [2025-01-09 11:52:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:52:45,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:45,710 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:52:45,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:52:45,710 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:45,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1076941888, now seen corresponding path program 1 times [2025-01-09 11:52:45,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:52:45,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174806357] [2025-01-09 11:52:45,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:45,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:52:45,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:52:45,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:52:45,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:45,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:46,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:52:46,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174806357] [2025-01-09 11:52:46,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174806357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:46,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:46,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:52:46,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288016202] [2025-01-09 11:52:46,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:46,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:52:46,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:52:46,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:52:46,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:52:46,102 INFO L87 Difference]: Start difference. First operand 463 states and 708 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:46,407 INFO L93 Difference]: Finished difference Result 733 states and 1129 transitions. [2025-01-09 11:52:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:52:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:52:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:46,411 INFO L225 Difference]: With dead ends: 733 [2025-01-09 11:52:46,411 INFO L226 Difference]: Without dead ends: 459 [2025-01-09 11:52:46,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:52:46,414 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 123 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:46,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 440 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:52:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-01-09 11:52:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 431. [2025-01-09 11:52:46,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 328 states have (on average 1.3902439024390243) internal successors, (456), 328 states have internal predecessors, (456), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:52:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 654 transitions. [2025-01-09 11:52:46,474 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 654 transitions. Word has length 214 [2025-01-09 11:52:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:46,475 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 654 transitions. [2025-01-09 11:52:46,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 654 transitions. [2025-01-09 11:52:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 11:52:46,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:46,477 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:52:46,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:52:46,478 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:46,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1523857790, now seen corresponding path program 1 times [2025-01-09 11:52:46,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:52:46,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822019956] [2025-01-09 11:52:46,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:46,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:52:46,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 11:52:46,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 11:52:46,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:46,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:48,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:52:48,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822019956] [2025-01-09 11:52:48,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822019956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:48,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:48,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 11:52:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986626143] [2025-01-09 11:52:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:48,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 11:52:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:52:48,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 11:52:48,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:52:48,874 INFO L87 Difference]: Start difference. First operand 431 states and 654 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:50,066 INFO L93 Difference]: Finished difference Result 830 states and 1246 transitions. [2025-01-09 11:52:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:52:50,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-01-09 11:52:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:50,072 INFO L225 Difference]: With dead ends: 830 [2025-01-09 11:52:50,072 INFO L226 Difference]: Without dead ends: 616 [2025-01-09 11:52:50,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:52:50,075 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 216 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:50,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 915 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:52:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-01-09 11:52:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 447. [2025-01-09 11:52:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 342 states have (on average 1.3801169590643274) internal successors, (472), 342 states have internal predecessors, (472), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:52:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 670 transitions. [2025-01-09 11:52:50,123 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 670 transitions. Word has length 215 [2025-01-09 11:52:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:50,124 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 670 transitions. [2025-01-09 11:52:50,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 670 transitions. [2025-01-09 11:52:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 11:52:50,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:50,127 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:52:50,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:52:50,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:50,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1368824308, now seen corresponding path program 1 times [2025-01-09 11:52:50,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:52:50,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250379310] [2025-01-09 11:52:50,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:50,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:52:50,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 11:52:50,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 11:52:50,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:50,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:52:54,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250379310] [2025-01-09 11:52:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250379310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:52:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386776876] [2025-01-09 11:52:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:54,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:52:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:52:54,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:52:54,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:52:54,697 INFO L87 Difference]: Start difference. First operand 447 states and 670 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:57,005 INFO L93 Difference]: Finished difference Result 919 states and 1348 transitions. [2025-01-09 11:52:57,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:52:57,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-01-09 11:52:57,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:57,010 INFO L225 Difference]: With dead ends: 919 [2025-01-09 11:52:57,010 INFO L226 Difference]: Without dead ends: 637 [2025-01-09 11:52:57,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2025-01-09 11:52:57,012 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 277 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:57,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1208 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 11:52:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-01-09 11:52:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 484. [2025-01-09 11:52:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 379 states have (on average 1.3825857519788918) internal successors, (524), 379 states have internal predecessors, (524), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:52:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 722 transitions. [2025-01-09 11:52:57,078 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 722 transitions. Word has length 215 [2025-01-09 11:52:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:57,079 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 722 transitions. [2025-01-09 11:52:57,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 722 transitions. [2025-01-09 11:52:57,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:52:57,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:57,081 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:52:57,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:52:57,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:57,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:57,082 INFO L85 PathProgramCache]: Analyzing trace with hash 84639597, now seen corresponding path program 1 times [2025-01-09 11:52:57,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:52:57,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379043887] [2025-01-09 11:52:57,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:57,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:52:57,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:52:57,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:52:57,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:57,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:53:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:53:02,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:53:02,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379043887] [2025-01-09 11:53:02,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379043887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:53:02,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:53:02,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 11:53:02,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699295597] [2025-01-09 11:53:02,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:53:02,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 11:53:02,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:53:02,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 11:53:02,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:53:02,897 INFO L87 Difference]: Start difference. First operand 484 states and 722 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:53:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:53:07,274 INFO L93 Difference]: Finished difference Result 844 states and 1229 transitions. [2025-01-09 11:53:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 11:53:07,275 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2025-01-09 11:53:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:53:07,281 INFO L225 Difference]: With dead ends: 844 [2025-01-09 11:53:07,281 INFO L226 Difference]: Without dead ends: 614 [2025-01-09 11:53:07,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2025-01-09 11:53:07,284 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 417 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:53:07,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1043 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 11:53:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-01-09 11:53:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 474. [2025-01-09 11:53:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 369 states have (on average 1.3875338753387534) internal successors, (512), 369 states have internal predecessors, (512), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:53:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 710 transitions. [2025-01-09 11:53:07,335 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 710 transitions. Word has length 216 [2025-01-09 11:53:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:53:07,335 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 710 transitions. [2025-01-09 11:53:07,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:53:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 710 transitions. [2025-01-09 11:53:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:53:07,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:53:07,337 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:53:07,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:53:07,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:53:07,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:53:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1140195295, now seen corresponding path program 1 times [2025-01-09 11:53:07,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:53:07,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163367752] [2025-01-09 11:53:07,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:53:07,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:53:07,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:53:07,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:53:07,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:53:07,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:53:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:53:12,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:53:12,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163367752] [2025-01-09 11:53:12,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163367752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:53:12,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:53:12,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:53:12,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178279918] [2025-01-09 11:53:12,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:53:12,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:53:12,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:53:12,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:53:12,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:53:12,587 INFO L87 Difference]: Start difference. First operand 474 states and 710 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:53:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:53:18,720 INFO L93 Difference]: Finished difference Result 841 states and 1253 transitions. [2025-01-09 11:53:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:53:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2025-01-09 11:53:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:53:18,725 INFO L225 Difference]: With dead ends: 841 [2025-01-09 11:53:18,726 INFO L226 Difference]: Without dead ends: 605 [2025-01-09 11:53:18,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2025-01-09 11:53:18,728 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 432 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:53:18,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1189 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 11:53:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-01-09 11:53:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 490. [2025-01-09 11:53:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 385 states have (on average 1.387012987012987) internal successors, (534), 385 states have internal predecessors, (534), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:53:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 732 transitions. [2025-01-09 11:53:18,781 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 732 transitions. Word has length 216 [2025-01-09 11:53:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:53:18,781 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 732 transitions. [2025-01-09 11:53:18,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:53:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 732 transitions. [2025-01-09 11:53:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:53:18,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:53:18,784 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:53:18,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:53:18,784 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:53:18,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:53:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2059823009, now seen corresponding path program 1 times [2025-01-09 11:53:18,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:53:18,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774066115] [2025-01-09 11:53:18,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:53:18,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:53:18,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:53:18,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:53:18,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:53:18,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:53:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:53:21,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:53:21,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774066115] [2025-01-09 11:53:21,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774066115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:53:21,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:53:21,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 11:53:21,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932711929] [2025-01-09 11:53:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:53:21,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:53:21,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:53:21,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:53:21,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:53:21,419 INFO L87 Difference]: Start difference. First operand 490 states and 732 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:53:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:53:23,770 INFO L93 Difference]: Finished difference Result 1002 states and 1463 transitions. [2025-01-09 11:53:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 11:53:23,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2025-01-09 11:53:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:53:23,776 INFO L225 Difference]: With dead ends: 1002 [2025-01-09 11:53:23,776 INFO L226 Difference]: Without dead ends: 695 [2025-01-09 11:53:23,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-01-09 11:53:23,778 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 324 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:53:23,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1000 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 11:53:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-01-09 11:53:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 484. [2025-01-09 11:53:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 379 states have (on average 1.3799472295514512) internal successors, (523), 379 states have internal predecessors, (523), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:53:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 721 transitions. [2025-01-09 11:53:23,840 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 721 transitions. Word has length 216 [2025-01-09 11:53:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:53:23,840 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 721 transitions. [2025-01-09 11:53:23,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:53:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 721 transitions. [2025-01-09 11:53:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:53:23,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:53:23,842 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:53:23,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 11:53:23,843 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:53:23,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:53:23,843 INFO L85 PathProgramCache]: Analyzing trace with hash -460136925, now seen corresponding path program 1 times [2025-01-09 11:53:23,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:53:23,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543883546] [2025-01-09 11:53:23,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:53:23,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:53:23,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:53:23,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:53:23,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:53:23,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:53:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:53:28,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:53:28,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543883546] [2025-01-09 11:53:28,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543883546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:53:28,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:53:28,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:53:28,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184909554] [2025-01-09 11:53:28,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:53:28,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:53:28,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:53:28,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:53:28,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:53:28,736 INFO L87 Difference]: Start difference. First operand 484 states and 721 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33)