./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-37.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_fillercodesize_ps-cn-250_file-37.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 052da38d274e6772c0686e0d038b1089daccc0c5031079a7bc233069a41972fa --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:42:06,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:42:06,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:42:06,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:42:06,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:42:06,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:42:06,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:42:06,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:42:06,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:42:06,658 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:42:06,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:42:06,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:42:06,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:42:06,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:42:06,659 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:42:06,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:42:06,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:42:06,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:42:06,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:42:06,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:42:06,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:42:06,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:42:06,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:42:06,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:42:06,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:42:06,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:42:06,660 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:42:06,660 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:42:06,660 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:42:06,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:42:06,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:42:06,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:42:06,661 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 -> 052da38d274e6772c0686e0d038b1089daccc0c5031079a7bc233069a41972fa [2025-01-09 09:42:06,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:42:06,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:42:06,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:42:06,885 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:42:06,886 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:42:06,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-37.i [2025-01-09 09:42:08,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b18435d4d/3d401de7da8043a9b63effa608c88ff3/FLAGa129d3e77 [2025-01-09 09:42:08,337 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:42:08,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-37.i [2025-01-09 09:42:08,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b18435d4d/3d401de7da8043a9b63effa608c88ff3/FLAGa129d3e77 [2025-01-09 09:42:08,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b18435d4d/3d401de7da8043a9b63effa608c88ff3 [2025-01-09 09:42:08,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:42:08,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:42:08,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:42:08,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:42:08,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:42:08,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08, skipping insertion in model container [2025-01-09 09:42:08,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:42:08,582 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_fillercodesize_ps-cn-250_file-37.i[916,929] [2025-01-09 09:42:08,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:42:08,737 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:42:08,748 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_fillercodesize_ps-cn-250_file-37.i[916,929] [2025-01-09 09:42:08,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:42:08,805 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:42:08,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08 WrapperNode [2025-01-09 09:42:08,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:42:08,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:42:08,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:42:08,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:42:08,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,873 INFO L138 Inliner]: procedures = 26, calls = 108, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 594 [2025-01-09 09:42:08,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:42:08,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:42:08,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:42:08,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:42:08,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,937 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 09:42:08,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:08,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:09,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:42:09,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:42:09,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:42:09,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:42:09,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (1/1) ... [2025-01-09 09:42:09,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:42:09,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:09,033 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 09:42:09,035 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 09:42:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:42:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:42:09,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:42:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:42:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:42:09,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:42:09,155 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:42:09,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:42:09,954 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:42:09,954 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:42:09,989 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:42:09,992 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:42:09,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:42:09 BoogieIcfgContainer [2025-01-09 09:42:09,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:42:09,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:42:09,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:42:09,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:42:09,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:42:08" (1/3) ... [2025-01-09 09:42:09,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5556e07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:42:09, skipping insertion in model container [2025-01-09 09:42:09,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:08" (2/3) ... [2025-01-09 09:42:09,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5556e07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:42:09, skipping insertion in model container [2025-01-09 09:42:09,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:42:09" (3/3) ... [2025-01-09 09:42:10,001 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-37.i [2025-01-09 09:42:10,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:42:10,016 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-37.i that has 2 procedures, 252 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:42:10,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:42:10,088 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;@7e7c77be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:42:10,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:42:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 252 states, 154 states have (on average 1.5) internal successors, (231), 155 states have internal predecessors, (231), 95 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 09:42:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-01-09 09:42:10,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:10,120 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:10,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:10,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1837971531, now seen corresponding path program 1 times [2025-01-09 09:42:10,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:10,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440297080] [2025-01-09 09:42:10,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:10,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:10,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 09:42:10,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 09:42:10,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:10,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 17672 trivial. 0 not checked. [2025-01-09 09:42:10,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:10,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440297080] [2025-01-09 09:42:10,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440297080] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:42:10,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234181207] [2025-01-09 09:42:10,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:10,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:10,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:10,651 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 09:42:10,652 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 09:42:10,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 09:42:10,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 09:42:10,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:10,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:10,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:42:10,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:42:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 17672 trivial. 0 not checked. [2025-01-09 09:42:11,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:42:11,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234181207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:11,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:42:11,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:42:11,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68564702] [2025-01-09 09:42:11,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:11,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:42:11,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:11,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:42:11,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:42:11,090 INFO L87 Difference]: Start difference. First operand has 252 states, 154 states have (on average 1.5) internal successors, (231), 155 states have internal predecessors, (231), 95 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) Second operand has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 2 states have call successors, (95) [2025-01-09 09:42:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:11,139 INFO L93 Difference]: Finished difference Result 498 states and 932 transitions. [2025-01-09 09:42:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:42:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 2 states have call successors, (95) Word has length 584 [2025-01-09 09:42:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:11,149 INFO L225 Difference]: With dead ends: 498 [2025-01-09 09:42:11,150 INFO L226 Difference]: Without dead ends: 249 [2025-01-09 09:42:11,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 585 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 09:42:11,159 INFO L435 NwaCegarLoop]: 413 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, 413 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 09:42:11,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:42:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-09 09:42:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-01-09 09:42:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 152 states have internal predecessors, (223), 95 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 09:42:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 413 transitions. [2025-01-09 09:42:11,230 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 413 transitions. Word has length 584 [2025-01-09 09:42:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:11,232 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 413 transitions. [2025-01-09 09:42:11,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 2 states have call successors, (95) [2025-01-09 09:42:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 413 transitions. [2025-01-09 09:42:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-01-09 09:42:11,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:11,244 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:11,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:42:11,449 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 09:42:11,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:11,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:11,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1915810313, now seen corresponding path program 1 times [2025-01-09 09:42:11,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:11,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72389798] [2025-01-09 09:42:11,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:11,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:11,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 09:42:11,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 09:42:11,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:11,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:12,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:12,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72389798] [2025-01-09 09:42:12,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72389798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:12,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:12,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:42:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995774552] [2025-01-09 09:42:12,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:12,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:42:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:12,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:42:12,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:42:12,064 INFO L87 Difference]: Start difference. First operand 249 states and 413 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:12,156 INFO L93 Difference]: Finished difference Result 623 states and 1038 transitions. [2025-01-09 09:42:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:42:12,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 584 [2025-01-09 09:42:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:12,165 INFO L225 Difference]: With dead ends: 623 [2025-01-09 09:42:12,165 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 09:42:12,167 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 09:42:12,167 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 215 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:12,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 800 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:42:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 09:42:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2025-01-09 09:42:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 256 states have (on average 1.54296875) internal successors, (395), 257 states have internal predecessors, (395), 115 states have call successors, (115), 2 states have call predecessors, (115), 2 states have return successors, (115), 114 states have call predecessors, (115), 115 states have call successors, (115) [2025-01-09 09:42:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 625 transitions. [2025-01-09 09:42:12,227 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 625 transitions. Word has length 584 [2025-01-09 09:42:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:12,229 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 625 transitions. [2025-01-09 09:42:12,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 625 transitions. [2025-01-09 09:42:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-01-09 09:42:12,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:12,241 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:12,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:42:12,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:12,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:12,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1898076725, now seen corresponding path program 1 times [2025-01-09 09:42:12,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:12,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123054941] [2025-01-09 09:42:12,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:12,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:12,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 09:42:12,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 09:42:12,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:12,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123054941] [2025-01-09 09:42:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123054941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:42:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178963388] [2025-01-09 09:42:12,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:12,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:42:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:12,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:42:12,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:42:12,692 INFO L87 Difference]: Start difference. First operand 374 states and 625 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:12,756 INFO L93 Difference]: Finished difference Result 976 states and 1631 transitions. [2025-01-09 09:42:12,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:42:12,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 584 [2025-01-09 09:42:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:12,767 INFO L225 Difference]: With dead ends: 976 [2025-01-09 09:42:12,769 INFO L226 Difference]: Without dead ends: 605 [2025-01-09 09:42:12,770 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 09:42:12,771 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 212 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:12,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 975 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:42:12,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-01-09 09:42:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 602. [2025-01-09 09:42:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 422 states have (on average 1.54739336492891) internal successors, (653), 425 states have internal predecessors, (653), 175 states have call successors, (175), 4 states have call predecessors, (175), 4 states have return successors, (175), 172 states have call predecessors, (175), 175 states have call successors, (175) [2025-01-09 09:42:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1003 transitions. [2025-01-09 09:42:12,832 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1003 transitions. Word has length 584 [2025-01-09 09:42:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:12,833 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 1003 transitions. [2025-01-09 09:42:12,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1003 transitions. [2025-01-09 09:42:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-01-09 09:42:12,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:12,844 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:12,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:42:12,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:12,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1025083273, now seen corresponding path program 1 times [2025-01-09 09:42:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:12,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69591543] [2025-01-09 09:42:12,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:12,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 09:42:12,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 09:42:12,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:12,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:13,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:13,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69591543] [2025-01-09 09:42:13,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69591543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:13,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:13,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:42:13,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746899237] [2025-01-09 09:42:13,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:13,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:42:13,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:13,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:42:13,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:42:13,081 INFO L87 Difference]: Start difference. First operand 602 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:13,171 INFO L93 Difference]: Finished difference Result 1630 states and 2709 transitions. [2025-01-09 09:42:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:42:13,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 584 [2025-01-09 09:42:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:13,180 INFO L225 Difference]: With dead ends: 1630 [2025-01-09 09:42:13,180 INFO L226 Difference]: Without dead ends: 1031 [2025-01-09 09:42:13,182 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 09:42:13,183 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 196 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:13,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 809 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:42:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-01-09 09:42:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1028. [2025-01-09 09:42:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 720 states have (on average 1.5347222222222223) internal successors, (1105), 727 states have internal predecessors, (1105), 299 states have call successors, (299), 8 states have call predecessors, (299), 8 states have return successors, (299), 292 states have call predecessors, (299), 299 states have call successors, (299) [2025-01-09 09:42:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1703 transitions. [2025-01-09 09:42:13,254 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1703 transitions. Word has length 584 [2025-01-09 09:42:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:13,255 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1703 transitions. [2025-01-09 09:42:13,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1703 transitions. [2025-01-09 09:42:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-01-09 09:42:13,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:13,262 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:13,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:42:13,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:13,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:13,263 INFO L85 PathProgramCache]: Analyzing trace with hash -969061433, now seen corresponding path program 1 times [2025-01-09 09:42:13,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:13,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178386729] [2025-01-09 09:42:13,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:13,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:13,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 09:42:13,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 09:42:13,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:13,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178386729] [2025-01-09 09:42:13,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178386729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:13,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:13,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:42:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096410135] [2025-01-09 09:42:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:13,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:42:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:13,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:42:13,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:42:13,484 INFO L87 Difference]: Start difference. First operand 1028 states and 1703 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:13,549 INFO L93 Difference]: Finished difference Result 2065 states and 3412 transitions. [2025-01-09 09:42:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:42:13,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 584 [2025-01-09 09:42:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:13,558 INFO L225 Difference]: With dead ends: 2065 [2025-01-09 09:42:13,558 INFO L226 Difference]: Without dead ends: 1040 [2025-01-09 09:42:13,561 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 09:42:13,562 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 194 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:13,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 823 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:42:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-01-09 09:42:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 740. [2025-01-09 09:42:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 554 states have (on average 1.5830324909747293) internal successors, (877), 557 states have internal predecessors, (877), 179 states have call successors, (179), 6 states have call predecessors, (179), 6 states have return successors, (179), 176 states have call predecessors, (179), 179 states have call successors, (179) [2025-01-09 09:42:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1235 transitions. [2025-01-09 09:42:13,614 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1235 transitions. Word has length 584 [2025-01-09 09:42:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:13,615 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1235 transitions. [2025-01-09 09:42:13,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1235 transitions. [2025-01-09 09:42:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-01-09 09:42:13,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:13,637 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:13,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:42:13,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:13,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1990129787, now seen corresponding path program 1 times [2025-01-09 09:42:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:13,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099833255] [2025-01-09 09:42:13,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:13,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:13,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 09:42:13,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 09:42:13,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:13,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:14,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099833255] [2025-01-09 09:42:14,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099833255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:14,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:42:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117727639] [2025-01-09 09:42:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:14,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:42:14,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:14,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:42:14,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:42:14,465 INFO L87 Difference]: Start difference. First operand 740 states and 1235 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:17,662 INFO L93 Difference]: Finished difference Result 6551 states and 10961 transitions. [2025-01-09 09:42:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 09:42:17,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 584 [2025-01-09 09:42:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:17,692 INFO L225 Difference]: With dead ends: 6551 [2025-01-09 09:42:17,692 INFO L226 Difference]: Without dead ends: 5814 [2025-01-09 09:42:17,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2025-01-09 09:42:17,697 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 2454 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2454 SdHoareTripleChecker+Valid, 3110 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:17,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2454 Valid, 3110 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 09:42:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5814 states. [2025-01-09 09:42:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5814 to 5772. [2025-01-09 09:42:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5772 states, 4522 states have (on average 1.6074745687748784) internal successors, (7269), 4555 states have internal predecessors, (7269), 1197 states have call successors, (1197), 52 states have call predecessors, (1197), 52 states have return successors, (1197), 1164 states have call predecessors, (1197), 1197 states have call successors, (1197) [2025-01-09 09:42:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5772 states to 5772 states and 9663 transitions. [2025-01-09 09:42:17,993 INFO L78 Accepts]: Start accepts. Automaton has 5772 states and 9663 transitions. Word has length 584 [2025-01-09 09:42:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:17,994 INFO L471 AbstractCegarLoop]: Abstraction has 5772 states and 9663 transitions. [2025-01-09 09:42:17,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 5772 states and 9663 transitions. [2025-01-09 09:42:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-01-09 09:42:18,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:18,001 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:18,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:42:18,001 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:18,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:18,002 INFO L85 PathProgramCache]: Analyzing trace with hash 255449667, now seen corresponding path program 1 times [2025-01-09 09:42:18,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:18,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028674260] [2025-01-09 09:42:18,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:18,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:18,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 09:42:18,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 09:42:18,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:18,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:18,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028674260] [2025-01-09 09:42:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028674260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:18,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:18,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:42:18,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930859667] [2025-01-09 09:42:18,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:18,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:42:18,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:18,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:42:18,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:42:18,526 INFO L87 Difference]: Start difference. First operand 5772 states and 9663 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:19,870 INFO L93 Difference]: Finished difference Result 12932 states and 21637 transitions. [2025-01-09 09:42:19,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:42:19,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 584 [2025-01-09 09:42:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:19,907 INFO L225 Difference]: With dead ends: 12932 [2025-01-09 09:42:19,907 INFO L226 Difference]: Without dead ends: 7163 [2025-01-09 09:42:19,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:42:19,923 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 1050 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:19,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1856 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 09:42:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7163 states. [2025-01-09 09:42:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7163 to 7147. [2025-01-09 09:42:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7147 states, 5579 states have (on average 1.6033339308119734) internal successors, (8945), 5620 states have internal predecessors, (8945), 1502 states have call successors, (1502), 65 states have call predecessors, (1502), 65 states have return successors, (1502), 1461 states have call predecessors, (1502), 1502 states have call successors, (1502) [2025-01-09 09:42:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7147 states to 7147 states and 11949 transitions. [2025-01-09 09:42:20,426 INFO L78 Accepts]: Start accepts. Automaton has 7147 states and 11949 transitions. Word has length 584 [2025-01-09 09:42:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:20,430 INFO L471 AbstractCegarLoop]: Abstraction has 7147 states and 11949 transitions. [2025-01-09 09:42:20,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 7147 states and 11949 transitions. [2025-01-09 09:42:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-01-09 09:42:20,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:20,444 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:20,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:42:20,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:20,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash -61857085, now seen corresponding path program 1 times [2025-01-09 09:42:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:20,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735479584] [2025-01-09 09:42:20,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:20,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:20,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 09:42:20,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 09:42:20,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:20,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735479584] [2025-01-09 09:42:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735479584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:42:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080617803] [2025-01-09 09:42:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:21,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:42:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:21,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:42:21,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:42:21,018 INFO L87 Difference]: Start difference. First operand 7147 states and 11949 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:22,979 INFO L93 Difference]: Finished difference Result 22937 states and 38422 transitions. [2025-01-09 09:42:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:42:22,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 584 [2025-01-09 09:42:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:23,073 INFO L225 Difference]: With dead ends: 22937 [2025-01-09 09:42:23,074 INFO L226 Difference]: Without dead ends: 15859 [2025-01-09 09:42:23,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:42:23,101 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 1151 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:23,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 2515 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 09:42:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15859 states. [2025-01-09 09:42:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15859 to 9506. [2025-01-09 09:42:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9506 states, 7478 states have (on average 1.6095212623696176) internal successors, (12036), 7535 states have internal predecessors, (12036), 1944 states have call successors, (1944), 83 states have call predecessors, (1944), 83 states have return successors, (1944), 1887 states have call predecessors, (1944), 1944 states have call successors, (1944) [2025-01-09 09:42:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9506 states to 9506 states and 15924 transitions. [2025-01-09 09:42:23,697 INFO L78 Accepts]: Start accepts. Automaton has 9506 states and 15924 transitions. Word has length 584 [2025-01-09 09:42:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:23,698 INFO L471 AbstractCegarLoop]: Abstraction has 9506 states and 15924 transitions. [2025-01-09 09:42:23,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 9506 states and 15924 transitions. [2025-01-09 09:42:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-01-09 09:42:23,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:23,707 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:23,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:42:23,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:23,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2111244927, now seen corresponding path program 1 times [2025-01-09 09:42:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:23,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963756386] [2025-01-09 09:42:23,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:23,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-01-09 09:42:23,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-01-09 09:42:23,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:23,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:23,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:23,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963756386] [2025-01-09 09:42:23,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963756386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:23,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:23,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:42:23,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587684624] [2025-01-09 09:42:23,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:24,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:42:24,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:24,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:42:24,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:42:24,001 INFO L87 Difference]: Start difference. First operand 9506 states and 15924 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:24,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:24,500 INFO L93 Difference]: Finished difference Result 18961 states and 31781 transitions. [2025-01-09 09:42:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:42:24,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 584 [2025-01-09 09:42:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:24,539 INFO L225 Difference]: With dead ends: 18961 [2025-01-09 09:42:24,539 INFO L226 Difference]: Without dead ends: 9524 [2025-01-09 09:42:24,564 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 09:42:24,565 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 223 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:24,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1032 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:42:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9524 states. [2025-01-09 09:42:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9524 to 6996. [2025-01-09 09:42:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6996 states, 5498 states have (on average 1.6065842124408876) internal successors, (8833), 5540 states have internal predecessors, (8833), 1435 states have call successors, (1435), 62 states have call predecessors, (1435), 62 states have return successors, (1435), 1393 states have call predecessors, (1435), 1435 states have call successors, (1435) [2025-01-09 09:42:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 11703 transitions. [2025-01-09 09:42:24,964 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 11703 transitions. Word has length 584 [2025-01-09 09:42:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:24,965 INFO L471 AbstractCegarLoop]: Abstraction has 6996 states and 11703 transitions. [2025-01-09 09:42:24,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 11703 transitions. [2025-01-09 09:42:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-01-09 09:42:24,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:24,972 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:24,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:42:24,972 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:24,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:24,973 INFO L85 PathProgramCache]: Analyzing trace with hash -844114554, now seen corresponding path program 1 times [2025-01-09 09:42:24,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:24,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420466196] [2025-01-09 09:42:24,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:24,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:24,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-01-09 09:42:25,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-01-09 09:42:25,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:25,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:25,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:25,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420466196] [2025-01-09 09:42:25,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420466196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:25,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:25,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:42:25,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141418832] [2025-01-09 09:42:25,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:25,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:42:25,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:25,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:42:25,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:42:25,161 INFO L87 Difference]: Start difference. First operand 6996 states and 11703 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:25,679 INFO L93 Difference]: Finished difference Result 19197 states and 32325 transitions. [2025-01-09 09:42:25,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:42:25,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 585 [2025-01-09 09:42:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:25,723 INFO L225 Difference]: With dead ends: 19197 [2025-01-09 09:42:25,723 INFO L226 Difference]: Without dead ends: 12254 [2025-01-09 09:42:25,742 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 09:42:25,744 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 359 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:25,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 815 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:42:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2025-01-09 09:42:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 12252. [2025-01-09 09:42:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12252 states, 9928 states have (on average 1.6341659951651895) internal successors, (16224), 9989 states have internal predecessors, (16224), 2226 states have call successors, (2226), 97 states have call predecessors, (2226), 97 states have return successors, (2226), 2165 states have call predecessors, (2226), 2226 states have call successors, (2226) [2025-01-09 09:42:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12252 states to 12252 states and 20676 transitions. [2025-01-09 09:42:26,520 INFO L78 Accepts]: Start accepts. Automaton has 12252 states and 20676 transitions. Word has length 585 [2025-01-09 09:42:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:26,521 INFO L471 AbstractCegarLoop]: Abstraction has 12252 states and 20676 transitions. [2025-01-09 09:42:26,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 12252 states and 20676 transitions. [2025-01-09 09:42:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-01-09 09:42:26,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:26,532 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:26,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:42:26,532 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:26,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:26,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1855231804, now seen corresponding path program 1 times [2025-01-09 09:42:26,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:26,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832430199] [2025-01-09 09:42:26,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:26,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:26,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-01-09 09:42:26,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-01-09 09:42:26,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:26,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:26,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:26,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832430199] [2025-01-09 09:42:26,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832430199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:26,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:26,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:42:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589668220] [2025-01-09 09:42:26,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:26,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:42:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:26,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:42:26,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:42:26,947 INFO L87 Difference]: Start difference. First operand 12252 states and 20676 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:27,759 INFO L93 Difference]: Finished difference Result 16801 states and 28312 transitions. [2025-01-09 09:42:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:42:27,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 585 [2025-01-09 09:42:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:27,799 INFO L225 Difference]: With dead ends: 16801 [2025-01-09 09:42:27,799 INFO L226 Difference]: Without dead ends: 11105 [2025-01-09 09:42:27,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:42:27,816 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 799 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:27,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2233 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:42:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11105 states. [2025-01-09 09:42:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11105 to 11016. [2025-01-09 09:42:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11016 states, 8963 states have (on average 1.6328238313064822) internal successors, (14635), 9020 states have internal predecessors, (14635), 1956 states have call successors, (1956), 96 states have call predecessors, (1956), 96 states have return successors, (1956), 1899 states have call predecessors, (1956), 1956 states have call successors, (1956) [2025-01-09 09:42:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11016 states to 11016 states and 18547 transitions. [2025-01-09 09:42:28,218 INFO L78 Accepts]: Start accepts. Automaton has 11016 states and 18547 transitions. Word has length 585 [2025-01-09 09:42:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:28,219 INFO L471 AbstractCegarLoop]: Abstraction has 11016 states and 18547 transitions. [2025-01-09 09:42:28,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 11016 states and 18547 transitions. [2025-01-09 09:42:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-01-09 09:42:28,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:28,226 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:28,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:42:28,228 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:28,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:28,228 INFO L85 PathProgramCache]: Analyzing trace with hash -961745466, now seen corresponding path program 1 times [2025-01-09 09:42:28,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:28,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529693848] [2025-01-09 09:42:28,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:28,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:28,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-01-09 09:42:28,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-01-09 09:42:28,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:28,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:28,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529693848] [2025-01-09 09:42:28,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529693848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:28,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:28,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:42:28,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669923570] [2025-01-09 09:42:28,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:28,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:42:28,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:28,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:42:28,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:42:28,488 INFO L87 Difference]: Start difference. First operand 11016 states and 18547 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:28,700 INFO L93 Difference]: Finished difference Result 17720 states and 29870 transitions. [2025-01-09 09:42:28,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:42:28,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 585 [2025-01-09 09:42:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:28,728 INFO L225 Difference]: With dead ends: 17720 [2025-01-09 09:42:28,729 INFO L226 Difference]: Without dead ends: 6757 [2025-01-09 09:42:28,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 09:42:28,749 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 203 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:28,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 763 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:42:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2025-01-09 09:42:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 6746. [2025-01-09 09:42:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6746 states, 5446 states have (on average 1.6316562614763128) internal successors, (8886), 5479 states have internal predecessors, (8886), 1248 states have call successors, (1248), 51 states have call predecessors, (1248), 51 states have return successors, (1248), 1215 states have call predecessors, (1248), 1248 states have call successors, (1248) [2025-01-09 09:42:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 11382 transitions. [2025-01-09 09:42:28,983 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 11382 transitions. Word has length 585 [2025-01-09 09:42:28,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:28,984 INFO L471 AbstractCegarLoop]: Abstraction has 6746 states and 11382 transitions. [2025-01-09 09:42:28,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 11382 transitions. [2025-01-09 09:42:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-01-09 09:42:28,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:28,989 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:28,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:42:28,990 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:28,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:28,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2086647110, now seen corresponding path program 1 times [2025-01-09 09:42:28,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:28,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500105778] [2025-01-09 09:42:28,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:28,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:29,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-01-09 09:42:29,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-01-09 09:42:29,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:29,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:29,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:29,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500105778] [2025-01-09 09:42:29,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500105778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:29,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:29,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:42:29,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476839767] [2025-01-09 09:42:29,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:29,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:42:29,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:29,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:42:29,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:42:29,209 INFO L87 Difference]: Start difference. First operand 6746 states and 11382 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:29,669 INFO L93 Difference]: Finished difference Result 15566 states and 26312 transitions. [2025-01-09 09:42:29,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:42:29,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 585 [2025-01-09 09:42:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:29,697 INFO L225 Difference]: With dead ends: 15566 [2025-01-09 09:42:29,697 INFO L226 Difference]: Without dead ends: 8889 [2025-01-09 09:42:29,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 09:42:29,706 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 257 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:29,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1534 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:42:29,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8889 states. [2025-01-09 09:42:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8889 to 8883. [2025-01-09 09:42:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8883 states, 7217 states have (on average 1.630178744630733) internal successors, (11765), 7262 states have internal predecessors, (11765), 1598 states have call successors, (1598), 67 states have call predecessors, (1598), 67 states have return successors, (1598), 1553 states have call predecessors, (1598), 1598 states have call successors, (1598) [2025-01-09 09:42:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 14961 transitions. [2025-01-09 09:42:30,003 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 14961 transitions. Word has length 585 [2025-01-09 09:42:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:30,004 INFO L471 AbstractCegarLoop]: Abstraction has 8883 states and 14961 transitions. [2025-01-09 09:42:30,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 14961 transitions. [2025-01-09 09:42:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-01-09 09:42:30,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:30,011 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:30,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:42:30,011 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:30,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:30,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1314833848, now seen corresponding path program 1 times [2025-01-09 09:42:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:30,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171517823] [2025-01-09 09:42:30,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:30,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:30,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-01-09 09:42:30,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-01-09 09:42:30,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:30,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 09:42:30,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:30,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171517823] [2025-01-09 09:42:30,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171517823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:30,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:30,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:42:30,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347251542] [2025-01-09 09:42:30,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:30,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:42:30,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:30,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:42:30,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:42:30,485 INFO L87 Difference]: Start difference. First operand 8883 states and 14961 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:31,598 INFO L93 Difference]: Finished difference Result 26493 states and 44664 transitions. [2025-01-09 09:42:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:42:31,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 585 [2025-01-09 09:42:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:31,658 INFO L225 Difference]: With dead ends: 26493 [2025-01-09 09:42:31,658 INFO L226 Difference]: Without dead ends: 17679 [2025-01-09 09:42:31,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:42:31,681 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 970 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:31,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1069 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:42:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17679 states. [2025-01-09 09:42:32,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17679 to 17663. [2025-01-09 09:42:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17663 states, 14369 states have (on average 1.6241213723989143) internal successors, (23337), 14458 states have internal predecessors, (23337), 3162 states have call successors, (3162), 131 states have call predecessors, (3162), 131 states have return successors, (3162), 3073 states have call predecessors, (3162), 3162 states have call successors, (3162) [2025-01-09 09:42:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17663 states to 17663 states and 29661 transitions. [2025-01-09 09:42:32,852 INFO L78 Accepts]: Start accepts. Automaton has 17663 states and 29661 transitions. Word has length 585 [2025-01-09 09:42:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:32,852 INFO L471 AbstractCegarLoop]: Abstraction has 17663 states and 29661 transitions. [2025-01-09 09:42:32,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 09:42:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 17663 states and 29661 transitions. [2025-01-09 09:42:32,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-01-09 09:42:32,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:32,860 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:32,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:42:32,860 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:32,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:32,861 INFO L85 PathProgramCache]: Analyzing trace with hash 385627628, now seen corresponding path program 1 times [2025-01-09 09:42:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:32,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679462752] [2025-01-09 09:42:32,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:32,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:32,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-01-09 09:42:33,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-01-09 09:42:33,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:33,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 186 proven. 96 refuted. 0 times theorem prover too weak. 17578 trivial. 0 not checked. [2025-01-09 09:42:33,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:33,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679462752] [2025-01-09 09:42:33,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679462752] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:42:33,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907397502] [2025-01-09 09:42:33,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:33,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:33,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:33,376 INFO L229 MonitoredProcess]: Starting monitored process 3 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 09:42:33,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:42:33,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-01-09 09:42:33,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-01-09 09:42:33,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:33,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:33,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 09:42:33,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:42:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 9034 proven. 96 refuted. 0 times theorem prover too weak. 8730 trivial. 0 not checked. [2025-01-09 09:42:34,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:42:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 186 proven. 96 refuted. 0 times theorem prover too weak. 17578 trivial. 0 not checked. [2025-01-09 09:42:35,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907397502] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:42:35,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:42:35,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-01-09 09:42:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574930223] [2025-01-09 09:42:35,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:42:35,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 09:42:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:35,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 09:42:35,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:42:35,036 INFO L87 Difference]: Start difference. First operand 17663 states and 29661 transitions. Second operand has 13 states, 13 states have (on average 18.076923076923077) internal successors, (235), 13 states have internal predecessors, (235), 7 states have call successors, (222), 3 states have call predecessors, (222), 5 states have return successors, (223), 7 states have call predecessors, (223), 7 states have call successors, (223) [2025-01-09 09:42:36,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:36,844 INFO L93 Difference]: Finished difference Result 35665 states and 59677 transitions. [2025-01-09 09:42:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 09:42:36,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.076923076923077) internal successors, (235), 13 states have internal predecessors, (235), 7 states have call successors, (222), 3 states have call predecessors, (222), 5 states have return successors, (223), 7 states have call predecessors, (223), 7 states have call successors, (223) Word has length 585 [2025-01-09 09:42:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:36,907 INFO L225 Difference]: With dead ends: 35665 [2025-01-09 09:42:36,908 INFO L226 Difference]: Without dead ends: 18071 [2025-01-09 09:42:36,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1194 GetRequests, 1166 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=624, Unknown=0, NotChecked=0, Total=870 [2025-01-09 09:42:36,945 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1153 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:36,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 1408 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 09:42:36,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18071 states. [2025-01-09 09:42:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18071 to 17791. [2025-01-09 09:42:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17791 states, 14481 states have (on average 1.5927767419377115) internal successors, (23065), 14570 states have internal predecessors, (23065), 3162 states have call successors, (3162), 147 states have call predecessors, (3162), 147 states have return successors, (3162), 3073 states have call predecessors, (3162), 3162 states have call successors, (3162) [2025-01-09 09:42:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17791 states to 17791 states and 29389 transitions. [2025-01-09 09:42:37,820 INFO L78 Accepts]: Start accepts. Automaton has 17791 states and 29389 transitions. Word has length 585 [2025-01-09 09:42:37,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:37,821 INFO L471 AbstractCegarLoop]: Abstraction has 17791 states and 29389 transitions. [2025-01-09 09:42:37,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.076923076923077) internal successors, (235), 13 states have internal predecessors, (235), 7 states have call successors, (222), 3 states have call predecessors, (222), 5 states have return successors, (223), 7 states have call predecessors, (223), 7 states have call successors, (223) [2025-01-09 09:42:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 17791 states and 29389 transitions. [2025-01-09 09:42:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-01-09 09:42:37,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:37,828 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:37,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 09:42:38,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 09:42:38,033 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:38,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:38,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1022886720, now seen corresponding path program 1 times [2025-01-09 09:42:38,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:38,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437367847] [2025-01-09 09:42:38,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:38,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-01-09 09:42:38,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-01-09 09:42:38,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:38,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 288 proven. 270 refuted. 0 times theorem prover too weak. 17302 trivial. 0 not checked. [2025-01-09 09:42:38,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437367847] [2025-01-09 09:42:38,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437367847] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:42:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105463629] [2025-01-09 09:42:38,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:38,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:38,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:38,676 INFO L229 MonitoredProcess]: Starting monitored process 4 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 09:42:38,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 09:42:38,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-01-09 09:42:38,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-01-09 09:42:38,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:38,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:38,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 09:42:38,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:42:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 11699 proven. 270 refuted. 0 times theorem prover too weak. 5891 trivial. 0 not checked. [2025-01-09 09:42:40,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:42:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 288 proven. 273 refuted. 0 times theorem prover too weak. 17299 trivial. 0 not checked. [2025-01-09 09:42:41,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105463629] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:42:41,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:42:41,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 19 [2025-01-09 09:42:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768854817] [2025-01-09 09:42:41,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:42:41,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 09:42:41,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:41,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 09:42:41,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2025-01-09 09:42:41,816 INFO L87 Difference]: Start difference. First operand 17791 states and 29389 transitions. Second operand has 19 states, 19 states have (on average 12.842105263157896) internal successors, (244), 19 states have internal predecessors, (244), 7 states have call successors, (285), 4 states have call predecessors, (285), 9 states have return successors, (285), 7 states have call predecessors, (285), 7 states have call successors, (285) [2025-01-09 09:42:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:47,088 INFO L93 Difference]: Finished difference Result 76819 states and 126732 transitions. [2025-01-09 09:42:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 09:42:47,088 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.842105263157896) internal successors, (244), 19 states have internal predecessors, (244), 7 states have call successors, (285), 4 states have call predecessors, (285), 9 states have return successors, (285), 7 states have call predecessors, (285), 7 states have call successors, (285) Word has length 586 [2025-01-09 09:42:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:47,223 INFO L225 Difference]: With dead ends: 76819 [2025-01-09 09:42:47,223 INFO L226 Difference]: Without dead ends: 59097 [2025-01-09 09:42:47,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1165 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=419, Invalid=913, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 09:42:47,261 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 1503 mSDsluCounter, 2313 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 3212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:47,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 2634 Invalid, 3212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 09:42:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59097 states. [2025-01-09 09:42:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59097 to 42787. [2025-01-09 09:42:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42787 states, 35085 states have (on average 1.5910218041898248) internal successors, (55821), 35310 states have internal predecessors, (55821), 7338 states have call successors, (7338), 363 states have call predecessors, (7338), 363 states have return successors, (7338), 7113 states have call predecessors, (7338), 7338 states have call successors, (7338) [2025-01-09 09:42:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42787 states to 42787 states and 70497 transitions. [2025-01-09 09:42:50,154 INFO L78 Accepts]: Start accepts. Automaton has 42787 states and 70497 transitions. Word has length 586 [2025-01-09 09:42:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:50,155 INFO L471 AbstractCegarLoop]: Abstraction has 42787 states and 70497 transitions. [2025-01-09 09:42:50,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.842105263157896) internal successors, (244), 19 states have internal predecessors, (244), 7 states have call successors, (285), 4 states have call predecessors, (285), 9 states have return successors, (285), 7 states have call predecessors, (285), 7 states have call successors, (285) [2025-01-09 09:42:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 42787 states and 70497 transitions. [2025-01-09 09:42:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-01-09 09:42:50,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:50,163 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:50,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 09:42:50,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:50,364 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:50,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:50,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1446533442, now seen corresponding path program 1 times [2025-01-09 09:42:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128106856] [2025-01-09 09:42:50,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:50,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-01-09 09:42:50,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-01-09 09:42:50,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:50,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:42:50,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647877433] [2025-01-09 09:42:50,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:50,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:50,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:50,625 INFO L229 MonitoredProcess]: Starting monitored process 5 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 09:42:50,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 09:42:50,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-01-09 09:42:51,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-01-09 09:42:51,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:51,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:51,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1284 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 09:42:51,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:42:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 10500 proven. 366 refuted. 0 times theorem prover too weak. 6994 trivial. 0 not checked. [2025-01-09 09:42:52,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:43:14,881 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)