./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-57.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-500_file-57.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 85317af79e2001c8e1b318bf68e7fdcd0f9e26e9789b5022a63d412f2c352aaf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:06:19,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:06:19,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:06:19,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:06:19,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:06:19,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:06:19,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:06:19,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:06:19,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:06:19,886 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:06:19,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:06:19,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:06:19,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:06:19,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:06:19,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:06:19,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:06:19,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:19,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:19,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:06:19,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:06:19,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:06:19,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:06:19,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:06:19,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:06:19,890 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 -> 85317af79e2001c8e1b318bf68e7fdcd0f9e26e9789b5022a63d412f2c352aaf [2025-01-09 10:06:20,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:06:20,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:06:20,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:06:20,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:06:20,123 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:06:20,124 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-500_file-57.i [2025-01-09 10:06:21,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/beb1e4efa/5f80365a98e24b5b99d5b9d8d30a9992/FLAGd53574997 [2025-01-09 10:06:21,594 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:06:21,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-57.i [2025-01-09 10:06:21,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/beb1e4efa/5f80365a98e24b5b99d5b9d8d30a9992/FLAGd53574997 [2025-01-09 10:06:21,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/beb1e4efa/5f80365a98e24b5b99d5b9d8d30a9992 [2025-01-09 10:06:21,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:06:21,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:06:21,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:06:21,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:06:21,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:06:21,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:06:21" (1/1) ... [2025-01-09 10:06:21,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bef629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:21, skipping insertion in model container [2025-01-09 10:06:21,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:06:21" (1/1) ... [2025-01-09 10:06:21,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:06:21,783 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-500_file-57.i[916,929] [2025-01-09 10:06:21,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:06:21,912 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:06:21,919 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-500_file-57.i[916,929] [2025-01-09 10:06:21,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:06:22,002 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:06:22,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22 WrapperNode [2025-01-09 10:06:22,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:06:22,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:06:22,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:06:22,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:06:22,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,097 INFO L138 Inliner]: procedures = 26, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 888 [2025-01-09 10:06:22,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:06:22,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:06:22,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:06:22,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:06:22,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,161 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 10:06:22,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,187 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:06:22,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:06:22,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:06:22,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:06:22,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:06:22,255 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 10:06:22,258 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 10:06:22,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:06:22,279 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:06:22,279 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:06:22,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:06:22,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:06:22,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:06:22,393 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:06:22,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:06:23,440 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 10:06:23,440 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:06:23,460 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:06:23,460 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:06:23,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:06:23 BoogieIcfgContainer [2025-01-09 10:06:23,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:06:23,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:06:23,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:06:23,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:06:23,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:06:21" (1/3) ... [2025-01-09 10:06:23,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8925ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:06:23, skipping insertion in model container [2025-01-09 10:06:23,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22" (2/3) ... [2025-01-09 10:06:23,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8925ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:06:23, skipping insertion in model container [2025-01-09 10:06:23,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:06:23" (3/3) ... [2025-01-09 10:06:23,477 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-57.i [2025-01-09 10:06:23,487 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:06:23,489 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-57.i that has 2 procedures, 367 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:06:23,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:06:23,555 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;@79844760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:06:23,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:06:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 367 states, 251 states have (on average 1.5737051792828685) internal successors, (395), 252 states have internal predecessors, (395), 113 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2025-01-09 10:06:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-01-09 10:06:23,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:23,590 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:23,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:23,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash -882911029, now seen corresponding path program 1 times [2025-01-09 10:06:23,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:23,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76196686] [2025-01-09 10:06:23,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:23,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:23,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-01-09 10:06:23,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-01-09 10:06:23,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:23,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-01-09 10:06:24,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:24,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76196686] [2025-01-09 10:06:24,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76196686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:24,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:24,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:24,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006622961] [2025-01-09 10:06:24,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:24,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:24,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:24,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:24,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:24,535 INFO L87 Difference]: Start difference. First operand has 367 states, 251 states have (on average 1.5737051792828685) internal successors, (395), 252 states have internal predecessors, (395), 113 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-01-09 10:06:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:24,681 INFO L93 Difference]: Finished difference Result 963 states and 1796 transitions. [2025-01-09 10:06:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:24,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 733 [2025-01-09 10:06:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:24,699 INFO L225 Difference]: With dead ends: 963 [2025-01-09 10:06:24,699 INFO L226 Difference]: Without dead ends: 599 [2025-01-09 10:06:24,704 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 10:06:24,706 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 403 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:24,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1602 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-01-09 10:06:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2025-01-09 10:06:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.6176470588235294) internal successors, (715), 443 states have internal predecessors, (715), 151 states have call successors, (151), 2 states have call predecessors, (151), 2 states have return successors, (151), 150 states have call predecessors, (151), 151 states have call successors, (151) [2025-01-09 10:06:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1017 transitions. [2025-01-09 10:06:24,834 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1017 transitions. Word has length 733 [2025-01-09 10:06:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:24,836 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 1017 transitions. [2025-01-09 10:06:24,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-01-09 10:06:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1017 transitions. [2025-01-09 10:06:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-01-09 10:06:24,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:24,849 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:24,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 10:06:24,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:24,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1939642231, now seen corresponding path program 1 times [2025-01-09 10:06:24,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:24,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069614300] [2025-01-09 10:06:24,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:24,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-01-09 10:06:24,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-01-09 10:06:24,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:24,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-01-09 10:06:25,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:25,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069614300] [2025-01-09 10:06:25,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069614300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:25,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:25,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098466709] [2025-01-09 10:06:25,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:25,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:25,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:25,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:25,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:25,571 INFO L87 Difference]: Start difference. First operand 596 states and 1017 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-01-09 10:06:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:25,677 INFO L93 Difference]: Finished difference Result 1782 states and 3045 transitions. [2025-01-09 10:06:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:25,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 733 [2025-01-09 10:06:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:25,692 INFO L225 Difference]: With dead ends: 1782 [2025-01-09 10:06:25,694 INFO L226 Difference]: Without dead ends: 1189 [2025-01-09 10:06:25,696 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 10:06:25,698 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 402 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:25,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1396 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:25,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2025-01-09 10:06:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1187. [2025-01-09 10:06:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 880 states have (on average 1.6181818181818182) internal successors, (1424), 882 states have internal predecessors, (1424), 302 states have call successors, (302), 4 states have call predecessors, (302), 4 states have return successors, (302), 300 states have call predecessors, (302), 302 states have call successors, (302) [2025-01-09 10:06:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2028 transitions. [2025-01-09 10:06:25,817 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2028 transitions. Word has length 733 [2025-01-09 10:06:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:25,820 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 2028 transitions. [2025-01-09 10:06:25,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-01-09 10:06:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2028 transitions. [2025-01-09 10:06:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-01-09 10:06:25,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:25,833 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:25,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:06:25,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:25,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash -60511285, now seen corresponding path program 1 times [2025-01-09 10:06:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:25,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717640823] [2025-01-09 10:06:25,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:25,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-01-09 10:06:25,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-01-09 10:06:25,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:25,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-01-09 10:06:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717640823] [2025-01-09 10:06:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717640823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:26,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:06:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958195275] [2025-01-09 10:06:26,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:26,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:06:26,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:26,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:06:26,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:06:26,165 INFO L87 Difference]: Start difference. First operand 1187 states and 2028 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-01-09 10:06:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:26,484 INFO L93 Difference]: Finished difference Result 4701 states and 7994 transitions. [2025-01-09 10:06:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:06:26,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 733 [2025-01-09 10:06:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:26,510 INFO L225 Difference]: With dead ends: 4701 [2025-01-09 10:06:26,510 INFO L226 Difference]: Without dead ends: 3517 [2025-01-09 10:06:26,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:06:26,517 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 1136 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:26,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 2624 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:06:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2025-01-09 10:06:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3501. [2025-01-09 10:06:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 2672 states have (on average 1.6197604790419162) internal successors, (4328), 2686 states have internal predecessors, (4328), 812 states have call successors, (812), 16 states have call predecessors, (812), 16 states have return successors, (812), 798 states have call predecessors, (812), 812 states have call successors, (812) [2025-01-09 10:06:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 5952 transitions. [2025-01-09 10:06:26,749 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 5952 transitions. Word has length 733 [2025-01-09 10:06:26,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:26,750 INFO L471 AbstractCegarLoop]: Abstraction has 3501 states and 5952 transitions. [2025-01-09 10:06:26,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-01-09 10:06:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 5952 transitions. [2025-01-09 10:06:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-01-09 10:06:26,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:26,760 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:26,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:06:26,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:26,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash -621211063, now seen corresponding path program 1 times [2025-01-09 10:06:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:26,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818926475] [2025-01-09 10:06:26,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:26,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:26,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-01-09 10:06:26,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-01-09 10:06:26,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:26,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-01-09 10:06:27,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:27,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818926475] [2025-01-09 10:06:27,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818926475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:27,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:27,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:06:27,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101707096] [2025-01-09 10:06:27,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:27,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:06:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:27,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:06:27,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:06:27,167 INFO L87 Difference]: Start difference. First operand 3501 states and 5952 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-01-09 10:06:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:27,479 INFO L93 Difference]: Finished difference Result 9913 states and 16834 transitions. [2025-01-09 10:06:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:06:27,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 733 [2025-01-09 10:06:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:27,519 INFO L225 Difference]: With dead ends: 9913 [2025-01-09 10:06:27,519 INFO L226 Difference]: Without dead ends: 6415 [2025-01-09 10:06:27,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:06:27,531 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 371 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:27,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 2022 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6415 states. [2025-01-09 10:06:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6415 to 6409. [2025-01-09 10:06:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6409 states, 4920 states have (on average 1.6146341463414635) internal successors, (7944), 4950 states have internal predecessors, (7944), 1456 states have call successors, (1456), 32 states have call predecessors, (1456), 32 states have return successors, (1456), 1426 states have call predecessors, (1456), 1456 states have call successors, (1456) [2025-01-09 10:06:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6409 states to 6409 states and 10856 transitions. [2025-01-09 10:06:27,894 INFO L78 Accepts]: Start accepts. Automaton has 6409 states and 10856 transitions. Word has length 733 [2025-01-09 10:06:27,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:27,895 INFO L471 AbstractCegarLoop]: Abstraction has 6409 states and 10856 transitions. [2025-01-09 10:06:27,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-01-09 10:06:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 6409 states and 10856 transitions. [2025-01-09 10:06:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-01-09 10:06:27,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:27,906 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:27,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:06:27,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:27,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:27,907 INFO L85 PathProgramCache]: Analyzing trace with hash 979183611, now seen corresponding path program 1 times [2025-01-09 10:06:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:27,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477281269] [2025-01-09 10:06:27,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:27,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:27,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-01-09 10:06:27,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-01-09 10:06:27,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:27,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-01-09 10:06:28,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:28,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477281269] [2025-01-09 10:06:28,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477281269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:28,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:28,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:28,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342539243] [2025-01-09 10:06:28,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:28,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:28,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:28,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:28,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:28,338 INFO L87 Difference]: Start difference. First operand 6409 states and 10856 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-01-09 10:06:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:28,771 INFO L93 Difference]: Finished difference Result 19221 states and 32562 transitions. [2025-01-09 10:06:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:28,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 733 [2025-01-09 10:06:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:28,833 INFO L225 Difference]: With dead ends: 19221 [2025-01-09 10:06:28,834 INFO L226 Difference]: Without dead ends: 12815 [2025-01-09 10:06:28,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 10:06:28,852 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 393 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:28,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1371 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12815 states. [2025-01-09 10:06:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12815 to 12805. [2025-01-09 10:06:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12805 states, 9828 states have (on average 1.612128612128612) internal successors, (15844), 9888 states have internal predecessors, (15844), 2912 states have call successors, (2912), 64 states have call predecessors, (2912), 64 states have return successors, (2912), 2852 states have call predecessors, (2912), 2912 states have call successors, (2912) [2025-01-09 10:06:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12805 states to 12805 states and 21668 transitions. [2025-01-09 10:06:29,601 INFO L78 Accepts]: Start accepts. Automaton has 12805 states and 21668 transitions. Word has length 733 [2025-01-09 10:06:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:29,602 INFO L471 AbstractCegarLoop]: Abstraction has 12805 states and 21668 transitions. [2025-01-09 10:06:29,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-01-09 10:06:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 12805 states and 21668 transitions. [2025-01-09 10:06:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-01-09 10:06:29,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:29,619 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:29,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:06:29,620 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:29,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash -311683322, now seen corresponding path program 1 times [2025-01-09 10:06:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:29,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787708430] [2025-01-09 10:06:29,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:29,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:29,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-01-09 10:06:29,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-01-09 10:06:29,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:29,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-01-09 10:06:31,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787708430] [2025-01-09 10:06:31,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787708430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:31,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:31,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:06:31,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620672887] [2025-01-09 10:06:31,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:31,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:06:31,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:31,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:06:31,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:06:31,228 INFO L87 Difference]: Start difference. First operand 12805 states and 21668 transitions. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-01-09 10:06:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:35,995 INFO L93 Difference]: Finished difference Result 92981 states and 157080 transitions. [2025-01-09 10:06:35,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:06:35,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) Word has length 734 [2025-01-09 10:06:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:36,303 INFO L225 Difference]: With dead ends: 92981 [2025-01-09 10:06:36,304 INFO L226 Difference]: Without dead ends: 80179 [2025-01-09 10:06:36,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:06:36,375 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 4109 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 844 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4109 SdHoareTripleChecker+Valid, 5929 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:36,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4109 Valid, 5929 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 10:06:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80179 states. [2025-01-09 10:06:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80179 to 50750. [2025-01-09 10:06:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50750 states, 39936 states have (on average 1.6256009615384615) internal successors, (64920), 40181 states have internal predecessors, (64920), 10556 states have call successors, (10556), 257 states have call predecessors, (10556), 257 states have return successors, (10556), 10311 states have call predecessors, (10556), 10556 states have call successors, (10556) [2025-01-09 10:06:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50750 states to 50750 states and 86032 transitions. [2025-01-09 10:06:39,169 INFO L78 Accepts]: Start accepts. Automaton has 50750 states and 86032 transitions. Word has length 734 [2025-01-09 10:06:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:39,170 INFO L471 AbstractCegarLoop]: Abstraction has 50750 states and 86032 transitions. [2025-01-09 10:06:39,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-01-09 10:06:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 50750 states and 86032 transitions. [2025-01-09 10:06:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-01-09 10:06:39,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:39,225 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:39,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:06:39,225 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:39,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:39,226 INFO L85 PathProgramCache]: Analyzing trace with hash 642256836, now seen corresponding path program 1 times [2025-01-09 10:06:39,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:39,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695735510] [2025-01-09 10:06:39,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:39,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:39,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-01-09 10:06:39,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-01-09 10:06:39,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:39,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-01-09 10:06:39,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:39,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695735510] [2025-01-09 10:06:39,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695735510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:39,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:39,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:06:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990079422] [2025-01-09 10:06:39,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:39,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:06:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:39,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:06:39,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:06:39,837 INFO L87 Difference]: Start difference. First operand 50750 states and 86032 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 3 states have call predecessors, (113), 3 states have call successors, (113) [2025-01-09 10:06:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:43,371 INFO L93 Difference]: Finished difference Result 151522 states and 256874 transitions. [2025-01-09 10:06:43,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:43,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 3 states have call predecessors, (113), 3 states have call successors, (113) Word has length 734 [2025-01-09 10:06:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:43,748 INFO L225 Difference]: With dead ends: 151522 [2025-01-09 10:06:43,748 INFO L226 Difference]: Without dead ends: 100824 [2025-01-09 10:06:43,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:06:43,881 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 676 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:43,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 2523 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:06:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100824 states. [2025-01-09 10:06:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100824 to 100822. [2025-01-09 10:06:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100822 states, 79224 states have (on average 1.617085731596486) internal successors, (128112), 79713 states have internal predecessors, (128112), 21084 states have call successors, (21084), 513 states have call predecessors, (21084), 513 states have return successors, (21084), 20595 states have call predecessors, (21084), 21084 states have call successors, (21084) [2025-01-09 10:06:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100822 states to 100822 states and 170280 transitions. [2025-01-09 10:06:50,204 INFO L78 Accepts]: Start accepts. Automaton has 100822 states and 170280 transitions. Word has length 734 [2025-01-09 10:06:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:50,205 INFO L471 AbstractCegarLoop]: Abstraction has 100822 states and 170280 transitions. [2025-01-09 10:06:50,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 3 states have call predecessors, (113), 3 states have call successors, (113) [2025-01-09 10:06:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 100822 states and 170280 transitions. [2025-01-09 10:06:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-01-09 10:06:50,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:50,273 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:50,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:06:50,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:50,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:50,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1368414524, now seen corresponding path program 1 times [2025-01-09 10:06:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:50,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835661381] [2025-01-09 10:06:50,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:50,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-01-09 10:06:50,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-01-09 10:06:50,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:50,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-01-09 10:06:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835661381] [2025-01-09 10:06:51,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835661381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:51,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:51,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:06:51,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465106876] [2025-01-09 10:06:51,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:51,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:06:51,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:51,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:06:51,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:06:51,478 INFO L87 Difference]: Start difference. First operand 100822 states and 170280 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-01-09 10:07:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:00,890 INFO L93 Difference]: Finished difference Result 333695 states and 562724 transitions. [2025-01-09 10:07:00,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:07:00,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 734 [2025-01-09 10:07:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:01,608 INFO L225 Difference]: With dead ends: 333695 [2025-01-09 10:07:01,608 INFO L226 Difference]: Without dead ends: 232925 [2025-01-09 10:07:01,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:07:01,820 INFO L435 NwaCegarLoop]: 1062 mSDtfsCounter, 2973 mSDsluCounter, 3205 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2973 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:01,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2973 Valid, 4267 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:07:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232925 states.