./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-86.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-86.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 23a05992f4024df2d983a8fb4ad6ac19034ad7c6bce98692b4d6369898cca580 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:59:27,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:59:27,871 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:59:27,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:59:27,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:59:27,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:59:27,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:59:27,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:59:27,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:59:27,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:59:27,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:59:27,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:59:27,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:59:27,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:59:27,905 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:59:27,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:59:27,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:59:27,906 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:59:27,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:59:27,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:59:27,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:59:27,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:59:27,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:59:27,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:59:27,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:59:27,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:59:27,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:59:27,907 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:59:27,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:59:27,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:59:27,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:59:27,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:59:27,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:59:27,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:59:27,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:59:27,908 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 -> 23a05992f4024df2d983a8fb4ad6ac19034ad7c6bce98692b4d6369898cca580 [2025-01-09 11:59:28,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:59:28,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:59:28,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:59:28,095 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:59:28,095 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:59:28,095 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-86.i [2025-01-09 11:59:29,256 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37df551a6/8f1aa12828dc4bbbb4627c076a5d6e7a/FLAG038a96227 [2025-01-09 11:59:29,516 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:59:29,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-86.i [2025-01-09 11:59:29,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37df551a6/8f1aa12828dc4bbbb4627c076a5d6e7a/FLAG038a96227 [2025-01-09 11:59:29,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37df551a6/8f1aa12828dc4bbbb4627c076a5d6e7a [2025-01-09 11:59:29,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:59:29,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:59:29,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:59:29,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:59:29,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:59:29,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87edc79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29, skipping insertion in model container [2025-01-09 11:59:29,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:59:29,651 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-86.i[919,932] [2025-01-09 11:59:29,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:59:29,722 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:59:29,731 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-86.i[919,932] [2025-01-09 11:59:29,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:59:29,778 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:59:29,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29 WrapperNode [2025-01-09 11:59:29,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:59:29,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:59:29,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:59:29,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:59:29,784 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:59:29" (1/1) ... [2025-01-09 11:59:29,791 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:59:29" (1/1) ... [2025-01-09 11:59:29,830 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-01-09 11:59:29,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:59:29,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:59:29,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:59:29,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:59:29,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,859 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:59:29,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:59:29,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:59:29,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:59:29,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:59:29,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (1/1) ... [2025-01-09 11:59:29,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:59:29,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:59:29,918 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:59:29,927 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:59:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:59:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:59:29,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:59:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:59:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:59:29,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:59:30,005 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:59:30,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:59:30,284 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 11:59:30,284 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:59:30,291 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:59:30,292 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:59:30,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:59:30 BoogieIcfgContainer [2025-01-09 11:59:30,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:59:30,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:59:30,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:59:30,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:59:30,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:59:29" (1/3) ... [2025-01-09 11:59:30,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249dc6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:59:30, skipping insertion in model container [2025-01-09 11:59:30,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:59:29" (2/3) ... [2025-01-09 11:59:30,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249dc6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:59:30, skipping insertion in model container [2025-01-09 11:59:30,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:59:30" (3/3) ... [2025-01-09 11:59:30,302 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-86.i [2025-01-09 11:59:30,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:59:30,316 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-86.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:59:30,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:59:30,371 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;@3e2a81ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:59:30,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:59:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 11:59:30,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 11:59:30,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:59:30,385 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:30,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:59:30,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:59:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1110722994, now seen corresponding path program 1 times [2025-01-09 11:59:30,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:59:30,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171985808] [2025-01-09 11:59:30,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:59:30,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:59:30,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:59:30,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:59:30,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:59:30,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:59:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 11:59:30,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:59:30,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171985808] [2025-01-09 11:59:30,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171985808] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:59:30,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005011998] [2025-01-09 11:59:30,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:59:30,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:59:30,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:59:30,706 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:59:30,708 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:59:30,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:59:30,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:59:30,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:59:30,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:59:30,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:59:30,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:59:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 11:59:30,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:59:30,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005011998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:59:30,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:59:30,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:59:30,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725762423] [2025-01-09 11:59:30,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:59:30,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:59:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:59:30,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:59:30,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:59:30,912 INFO L87 Difference]: Start difference. First operand has 103 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:59:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:59:30,937 INFO L93 Difference]: Finished difference Result 200 states and 352 transitions. [2025-01-09 11:59:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:59:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2025-01-09 11:59:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:59:30,946 INFO L225 Difference]: With dead ends: 200 [2025-01-09 11:59:30,947 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 11:59:30,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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:59:30,951 INFO L435 NwaCegarLoop]: 157 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, 157 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:59:30,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:59:30,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 11:59:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-09 11:59:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 67 states have internal predecessors, (95), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 11:59:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 157 transitions. [2025-01-09 11:59:30,980 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 157 transitions. Word has length 197 [2025-01-09 11:59:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:59:30,980 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 157 transitions. [2025-01-09 11:59:30,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:59:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 157 transitions. [2025-01-09 11:59:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 11:59:30,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:59:30,983 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:30,990 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:59:31,187 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:59:31,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:59:31,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:59:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2124818928, now seen corresponding path program 1 times [2025-01-09 11:59:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:59:31,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090543737] [2025-01-09 11:59:31,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:59:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:59:31,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:59:31,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:59:31,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:59:31,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:59:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:59:31,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:59:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090543737] [2025-01-09 11:59:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090543737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:59:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:59:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:59:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179062176] [2025-01-09 11:59:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:59:31,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:59:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:59:31,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:59:31,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:59:31,500 INFO L87 Difference]: Start difference. First operand 100 states and 157 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:59:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:59:31,530 INFO L93 Difference]: Finished difference Result 198 states and 313 transitions. [2025-01-09 11:59:31,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:59:31,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-01-09 11:59:31,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:59:31,534 INFO L225 Difference]: With dead ends: 198 [2025-01-09 11:59:31,534 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 11:59:31,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:59:31,535 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:59:31,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:59:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 11:59:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 11:59:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 11:59:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2025-01-09 11:59:31,552 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 197 [2025-01-09 11:59:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:59:31,553 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2025-01-09 11:59:31,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:59:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2025-01-09 11:59:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 11:59:31,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:59:31,554 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:31,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:59:31,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:59:31,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:59:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash 176003662, now seen corresponding path program 1 times [2025-01-09 11:59:31,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:59:31,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277452956] [2025-01-09 11:59:31,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:59:31,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:59:31,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:59:31,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:59:31,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:59:31,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:59:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:59:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:59:31,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277452956] [2025-01-09 11:59:31,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277452956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:59:31,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:59:31,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:59:31,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522354821] [2025-01-09 11:59:31,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:59:31,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:59:31,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:59:31,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:59:31,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:59:31,855 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:59:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:59:32,049 INFO L93 Difference]: Finished difference Result 298 states and 469 transitions. [2025-01-09 11:59:32,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:59:32,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-01-09 11:59:32,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:59:32,051 INFO L225 Difference]: With dead ends: 298 [2025-01-09 11:59:32,051 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 11:59:32,052 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:59:32,052 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 151 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:59:32,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 535 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:59:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 11:59:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2025-01-09 11:59:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 115 states have (on average 1.391304347826087) internal successors, (160), 115 states have internal predecessors, (160), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 11:59:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 284 transitions. [2025-01-09 11:59:32,069 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 284 transitions. Word has length 197 [2025-01-09 11:59:32,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:59:32,070 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 284 transitions. [2025-01-09 11:59:32,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:59:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 284 transitions. [2025-01-09 11:59:32,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 11:59:32,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:59:32,071 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:32,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:59:32,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:59:32,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:59:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash -835113588, now seen corresponding path program 1 times [2025-01-09 11:59:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:59:32,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149536237] [2025-01-09 11:59:32,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:59:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:59:32,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:59:32,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:59:32,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:59:32,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:59:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:59:37,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:59:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149536237] [2025-01-09 11:59:37,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149536237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:59:37,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:59:37,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:59:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69543036] [2025-01-09 11:59:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:59:37,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:59:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:59:37,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:59:37,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:59:37,565 INFO L87 Difference]: Start difference. First operand 180 states and 284 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 11:59:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:59:40,662 INFO L93 Difference]: Finished difference Result 354 states and 545 transitions. [2025-01-09 11:59:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:59:40,663 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 197 [2025-01-09 11:59:40,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:59:40,665 INFO L225 Difference]: With dead ends: 354 [2025-01-09 11:59:40,665 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 11:59:40,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-01-09 11:59:40,666 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 375 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:59:40,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1169 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:59:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 11:59:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 197. [2025-01-09 11:59:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 11:59:40,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 307 transitions. [2025-01-09 11:59:40,684 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 307 transitions. Word has length 197 [2025-01-09 11:59:40,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:59:40,684 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 307 transitions. [2025-01-09 11:59:40,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 11:59:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 307 transitions. [2025-01-09 11:59:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 11:59:40,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:59:40,686 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:40,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:59:40,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:59:40,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:59:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash -134049010, now seen corresponding path program 1 times [2025-01-09 11:59:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:59:40,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295280521] [2025-01-09 11:59:40,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:59:40,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:59:40,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 11:59:40,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 11:59:40,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:59:40,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:59:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:59:40,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:59:40,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295280521] [2025-01-09 11:59:40,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295280521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:59:40,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:59:40,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:59:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678858096] [2025-01-09 11:59:40,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:59:40,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:59:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:59:40,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:59:40,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:59:40,748 INFO L87 Difference]: Start difference. First operand 197 states and 307 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:59:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:59:40,782 INFO L93 Difference]: Finished difference Result 392 states and 615 transitions. [2025-01-09 11:59:40,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:59:40,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-01-09 11:59:40,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:59:40,784 INFO L225 Difference]: With dead ends: 392 [2025-01-09 11:59:40,784 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 11:59:40,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:59:40,785 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 149 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:59:40,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 314 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:59:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 11:59:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2025-01-09 11:59:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 195 states have (on average 1.3846153846153846) internal successors, (270), 195 states have internal predecessors, (270), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 11:59:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 456 transitions. [2025-01-09 11:59:40,821 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 456 transitions. Word has length 197 [2025-01-09 11:59:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:59:40,821 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 456 transitions. [2025-01-09 11:59:40,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:59:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 456 transitions. [2025-01-09 11:59:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 11:59:40,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:59:40,823 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:40,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:59:40,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:59:40,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:59:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash -65215525, now seen corresponding path program 1 times [2025-01-09 11:59:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:59:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807523311] [2025-01-09 11:59:40,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:59:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:59:40,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 11:59:40,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 11:59:40,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:59:40,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:59:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:59:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:59:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807523311] [2025-01-09 11:59:45,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807523311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:59:45,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:59:45,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 11:59:45,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867163334] [2025-01-09 11:59:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:59:45,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 11:59:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:59:45,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 11:59:45,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:59:45,793 INFO L87 Difference]: Start difference. First operand 292 states and 456 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:59:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:59:48,711 INFO L93 Difference]: Finished difference Result 342 states and 514 transitions. [2025-01-09 11:59:48,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:59:48,714 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-01-09 11:59:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:59:48,716 INFO L225 Difference]: With dead ends: 342 [2025-01-09 11:59:48,717 INFO L226 Difference]: Without dead ends: 340 [2025-01-09 11:59:48,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-01-09 11:59:48,719 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 450 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:59:48,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 840 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:59:48,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-01-09 11:59:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 293. [2025-01-09 11:59:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 196 states have (on average 1.3826530612244898) internal successors, (271), 196 states have internal predecessors, (271), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 11:59:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 457 transitions. [2025-01-09 11:59:48,749 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 457 transitions. Word has length 198 [2025-01-09 11:59:48,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:59:48,751 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 457 transitions. [2025-01-09 11:59:48,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:59:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 457 transitions. [2025-01-09 11:59:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 11:59:48,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:59:48,754 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:48,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:59:48,754 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:59:48,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:59:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash -277372939, now seen corresponding path program 1 times [2025-01-09 11:59:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:59:48,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988322489] [2025-01-09 11:59:48,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:59:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:59:48,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 11:59:48,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 11:59:48,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:59:48,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:59:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:59:48,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:59:48,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988322489] [2025-01-09 11:59:48,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988322489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:59:48,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:59:48,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:59:48,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917967228] [2025-01-09 11:59:48,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:59:48,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:59:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:59:48,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:59:48,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:59:48,903 INFO L87 Difference]: Start difference. First operand 293 states and 457 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:59:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:59:48,935 INFO L93 Difference]: Finished difference Result 497 states and 776 transitions. [2025-01-09 11:59:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:59:48,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-01-09 11:59:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:59:48,938 INFO L225 Difference]: With dead ends: 497 [2025-01-09 11:59:48,938 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 11:59:48,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:59:48,939 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:59:48,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 305 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:59:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 11:59:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2025-01-09 11:59:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 196 states have internal predecessors, (268), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 11:59:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 454 transitions. [2025-01-09 11:59:48,955 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 454 transitions. Word has length 198 [2025-01-09 11:59:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:59:48,955 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 454 transitions. [2025-01-09 11:59:48,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:59:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 454 transitions. [2025-01-09 11:59:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 11:59:48,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:59:48,958 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:48,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:59:48,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:59:48,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:59:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1497634423, now seen corresponding path program 1 times [2025-01-09 11:59:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:59:48,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361653332] [2025-01-09 11:59:48,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:59:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:59:48,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 11:59:49,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 11:59:49,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:59:49,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:59:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:59:51,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:59:51,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361653332] [2025-01-09 11:59:51,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361653332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:59:51,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:59:51,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:59:51,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980224014] [2025-01-09 11:59:51,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:59:51,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:59:51,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:59:51,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:59:51,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:59:51,986 INFO L87 Difference]: Start difference. First operand 293 states and 454 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:59:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:59:53,246 INFO L93 Difference]: Finished difference Result 347 states and 514 transitions. [2025-01-09 11:59:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 11:59:53,250 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2025-01-09 11:59:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:59:53,253 INFO L225 Difference]: With dead ends: 347 [2025-01-09 11:59:53,253 INFO L226 Difference]: Without dead ends: 345 [2025-01-09 11:59:53,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 11:59:53,254 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 431 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:59:53,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1234 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:59:53,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-09 11:59:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 293. [2025-01-09 11:59:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 196 states have internal predecessors, (268), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 11:59:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 454 transitions. [2025-01-09 11:59:53,280 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 454 transitions. Word has length 198 [2025-01-09 11:59:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:59:53,284 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 454 transitions. [2025-01-09 11:59:53,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:59:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 454 transitions. [2025-01-09 11:59:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 11:59:53,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:59:53,285 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:53,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:59:53,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:59:53,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:59:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1053511700, now seen corresponding path program 1 times [2025-01-09 11:59:53,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:59:53,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813073441] [2025-01-09 11:59:53,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:59:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:59:53,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 11:59:53,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 11:59:53,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:59:53,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:00:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:00:00,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:00:00,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813073441] [2025-01-09 12:00:00,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813073441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:00:00,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:00:00,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 12:00:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323342149] [2025-01-09 12:00:00,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:00:00,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:00:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:00:00,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:00:00,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:00:00,974 INFO L87 Difference]: Start difference. First operand 293 states and 454 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:00:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:00:07,221 INFO L93 Difference]: Finished difference Result 363 states and 533 transitions. [2025-01-09 12:00:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 12:00:07,221 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-01-09 12:00:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:00:07,223 INFO L225 Difference]: With dead ends: 363 [2025-01-09 12:00:07,223 INFO L226 Difference]: Without dead ends: 361 [2025-01-09 12:00:07,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2025-01-09 12:00:07,224 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 292 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:00:07,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 996 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 12:00:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-01-09 12:00:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 303. [2025-01-09 12:00:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 206 states have (on average 1.3640776699029127) internal successors, (281), 206 states have internal predecessors, (281), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 12:00:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 467 transitions. [2025-01-09 12:00:07,238 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 467 transitions. Word has length 198 [2025-01-09 12:00:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:00:07,239 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 467 transitions. [2025-01-09 12:00:07,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:00:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 467 transitions. [2025-01-09 12:00:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 12:00:07,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:00:07,240 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:07,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:00:07,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:00:07,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:00:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1733570070, now seen corresponding path program 1 times [2025-01-09 12:00:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:00:07,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78051508] [2025-01-09 12:00:07,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:00:07,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:00:07,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 12:00:07,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 12:00:07,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:00:07,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:00:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:00:13,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:00:13,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78051508] [2025-01-09 12:00:13,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78051508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:00:13,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:00:13,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:00:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797341725] [2025-01-09 12:00:13,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:00:13,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:00:13,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:00:13,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:00:13,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:00:13,440 INFO L87 Difference]: Start difference. First operand 303 states and 467 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:00:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:00:19,759 INFO L93 Difference]: Finished difference Result 357 states and 527 transitions. [2025-01-09 12:00:19,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 12:00:19,763 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-01-09 12:00:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:00:19,765 INFO L225 Difference]: With dead ends: 357 [2025-01-09 12:00:19,765 INFO L226 Difference]: Without dead ends: 355 [2025-01-09 12:00:19,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-01-09 12:00:19,766 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 288 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:00:19,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 981 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 12:00:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-09 12:00:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 303. [2025-01-09 12:00:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 206 states have (on average 1.3640776699029127) internal successors, (281), 206 states have internal predecessors, (281), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 12:00:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 467 transitions. [2025-01-09 12:00:19,797 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 467 transitions. Word has length 198 [2025-01-09 12:00:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:00:19,797 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 467 transitions. [2025-01-09 12:00:19,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:00:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 467 transitions. [2025-01-09 12:00:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 12:00:19,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:00:19,798 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:19,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:00:19,798 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:00:19,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:00:19,800 INFO L85 PathProgramCache]: Analyzing trace with hash -764471216, now seen corresponding path program 1 times [2025-01-09 12:00:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:00:19,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397494558] [2025-01-09 12:00:19,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:00:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:00:19,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 12:00:19,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 12:00:19,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:00:19,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:00:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:00:24,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:00:24,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397494558] [2025-01-09 12:00:24,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397494558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:00:24,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:00:24,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 12:00:24,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972100258] [2025-01-09 12:00:24,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:00:24,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 12:00:24,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:00:24,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 12:00:24,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:00:24,186 INFO L87 Difference]: Start difference. First operand 303 states and 467 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:00:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:00:27,843 INFO L93 Difference]: Finished difference Result 345 states and 513 transitions. [2025-01-09 12:00:27,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 12:00:27,844 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2025-01-09 12:00:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:00:27,846 INFO L225 Difference]: With dead ends: 345 [2025-01-09 12:00:27,846 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 12:00:27,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2025-01-09 12:00:27,847 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 308 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:00:27,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1377 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 12:00:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 12:00:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2025-01-09 12:00:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 203 states have (on average 1.3645320197044335) internal successors, (277), 203 states have internal predecessors, (277), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 12:00:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 463 transitions. [2025-01-09 12:00:27,865 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 463 transitions. Word has length 199 [2025-01-09 12:00:27,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:00:27,865 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 463 transitions. [2025-01-09 12:00:27,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:00:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 463 transitions. [2025-01-09 12:00:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 12:00:27,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:00:27,867 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:27,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:00:27,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:00:27,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:00:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1645526699, now seen corresponding path program 1 times [2025-01-09 12:00:27,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:00:27,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648647156] [2025-01-09 12:00:27,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:00:27,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:00:27,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 12:00:27,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 12:00:27,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:00:27,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:00:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:00:31,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:00:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648647156] [2025-01-09 12:00:31,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648647156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:00:31,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:00:31,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:00:31,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709517435] [2025-01-09 12:00:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:00:31,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:00:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:00:31,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:00:31,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:00:31,210 INFO L87 Difference]: Start difference. First operand 300 states and 463 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:00:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:00:33,201 INFO L93 Difference]: Finished difference Result 358 states and 528 transitions. [2025-01-09 12:00:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 12:00:33,201 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-01-09 12:00:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:00:33,208 INFO L225 Difference]: With dead ends: 358 [2025-01-09 12:00:33,208 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 12:00:33,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=293, Invalid=763, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 12:00:33,209 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 391 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:00:33,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 968 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:00:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 12:00:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 305. [2025-01-09 12:00:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 208 states have (on average 1.3653846153846154) internal successors, (284), 208 states have internal predecessors, (284), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 12:00:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 470 transitions. [2025-01-09 12:00:33,228 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 470 transitions. Word has length 199 [2025-01-09 12:00:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:00:33,229 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 470 transitions. [2025-01-09 12:00:33,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:00:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 470 transitions. [2025-01-09 12:00:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 12:00:33,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:00:33,230 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:33,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:00:33,230 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:00:33,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:00:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash -84523793, now seen corresponding path program 1 times [2025-01-09 12:00:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:00:33,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682063426] [2025-01-09 12:00:33,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:00:33,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:00:33,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 12:00:33,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 12:00:33,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:00:33,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:00:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:00:36,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:00:36,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682063426] [2025-01-09 12:00:36,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682063426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:00:36,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:00:36,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:00:36,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128376520] [2025-01-09 12:00:36,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:00:36,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:00:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:00:36,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:00:36,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:00:36,215 INFO L87 Difference]: Start difference. First operand 305 states and 470 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:00:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:00:38,369 INFO L93 Difference]: Finished difference Result 358 states and 528 transitions. [2025-01-09 12:00:38,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 12:00:38,370 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-01-09 12:00:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:00:38,372 INFO L225 Difference]: With dead ends: 358 [2025-01-09 12:00:38,372 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 12:00:38,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 12:00:38,373 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 369 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:00:38,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 972 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:00:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 12:00:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 306. [2025-01-09 12:00:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 209 states have (on average 1.3636363636363635) internal successors, (285), 209 states have internal predecessors, (285), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 12:00:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 471 transitions. [2025-01-09 12:00:38,393 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 471 transitions. Word has length 199 [2025-01-09 12:00:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:00:38,393 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 471 transitions. [2025-01-09 12:00:38,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:00:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 471 transitions. [2025-01-09 12:00:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 12:00:38,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:00:38,395 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:38,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:00:38,395 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:00:38,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:00:38,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2038553709, now seen corresponding path program 1 times [2025-01-09 12:00:38,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:00:38,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61126301] [2025-01-09 12:00:38,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:00:38,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:00:38,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 12:00:38,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 12:00:38,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:00:38,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:00:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:00:47,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:00:47,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61126301] [2025-01-09 12:00:47,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61126301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:00:47,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:00:47,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 12:00:47,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078249163] [2025-01-09 12:00:47,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:00:47,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 12:00:47,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:00:47,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 12:00:47,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:00:47,276 INFO L87 Difference]: Start difference. First operand 306 states and 471 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:00:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:00:56,718 INFO L93 Difference]: Finished difference Result 354 states and 524 transitions. [2025-01-09 12:00:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 12:00:56,719 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-01-09 12:00:56,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:00:56,721 INFO L225 Difference]: With dead ends: 354 [2025-01-09 12:00:56,721 INFO L226 Difference]: Without dead ends: 352 [2025-01-09 12:00:56,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 12:00:56,722 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 331 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:00:56,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1014 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 12:00:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-01-09 12:00:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 306. [2025-01-09 12:00:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 209 states have (on average 1.3636363636363635) internal successors, (285), 209 states have internal predecessors, (285), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 12:00:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 471 transitions. [2025-01-09 12:00:56,760 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 471 transitions. Word has length 199 [2025-01-09 12:00:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:00:56,760 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 471 transitions. [2025-01-09 12:00:56,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:00:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 471 transitions. [2025-01-09 12:00:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 12:00:56,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:00:56,761 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:56,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:00:56,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:00:56,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:00:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash -477550803, now seen corresponding path program 1 times [2025-01-09 12:00:56,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:00:56,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279789622] [2025-01-09 12:00:56,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:00:56,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:00:56,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 12:00:56,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 12:00:56,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:00:56,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:01:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:01:01,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:01:01,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279789622] [2025-01-09 12:01:01,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279789622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:01:01,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:01:01,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 12:01:01,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127228774] [2025-01-09 12:01:01,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:01:01,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 12:01:01,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:01:01,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 12:01:01,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:01:01,968 INFO L87 Difference]: Start difference. First operand 306 states and 471 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)