./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-29.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-29.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 dddfc5942fec34b0a88732e75b6357bb86711b701ff81e97599587530ca1ca17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:03:38,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:03:38,437 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:03:38,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:03:38,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:03:38,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:03:38,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:03:38,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:03:38,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:03:38,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:03:38,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:03:38,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:03:38,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:03:38,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:03:38,463 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:03:38,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:03:38,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:03:38,463 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:03:38,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:03:38,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:03:38,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:03:38,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:03:38,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:03:38,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:03:38,464 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:03:38,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:03:38,464 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:03:38,464 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:03:38,464 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:03:38,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:38,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:38,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:38,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:38,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:03:38,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:38,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:03:38,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:03:38,466 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 -> dddfc5942fec34b0a88732e75b6357bb86711b701ff81e97599587530ca1ca17 [2025-01-09 10:03:38,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:03:38,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:03:38,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:03:38,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:03:38,694 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:03:38,695 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-29.i [2025-01-09 10:03:39,913 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/521e4bb9c/0d86c5a0584446518c78565a304f24cc/FLAGb55d8935f [2025-01-09 10:03:40,234 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:03:40,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-29.i [2025-01-09 10:03:40,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/521e4bb9c/0d86c5a0584446518c78565a304f24cc/FLAGb55d8935f [2025-01-09 10:03:40,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/521e4bb9c/0d86c5a0584446518c78565a304f24cc [2025-01-09 10:03:40,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:03:40,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:03:40,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:40,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:03:40,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:03:40,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:40,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b5d3d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40, skipping insertion in model container [2025-01-09 10:03:40,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:40,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:03:40,638 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-29.i[916,929] [2025-01-09 10:03:40,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:40,795 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:03:40,804 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-29.i[916,929] [2025-01-09 10:03:40,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:40,889 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:03:40,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40 WrapperNode [2025-01-09 10:03:40,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:40,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:40,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:03:40,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:03:40,901 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:03:40" (1/1) ... [2025-01-09 10:03:40,921 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:03:40" (1/1) ... [2025-01-09 10:03:40,986 INFO L138 Inliner]: procedures = 26, calls = 123, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 879 [2025-01-09 10:03:40,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:40,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:03:40,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:03:40,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:03:40,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:40,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:41,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:41,041 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:03:41,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:41,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:41,063 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:41,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:41,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:41,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:41,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:41,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:03:41,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:03:41,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:03:41,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:03:41,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (1/1) ... [2025-01-09 10:03:41,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:41,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:41,144 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:03:41,146 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:03:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:03:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:03:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:03:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:03:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:03:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:03:41,289 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:03:41,290 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:03:42,430 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 10:03:42,431 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:03:42,446 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:03:42,450 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:03:42,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:42 BoogieIcfgContainer [2025-01-09 10:03:42,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:03:42,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:03:42,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:03:42,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:03:42,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:03:40" (1/3) ... [2025-01-09 10:03:42,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bca8c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:42, skipping insertion in model container [2025-01-09 10:03:42,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:40" (2/3) ... [2025-01-09 10:03:42,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bca8c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:42, skipping insertion in model container [2025-01-09 10:03:42,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:42" (3/3) ... [2025-01-09 10:03:42,459 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-29.i [2025-01-09 10:03:42,470 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:03:42,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-29.i that has 2 procedures, 362 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:03:42,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:03:42,541 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;@411cb7bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:03:42,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:03:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 249 states have (on average 1.6104417670682731) internal successors, (401), 250 states have internal predecessors, (401), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 10:03:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-01-09 10:03:42,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:42,568 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:42,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:42,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:42,575 INFO L85 PathProgramCache]: Analyzing trace with hash -827023912, now seen corresponding path program 1 times [2025-01-09 10:03:42,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:42,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598404954] [2025-01-09 10:03:42,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:42,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:42,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:03:42,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:03:42,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:42,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 218 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2025-01-09 10:03:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598404954] [2025-01-09 10:03:43,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598404954] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:03:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294231720] [2025-01-09 10:03:43,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:43,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:03:43,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:43,192 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 10:03:43,195 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 10:03:43,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:03:43,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:03:43,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:43,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:43,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 1587 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:03:43,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:03:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2025-01-09 10:03:43,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:03:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294231720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:43,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:03:43,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:03:43,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499405674] [2025-01-09 10:03:43,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:43,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:03:43,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:43,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:03:43,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:03:43,748 INFO L87 Difference]: Start difference. First operand has 362 states, 249 states have (on average 1.6104417670682731) internal successors, (401), 250 states have internal predecessors, (401), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2025-01-09 10:03:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:43,810 INFO L93 Difference]: Finished difference Result 718 states and 1347 transitions. [2025-01-09 10:03:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:03:43,813 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) Word has length 702 [2025-01-09 10:03:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:43,822 INFO L225 Difference]: With dead ends: 718 [2025-01-09 10:03:43,822 INFO L226 Difference]: Without dead ends: 359 [2025-01-09 10:03:43,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 703 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 10:03:43,835 INFO L435 NwaCegarLoop]: 615 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, 615 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 10:03:43,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-09 10:03:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-01-09 10:03:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 247 states have (on average 1.5991902834008098) internal successors, (395), 247 states have internal predecessors, (395), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 10:03:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 615 transitions. [2025-01-09 10:03:43,916 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 615 transitions. Word has length 702 [2025-01-09 10:03:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:43,917 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 615 transitions. [2025-01-09 10:03:43,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2025-01-09 10:03:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 615 transitions. [2025-01-09 10:03:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-01-09 10:03:43,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:43,937 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:43,946 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 10:03:44,138 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 10:03:44,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:44,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash -94384948, now seen corresponding path program 1 times [2025-01-09 10:03:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829127854] [2025-01-09 10:03:44,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:44,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:03:44,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:03:44,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:44,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:03:44,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:44,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829127854] [2025-01-09 10:03:44,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829127854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:44,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790924354] [2025-01-09 10:03:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:44,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:44,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:44,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:44,955 INFO L87 Difference]: Start difference. First operand 359 states and 615 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:45,046 INFO L93 Difference]: Finished difference Result 934 states and 1611 transitions. [2025-01-09 10:03:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:45,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-01-09 10:03:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:45,053 INFO L225 Difference]: With dead ends: 934 [2025-01-09 10:03:45,053 INFO L226 Difference]: Without dead ends: 578 [2025-01-09 10:03:45,055 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:03:45,055 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 381 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:45,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1295 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-01-09 10:03:45,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 575. [2025-01-09 10:03:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 432 states have (on average 1.650462962962963) internal successors, (713), 433 states have internal predecessors, (713), 140 states have call successors, (140), 2 states have call predecessors, (140), 2 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-01-09 10:03:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 993 transitions. [2025-01-09 10:03:45,117 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 993 transitions. Word has length 702 [2025-01-09 10:03:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:45,119 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 993 transitions. [2025-01-09 10:03:45,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 993 transitions. [2025-01-09 10:03:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-01-09 10:03:45,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:45,127 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:45,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:03:45,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:45,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1782097870, now seen corresponding path program 1 times [2025-01-09 10:03:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:45,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734136832] [2025-01-09 10:03:45,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:45,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:45,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:03:45,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:03:45,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:45,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:03:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:45,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734136832] [2025-01-09 10:03:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734136832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:45,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275721746] [2025-01-09 10:03:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:45,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:45,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:45,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:45,505 INFO L87 Difference]: Start difference. First operand 575 states and 993 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:45,582 INFO L93 Difference]: Finished difference Result 1158 states and 1996 transitions. [2025-01-09 10:03:45,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:45,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-01-09 10:03:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:45,590 INFO L225 Difference]: With dead ends: 1158 [2025-01-09 10:03:45,592 INFO L226 Difference]: Without dead ends: 586 [2025-01-09 10:03:45,595 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:03:45,596 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 355 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:45,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1289 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-01-09 10:03:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 498. [2025-01-09 10:03:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 385 states have (on average 1.6623376623376624) internal successors, (640), 385 states have internal predecessors, (640), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 10:03:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 860 transitions. [2025-01-09 10:03:45,637 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 860 transitions. Word has length 702 [2025-01-09 10:03:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:45,641 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 860 transitions. [2025-01-09 10:03:45,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 860 transitions. [2025-01-09 10:03:45,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-01-09 10:03:45,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:45,647 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:45,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:03:45,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:45,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1688306100, now seen corresponding path program 1 times [2025-01-09 10:03:45,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:45,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93225695] [2025-01-09 10:03:45,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:45,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:45,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:03:45,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:03:45,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:45,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:03:45,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:45,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93225695] [2025-01-09 10:03:45,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93225695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:45,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:45,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436872801] [2025-01-09 10:03:45,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:45,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:45,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:45,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:45,925 INFO L87 Difference]: Start difference. First operand 498 states and 860 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:45,989 INFO L93 Difference]: Finished difference Result 1478 states and 2554 transitions. [2025-01-09 10:03:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:45,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-01-09 10:03:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:45,996 INFO L225 Difference]: With dead ends: 1478 [2025-01-09 10:03:45,997 INFO L226 Difference]: Without dead ends: 983 [2025-01-09 10:03:45,998 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:03:45,999 INFO L435 NwaCegarLoop]: 1026 mSDtfsCounter, 599 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:46,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1625 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-01-09 10:03:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 724. [2025-01-09 10:03:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 611 states have (on average 1.7103109656301145) internal successors, (1045), 611 states have internal predecessors, (1045), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 10:03:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1265 transitions. [2025-01-09 10:03:46,073 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1265 transitions. Word has length 702 [2025-01-09 10:03:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:46,074 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1265 transitions. [2025-01-09 10:03:46,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1265 transitions. [2025-01-09 10:03:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-01-09 10:03:46,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:46,080 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:46,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:03:46,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:46,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash -812287094, now seen corresponding path program 1 times [2025-01-09 10:03:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:46,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418925217] [2025-01-09 10:03:46,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:46,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:03:46,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:03:46,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:46,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:03:46,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:46,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418925217] [2025-01-09 10:03:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418925217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:46,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:46,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:46,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480072121] [2025-01-09 10:03:46,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:46,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:46,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:46,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:46,327 INFO L87 Difference]: Start difference. First operand 724 states and 1265 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:46,380 INFO L93 Difference]: Finished difference Result 1992 states and 3467 transitions. [2025-01-09 10:03:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:46,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-01-09 10:03:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:46,388 INFO L225 Difference]: With dead ends: 1992 [2025-01-09 10:03:46,388 INFO L226 Difference]: Without dead ends: 1271 [2025-01-09 10:03:46,390 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:03:46,390 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 515 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:46,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1217 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-01-09 10:03:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 848. [2025-01-09 10:03:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 735 states have (on average 1.7183673469387755) internal successors, (1263), 735 states have internal predecessors, (1263), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 10:03:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1483 transitions. [2025-01-09 10:03:46,452 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1483 transitions. Word has length 702 [2025-01-09 10:03:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:46,453 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1483 transitions. [2025-01-09 10:03:46,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1483 transitions. [2025-01-09 10:03:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-01-09 10:03:46,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:46,460 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:46,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:03:46,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:46,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:46,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2139408634, now seen corresponding path program 1 times [2025-01-09 10:03:46,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:46,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576783867] [2025-01-09 10:03:46,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:46,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:46,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:03:46,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:03:46,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:46,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:03:46,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:46,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576783867] [2025-01-09 10:03:46,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576783867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:46,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:46,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:46,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860772310] [2025-01-09 10:03:46,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:46,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:46,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:46,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:46,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:46,677 INFO L87 Difference]: Start difference. First operand 848 states and 1483 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:46,729 INFO L93 Difference]: Finished difference Result 2109 states and 3680 transitions. [2025-01-09 10:03:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:46,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-01-09 10:03:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:46,737 INFO L225 Difference]: With dead ends: 2109 [2025-01-09 10:03:46,738 INFO L226 Difference]: Without dead ends: 1264 [2025-01-09 10:03:46,739 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:03:46,740 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 264 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:46,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1214 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-01-09 10:03:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1261. [2025-01-09 10:03:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1088 states have (on average 1.703125) internal successors, (1853), 1089 states have internal predecessors, (1853), 168 states have call successors, (168), 4 states have call predecessors, (168), 4 states have return successors, (168), 167 states have call predecessors, (168), 168 states have call successors, (168) [2025-01-09 10:03:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 2189 transitions. [2025-01-09 10:03:46,785 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 2189 transitions. Word has length 702 [2025-01-09 10:03:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:46,787 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 2189 transitions. [2025-01-09 10:03:46,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 2189 transitions. [2025-01-09 10:03:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-01-09 10:03:46,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:46,794 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:46,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:03:46,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:46,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash -802986614, now seen corresponding path program 1 times [2025-01-09 10:03:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:46,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352221021] [2025-01-09 10:03:46,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:46,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:46,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:03:46,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:03:46,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:46,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:03:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352221021] [2025-01-09 10:03:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352221021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:47,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:47,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437418993] [2025-01-09 10:03:47,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:47,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:47,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:47,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:47,237 INFO L87 Difference]: Start difference. First operand 1261 states and 2189 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:47,543 INFO L93 Difference]: Finished difference Result 5719 states and 9945 transitions. [2025-01-09 10:03:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:03:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-01-09 10:03:47,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:47,563 INFO L225 Difference]: With dead ends: 5719 [2025-01-09 10:03:47,564 INFO L226 Difference]: Without dead ends: 4461 [2025-01-09 10:03:47,568 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:03:47,569 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 1235 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:47,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 2943 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:03:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4461 states. [2025-01-09 10:03:47,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4461 to 4451. [2025-01-09 10:03:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4451 states, 3942 states have (on average 1.7123287671232876) internal successors, (6750), 3948 states have internal predecessors, (6750), 492 states have call successors, (492), 16 states have call predecessors, (492), 16 states have return successors, (492), 486 states have call predecessors, (492), 492 states have call successors, (492) [2025-01-09 10:03:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4451 states to 4451 states and 7734 transitions. [2025-01-09 10:03:47,739 INFO L78 Accepts]: Start accepts. Automaton has 4451 states and 7734 transitions. Word has length 702 [2025-01-09 10:03:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:47,739 INFO L471 AbstractCegarLoop]: Abstraction has 4451 states and 7734 transitions. [2025-01-09 10:03:47,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4451 states and 7734 transitions. [2025-01-09 10:03:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-01-09 10:03:47,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:47,750 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:47,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:03:47,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:47,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1155588172, now seen corresponding path program 1 times [2025-01-09 10:03:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:47,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752145762] [2025-01-09 10:03:47,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:47,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:03:47,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:03:47,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:47,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:03:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752145762] [2025-01-09 10:03:48,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752145762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:48,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:48,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:03:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606108275] [2025-01-09 10:03:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:48,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:03:48,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:48,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:03:48,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:03:48,168 INFO L87 Difference]: Start difference. First operand 4451 states and 7734 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:50,838 INFO L93 Difference]: Finished difference Result 25061 states and 43535 transitions. [2025-01-09 10:03:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:03:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-01-09 10:03:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:50,906 INFO L225 Difference]: With dead ends: 25061 [2025-01-09 10:03:50,906 INFO L226 Difference]: Without dead ends: 20613 [2025-01-09 10:03:50,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:03:50,920 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 3712 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 1408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3712 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1408 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:50,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3712 Valid, 3665 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1408 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 10:03:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20613 states. [2025-01-09 10:03:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20613 to 13393. [2025-01-09 10:03:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13393 states, 11816 states have (on average 1.7075152335815842) internal successors, (20176), 11834 states have internal predecessors, (20176), 1528 states have call successors, (1528), 48 states have call predecessors, (1528), 48 states have return successors, (1528), 1510 states have call predecessors, (1528), 1528 states have call successors, (1528) [2025-01-09 10:03:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13393 states to 13393 states and 23232 transitions. [2025-01-09 10:03:51,620 INFO L78 Accepts]: Start accepts. Automaton has 13393 states and 23232 transitions. Word has length 702 [2025-01-09 10:03:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:51,621 INFO L471 AbstractCegarLoop]: Abstraction has 13393 states and 23232 transitions. [2025-01-09 10:03:51,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 13393 states and 23232 transitions. [2025-01-09 10:03:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-01-09 10:03:51,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:51,642 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:51,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:03:51,643 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:51,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1834860426, now seen corresponding path program 1 times [2025-01-09 10:03:51,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:51,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337367449] [2025-01-09 10:03:51,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:51,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:51,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:03:51,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:03:51,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:51,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:03:52,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:52,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337367449] [2025-01-09 10:03:52,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337367449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:52,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:52,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:52,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727159297] [2025-01-09 10:03:52,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:52,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:52,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:52,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:52,136 INFO L87 Difference]: Start difference. First operand 13393 states and 23232 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:52,660 INFO L93 Difference]: Finished difference Result 40173 states and 69690 transitions. [2025-01-09 10:03:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:52,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-01-09 10:03:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:52,741 INFO L225 Difference]: With dead ends: 40173 [2025-01-09 10:03:52,741 INFO L226 Difference]: Without dead ends: 26783 [2025-01-09 10:03:52,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:52,782 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 357 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:52,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1221 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26783 states. [2025-01-09 10:03:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26783 to 26781. [2025-01-09 10:03:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26781 states, 23628 states have (on average 1.706619265278483) internal successors, (40324), 23664 states have internal predecessors, (40324), 3056 states have call successors, (3056), 96 states have call predecessors, (3056), 96 states have return successors, (3056), 3020 states have call predecessors, (3056), 3056 states have call successors, (3056) [2025-01-09 10:03:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26781 states to 26781 states and 46436 transitions. [2025-01-09 10:03:53,774 INFO L78 Accepts]: Start accepts. Automaton has 26781 states and 46436 transitions. Word has length 702 [2025-01-09 10:03:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:53,776 INFO L471 AbstractCegarLoop]: Abstraction has 26781 states and 46436 transitions. [2025-01-09 10:03:53,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:03:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 26781 states and 46436 transitions. [2025-01-09 10:03:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-01-09 10:03:53,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:53,799 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:53,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:03:53,799 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:53,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1892118728, now seen corresponding path program 1 times [2025-01-09 10:03:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:53,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954189419] [2025-01-09 10:03:53,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:53,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:03:53,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:03:53,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:53,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:03:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954189419] [2025-01-09 10:03:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954189419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:54,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:54,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:03:54,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013047747] [2025-01-09 10:03:54,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:54,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:03:54,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:54,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:03:54,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:03:54,914 INFO L87 Difference]: Start difference. First operand 26781 states and 46436 transitions. Second operand has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:04:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:07,093 INFO L93 Difference]: Finished difference Result 276724 states and 471679 transitions. [2025-01-09 10:04:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 10:04:07,094 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 702 [2025-01-09 10:04:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:08,086 INFO L225 Difference]: With dead ends: 276724 [2025-01-09 10:04:08,086 INFO L226 Difference]: Without dead ends: 249946 [2025-01-09 10:04:08,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2025-01-09 10:04:08,214 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 6092 mSDsluCounter, 11656 mSDsCounter, 0 mSdLazyCounter, 4508 mSolverCounterSat, 1275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6092 SdHoareTripleChecker+Valid, 13167 SdHoareTripleChecker+Invalid, 5783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1275 IncrementalHoareTripleChecker+Valid, 4508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:08,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6092 Valid, 13167 Invalid, 5783 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1275 Valid, 4508 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-01-09 10:04:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249946 states. [2025-01-09 10:04:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249946 to 180158. [2025-01-09 10:04:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180158 states, 154261 states have (on average 1.662306091623936) internal successors, (256429), 154782 states have internal predecessors, (256429), 24743 states have call successors, (24743), 1153 states have call predecessors, (24743), 1153 states have return successors, (24743), 24222 states have call predecessors, (24743), 24743 states have call successors, (24743) [2025-01-09 10:04:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180158 states to 180158 states and 305915 transitions. [2025-01-09 10:04:15,851 INFO L78 Accepts]: Start accepts. Automaton has 180158 states and 305915 transitions. Word has length 702 [2025-01-09 10:04:15,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:15,852 INFO L471 AbstractCegarLoop]: Abstraction has 180158 states and 305915 transitions. [2025-01-09 10:04:15,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-01-09 10:04:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 180158 states and 305915 transitions. [2025-01-09 10:04:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-01-09 10:04:16,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:16,126 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:16,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:04:16,127 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:16,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1461741432, now seen corresponding path program 1 times [2025-01-09 10:04:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:16,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936126078] [2025-01-09 10:04:16,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:16,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 10:04:16,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 10:04:16,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:16,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:04:17,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:17,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936126078] [2025-01-09 10:04:17,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936126078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:17,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:17,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:04:17,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950830103] [2025-01-09 10:04:17,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:17,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:04:17,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:17,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:04:17,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:04:17,305 INFO L87 Difference]: Start difference. First operand 180158 states and 305915 transitions. Second operand has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110)