./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.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-10_file-10.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 17124c627a77300cd44285b9c4c316438e4d73c0a011ab8330c0a1114bb82733 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:26:37,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:26:37,593 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:26:37,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:26:37,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:26:37,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:26:37,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:26:37,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:26:37,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:26:37,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:26:37,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:26:37,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:26:37,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:26:37,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:26:37,628 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:26:37,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:26:37,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:26:37,629 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:26:37,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:26:37,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:26:37,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:26:37,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:26:37,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:26:37,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:26:37,629 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:26:37,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:26:37,629 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:26:37,630 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:26:37,630 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:26:37,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:26:37,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:26:37,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:26:37,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:26:37,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:26:37,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:26:37,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:26:37,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:26:37,632 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 -> 17124c627a77300cd44285b9c4c316438e4d73c0a011ab8330c0a1114bb82733 [2025-01-09 09:26:37,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:26:37,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:26:37,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:26:37,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:26:37,877 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:26:37,879 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-10_file-10.i [2025-01-09 09:26:39,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e15d035e/a20ba8a57b0547c38e5f2d01ace8ad59/FLAG0d8147de6 [2025-01-09 09:26:39,275 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:26:39,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2025-01-09 09:26:39,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e15d035e/a20ba8a57b0547c38e5f2d01ace8ad59/FLAG0d8147de6 [2025-01-09 09:26:39,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e15d035e/a20ba8a57b0547c38e5f2d01ace8ad59 [2025-01-09 09:26:39,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:26:39,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:26:39,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:26:39,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:26:39,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:26:39,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39, skipping insertion in model container [2025-01-09 09:26:39,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:26:39,709 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-10_file-10.i[915,928] [2025-01-09 09:26:39,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:26:39,753 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:26:39,763 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-10_file-10.i[915,928] [2025-01-09 09:26:39,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:26:39,798 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:26:39,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39 WrapperNode [2025-01-09 09:26:39,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:26:39,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:26:39,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:26:39,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:26:39,804 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:26:39" (1/1) ... [2025-01-09 09:26:39,811 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:26:39" (1/1) ... [2025-01-09 09:26:39,838 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2025-01-09 09:26:39,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:26:39,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:26:39,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:26:39,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:26:39,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,877 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:26:39,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:26:39,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:26:39,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:26:39,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:26:39,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (1/1) ... [2025-01-09 09:26:39,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:26:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:26:39,933 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:26:39,940 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:26:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:26:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:26:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:26:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:26:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:26:39,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:26:40,023 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:26:40,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:26:40,340 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-09 09:26:40,340 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:26:40,347 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:26:40,347 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:26:40,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:40 BoogieIcfgContainer [2025-01-09 09:26:40,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:26:40,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:26:40,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:26:40,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:26:40,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:26:39" (1/3) ... [2025-01-09 09:26:40,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ece7b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:40, skipping insertion in model container [2025-01-09 09:26:40,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:39" (2/3) ... [2025-01-09 09:26:40,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ece7b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:40, skipping insertion in model container [2025-01-09 09:26:40,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:40" (3/3) ... [2025-01-09 09:26:40,354 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2025-01-09 09:26:40,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:26:40,364 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-10.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:26:40,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:26:40,412 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;@19a5eb06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:26:40,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:26:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 64 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 09:26:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 09:26:40,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:26:40,423 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:40,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:26:40,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:26:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash -420072694, now seen corresponding path program 1 times [2025-01-09 09:26:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:26:40,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454191778] [2025-01-09 09:26:40,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:26:40,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:26:40,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 09:26:40,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 09:26:40,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:26:40,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:26:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-01-09 09:26:40,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:26:40,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454191778] [2025-01-09 09:26:40,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454191778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:26:40,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448001900] [2025-01-09 09:26:40,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:26:40,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:26:40,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:26:40,665 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:26:40,667 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:26:40,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 09:26:40,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 09:26:40,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:26:40,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:26:40,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:26:40,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:26:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-01-09 09:26:40,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:26:40,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448001900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:26:40,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:26:40,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:26:40,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102592330] [2025-01-09 09:26:40,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:26:40,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:26:40,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:26:40,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:26:40,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:26:40,840 INFO L87 Difference]: Start difference. First operand has 91 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 64 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 09:26:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:26:40,859 INFO L93 Difference]: Finished difference Result 176 states and 296 transitions. [2025-01-09 09:26:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:26:40,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2025-01-09 09:26:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:26:40,865 INFO L225 Difference]: With dead ends: 176 [2025-01-09 09:26:40,866 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 09:26:40,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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:26:40,871 INFO L435 NwaCegarLoop]: 132 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, 132 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:26:40,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:26:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 09:26:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 09:26:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 09:26:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 132 transitions. [2025-01-09 09:26:40,902 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 132 transitions. Word has length 164 [2025-01-09 09:26:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:26:40,903 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 132 transitions. [2025-01-09 09:26:40,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 09:26:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 132 transitions. [2025-01-09 09:26:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 09:26:40,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:26:40,905 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:40,913 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:26:41,106 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:26:41,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:26:41,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:26:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash -311372989, now seen corresponding path program 1 times [2025-01-09 09:26:41,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:26:41,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188078343] [2025-01-09 09:26:41,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:26:41,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:26:41,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 09:26:41,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 09:26:41,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:26:41,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:26:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:26:41,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:26:41,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188078343] [2025-01-09 09:26:41,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188078343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:26:41,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:26:41,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:26:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882666561] [2025-01-09 09:26:41,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:26:41,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:26:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:26:41,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:26:41,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:26:41,306 INFO L87 Difference]: Start difference. First operand 88 states and 132 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:26:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:26:41,365 INFO L93 Difference]: Finished difference Result 257 states and 388 transitions. [2025-01-09 09:26:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:26:41,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-01-09 09:26:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:26:41,368 INFO L225 Difference]: With dead ends: 257 [2025-01-09 09:26:41,368 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 09:26:41,383 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:26:41,384 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 121 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 249 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:26:41,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 249 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:26:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 09:26:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 99. [2025-01-09 09:26:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 09:26:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2025-01-09 09:26:41,398 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 165 [2025-01-09 09:26:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:26:41,399 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2025-01-09 09:26:41,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:26:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2025-01-09 09:26:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 09:26:41,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:26:41,401 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:41,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:26:41,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:26:41,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:26:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash 368685381, now seen corresponding path program 1 times [2025-01-09 09:26:41,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:26:41,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119434538] [2025-01-09 09:26:41,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:26:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:26:41,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 09:26:41,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 09:26:41,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:26:41,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:26:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:26:41,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:26:41,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119434538] [2025-01-09 09:26:41,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119434538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:26:41,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:26:41,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:26:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218951085] [2025-01-09 09:26:41,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:26:41,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:26:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:26:41,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:26:41,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:26:41,851 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:26:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:26:42,061 INFO L93 Difference]: Finished difference Result 292 states and 439 transitions. [2025-01-09 09:26:42,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:26:42,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-01-09 09:26:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:26:42,066 INFO L225 Difference]: With dead ends: 292 [2025-01-09 09:26:42,068 INFO L226 Difference]: Without dead ends: 196 [2025-01-09 09:26:42,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:26:42,070 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 94 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:26:42,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 499 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:26:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-09 09:26:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 151. [2025-01-09 09:26:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 09:26:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 228 transitions. [2025-01-09 09:26:42,102 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 228 transitions. Word has length 165 [2025-01-09 09:26:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:26:42,103 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 228 transitions. [2025-01-09 09:26:42,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:26:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2025-01-09 09:26:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 09:26:42,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:26:42,107 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:42,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:26:42,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:26:42,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:26:42,108 INFO L85 PathProgramCache]: Analyzing trace with hash -980886174, now seen corresponding path program 1 times [2025-01-09 09:26:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:26:42,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449007503] [2025-01-09 09:26:42,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:26:42,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:26:42,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 09:26:42,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 09:26:42,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:26:42,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:26:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:26:42,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:26:42,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449007503] [2025-01-09 09:26:42,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449007503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:26:42,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:26:42,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:26:42,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88706890] [2025-01-09 09:26:42,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:26:42,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:26:42,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:26:42,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:26:42,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:26:42,431 INFO L87 Difference]: Start difference. First operand 151 states and 228 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:26:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:26:42,544 INFO L93 Difference]: Finished difference Result 259 states and 385 transitions. [2025-01-09 09:26:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:26:42,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2025-01-09 09:26:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:26:42,547 INFO L225 Difference]: With dead ends: 259 [2025-01-09 09:26:42,547 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 09:26:42,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:26:42,548 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 112 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:26:42,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 224 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:26:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 09:26:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-01-09 09:26:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 106 states have internal predecessors, (136), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 09:26:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 236 transitions. [2025-01-09 09:26:42,564 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 236 transitions. Word has length 166 [2025-01-09 09:26:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:26:42,565 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 236 transitions. [2025-01-09 09:26:42,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:26:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2025-01-09 09:26:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 09:26:42,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:26:42,567 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:42,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:26:42,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:26:42,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:26:42,568 INFO L85 PathProgramCache]: Analyzing trace with hash -251293498, now seen corresponding path program 1 times [2025-01-09 09:26:42,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:26:42,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226424586] [2025-01-09 09:26:42,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:26:42,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:26:42,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 09:26:42,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 09:26:42,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:26:42,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:26:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:26:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:26:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226424586] [2025-01-09 09:26:42,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226424586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:26:42,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:26:42,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:26:42,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801659279] [2025-01-09 09:26:42,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:26:42,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:26:42,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:26:42,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:26:42,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:26:42,764 INFO L87 Difference]: Start difference. First operand 161 states and 236 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:26:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:26:42,785 INFO L93 Difference]: Finished difference Result 264 states and 387 transitions. [2025-01-09 09:26:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:26:42,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2025-01-09 09:26:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:26:42,787 INFO L225 Difference]: With dead ends: 264 [2025-01-09 09:26:42,787 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 09:26:42,788 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:26:42,788 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 124 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:26:42,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 267 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:26:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 09:26:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-01-09 09:26:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 106 states have (on average 1.2641509433962264) internal successors, (134), 106 states have internal predecessors, (134), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 09:26:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 234 transitions. [2025-01-09 09:26:42,808 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 234 transitions. Word has length 167 [2025-01-09 09:26:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:26:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 234 transitions. [2025-01-09 09:26:42,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:26:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2025-01-09 09:26:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 09:26:42,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:26:42,810 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:42,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:26:42,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:26:42,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:26:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash 171408328, now seen corresponding path program 1 times [2025-01-09 09:26:42,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:26:42,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825683392] [2025-01-09 09:26:42,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:26:42,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:26:42,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 09:26:42,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 09:26:42,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:26:42,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:27:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:27:00,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:27:00,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825683392] [2025-01-09 09:27:00,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825683392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:27:00,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:27:00,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 09:27:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69111957] [2025-01-09 09:27:00,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:27:00,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 09:27:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:27:00,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 09:27:00,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:27:00,022 INFO L87 Difference]: Start difference. First operand 161 states and 234 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 09:27:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:27:01,555 INFO L93 Difference]: Finished difference Result 480 states and 682 transitions. [2025-01-09 09:27:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:27:01,556 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2025-01-09 09:27:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:27:01,559 INFO L225 Difference]: With dead ends: 480 [2025-01-09 09:27:01,559 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 09:27:01,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-01-09 09:27:01,560 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 509 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:27:01,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 756 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:27:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 09:27:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 259. [2025-01-09 09:27:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 183 states have internal predecessors, (233), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 09:27:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 369 transitions. [2025-01-09 09:27:01,579 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 369 transitions. Word has length 167 [2025-01-09 09:27:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:27:01,579 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 369 transitions. [2025-01-09 09:27:01,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 09:27:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 369 transitions. [2025-01-09 09:27:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 09:27:01,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:27:01,581 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:01,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:27:01,581 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:27:01,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:27:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash 429573766, now seen corresponding path program 1 times [2025-01-09 09:27:01,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:27:01,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959553389] [2025-01-09 09:27:01,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:27:01,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:27:01,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 09:27:01,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 09:27:01,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:01,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:27:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:27:41,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:27:41,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959553389] [2025-01-09 09:27:41,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959553389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:27:41,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:27:41,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 09:27:41,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660878467] [2025-01-09 09:27:41,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:27:41,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:27:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:27:41,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:27:41,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:27:41,392 INFO L87 Difference]: Start difference. First operand 259 states and 369 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:27:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:27:42,221 INFO L93 Difference]: Finished difference Result 578 states and 813 transitions. [2025-01-09 09:27:42,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 09:27:42,222 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2025-01-09 09:27:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:27:42,225 INFO L225 Difference]: With dead ends: 578 [2025-01-09 09:27:42,225 INFO L226 Difference]: Without dead ends: 358 [2025-01-09 09:27:42,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2025-01-09 09:27:42,227 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 374 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:27:42,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 724 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:27:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-09 09:27:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 255. [2025-01-09 09:27:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 178 states have (on average 1.2808988764044944) internal successors, (228), 179 states have internal predecessors, (228), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 09:27:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 364 transitions. [2025-01-09 09:27:42,245 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 364 transitions. Word has length 167 [2025-01-09 09:27:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:27:42,245 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 364 transitions. [2025-01-09 09:27:42,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 09:27:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 364 transitions. [2025-01-09 09:27:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 09:27:42,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:27:42,247 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:42,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:27:42,247 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:27:42,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:27:42,248 INFO L85 PathProgramCache]: Analyzing trace with hash 512418312, now seen corresponding path program 1 times [2025-01-09 09:27:42,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:27:42,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119892791] [2025-01-09 09:27:42,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:27:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:27:42,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 09:27:42,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 09:27:42,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:27:42,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:28:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 09:28:01,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:28:01,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119892791] [2025-01-09 09:28:01,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119892791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:28:01,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:28:01,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 09:28:01,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256848976] [2025-01-09 09:28:01,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:28:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 09:28:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:28:01,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 09:28:01,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-01-09 09:28:01,320 INFO L87 Difference]: Start difference. First operand 255 states and 364 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 09:28:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:28:05,569 INFO L93 Difference]: Finished difference Result 599 states and 838 transitions. [2025-01-09 09:28:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 09:28:05,571 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 167 [2025-01-09 09:28:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:28:05,572 INFO L225 Difference]: With dead ends: 599 [2025-01-09 09:28:05,573 INFO L226 Difference]: Without dead ends: 383 [2025-01-09 09:28:05,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 09:28:05,574 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1064 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:28:05,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 1000 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 09:28:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-01-09 09:28:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 270. [2025-01-09 09:28:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 191 states have (on average 1.2670157068062826) internal successors, (242), 192 states have internal predecessors, (242), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 09:28:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 378 transitions. [2025-01-09 09:28:05,596 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 378 transitions. Word has length 167 [2025-01-09 09:28:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:28:05,597 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 378 transitions. [2025-01-09 09:28:05,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 09:28:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 378 transitions. [2025-01-09 09:28:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 09:28:05,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:28:05,598 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:05,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:28:05,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:28:05,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:28:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1660543752, now seen corresponding path program 1 times [2025-01-09 09:28:05,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:28:05,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008613570] [2025-01-09 09:28:05,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:28:05,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:28:05,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 09:28:05,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 09:28:05,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:28:05,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat