./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-28.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-28.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 e3e490624669738192d84194857eb5010bb4c249ca7cd2d385528db4c6ad1bc5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:03:37,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:03:37,055 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:37,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:03:37,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:03:37,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:03:37,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:03:37,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:03:37,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:03:37,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:03:37,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:03:37,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:03:37,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:03:37,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:03:37,081 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:03:37,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:03:37,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:03:37,081 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:03:37,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:03:37,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:03:37,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:03:37,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:03:37,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:03:37,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:03:37,082 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:03:37,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:03:37,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:03:37,083 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:03:37,083 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:03:37,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:37,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:37,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:37,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:37,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:03:37,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:37,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:37,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:37,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:37,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:03:37,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:03:37,084 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:03:37,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:03:37,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:03:37,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:03:37,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:03:37,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:03:37,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:03:37,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:03:37,086 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 -> e3e490624669738192d84194857eb5010bb4c249ca7cd2d385528db4c6ad1bc5 [2025-01-09 10:03:37,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:03:37,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:03:37,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:03:37,363 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:03:37,363 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:03:37,364 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-28.i [2025-01-09 10:03:38,641 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fcf31454/01ab0fef644947be8f047cb5c23829ec/FLAGcc4372998 [2025-01-09 10:03:39,011 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:03:39,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-28.i [2025-01-09 10:03:39,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fcf31454/01ab0fef644947be8f047cb5c23829ec/FLAGcc4372998 [2025-01-09 10:03:39,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fcf31454/01ab0fef644947be8f047cb5c23829ec [2025-01-09 10:03:39,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:03:39,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:03:39,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:39,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:03:39,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:03:39,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:39" (1/1) ... [2025-01-09 10:03:39,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f8b2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:39, skipping insertion in model container [2025-01-09 10:03:39,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:39" (1/1) ... [2025-01-09 10:03:39,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:03:39,243 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-28.i[916,929] [2025-01-09 10:03:39,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:39,431 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:03:39,439 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-28.i[916,929] [2025-01-09 10:03:39,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:39,533 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:03:39,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:39 WrapperNode [2025-01-09 10:03:39,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:39,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:39,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:03:39,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:03:39,540 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:39" (1/1) ... [2025-01-09 10:03:39,553 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:39" (1/1) ... [2025-01-09 10:03:39,602 INFO L138 Inliner]: procedures = 26, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 980 [2025-01-09 10:03:39,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:39,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:03:39,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:03:39,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:03:39,610 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:39" (1/1) ... [2025-01-09 10:03:39,611 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:39" (1/1) ... [2025-01-09 10:03:39,628 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:39" (1/1) ... [2025-01-09 10:03:39,654 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:39,655 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:39" (1/1) ... [2025-01-09 10:03:39,655 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:39" (1/1) ... [2025-01-09 10:03:39,672 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:39" (1/1) ... [2025-01-09 10:03:39,675 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:39" (1/1) ... [2025-01-09 10:03:39,680 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:39" (1/1) ... [2025-01-09 10:03:39,686 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:39" (1/1) ... [2025-01-09 10:03:39,691 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:39" (1/1) ... [2025-01-09 10:03:39,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:03:39,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:03:39,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:03:39,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:03:39,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:39" (1/1) ... [2025-01-09 10:03:39,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:39,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:39,728 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:39,731 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:39,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:03:39,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:03:39,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:03:39,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:03:39,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:03:39,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:03:39,880 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:03:39,882 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:03:41,056 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-09 10:03:41,057 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:03:41,069 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:03:41,070 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:03:41,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:41 BoogieIcfgContainer [2025-01-09 10:03:41,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:03:41,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:03:41,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:03:41,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:03:41,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:03:39" (1/3) ... [2025-01-09 10:03:41,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c109ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:41, skipping insertion in model container [2025-01-09 10:03:41,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:39" (2/3) ... [2025-01-09 10:03:41,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c109ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:41, skipping insertion in model container [2025-01-09 10:03:41,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:41" (3/3) ... [2025-01-09 10:03:41,077 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-28.i [2025-01-09 10:03:41,088 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:03:41,091 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-28.i that has 2 procedures, 414 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:03:41,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:03:41,168 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;@416373ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:03:41,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:03:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 414 states, 283 states have (on average 1.558303886925795) internal successors, (441), 284 states have internal predecessors, (441), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 10:03:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2025-01-09 10:03:41,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:41,219 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:41,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash 658552875, now seen corresponding path program 1 times [2025-01-09 10:03:41,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:41,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696271501] [2025-01-09 10:03:41,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:41,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:41,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 804 statements into 1 equivalence classes. [2025-01-09 10:03:41,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 804 of 804 statements. [2025-01-09 10:03:41,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:41,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 32258 trivial. 0 not checked. [2025-01-09 10:03:41,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696271501] [2025-01-09 10:03:41,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696271501] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:03:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979482543] [2025-01-09 10:03:41,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:41,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:03:41,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:41,831 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:41,836 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:42,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 804 statements into 1 equivalence classes. [2025-01-09 10:03:42,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 804 of 804 statements. [2025-01-09 10:03:42,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:42,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:42,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1790 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:03:42,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:03:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 32258 trivial. 0 not checked. [2025-01-09 10:03:42,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:03:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979482543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:03:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:03:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509463543] [2025-01-09 10:03:42,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:42,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:03:42,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:42,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:03:42,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:03:42,472 INFO L87 Difference]: Start difference. First operand has 414 states, 283 states have (on average 1.558303886925795) internal successors, (441), 284 states have internal predecessors, (441), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) [2025-01-09 10:03:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:42,533 INFO L93 Difference]: Finished difference Result 805 states and 1487 transitions. [2025-01-09 10:03:42,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:03:42,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) Word has length 804 [2025-01-09 10:03:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:42,555 INFO L225 Difference]: With dead ends: 805 [2025-01-09 10:03:42,559 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 10:03:42,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 805 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:42,569 INFO L435 NwaCegarLoop]: 658 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, 658 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:42,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 658 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:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 10:03:42,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-01-09 10:03:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 264 states have (on average 1.5227272727272727) internal successors, (402), 264 states have internal predecessors, (402), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 10:03:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 658 transitions. [2025-01-09 10:03:42,650 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 658 transitions. Word has length 804 [2025-01-09 10:03:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:42,651 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 658 transitions. [2025-01-09 10:03:42,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) [2025-01-09 10:03:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 658 transitions. [2025-01-09 10:03:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-09 10:03:42,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:42,668 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:03:42,873 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:42,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:42,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:42,875 INFO L85 PathProgramCache]: Analyzing trace with hash 299878390, now seen corresponding path program 1 times [2025-01-09 10:03:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:42,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997749248] [2025-01-09 10:03:42,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:42,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:42,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-09 10:03:43,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-09 10:03:43,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:43,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-01-09 10:03:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:43,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997749248] [2025-01-09 10:03:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997749248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:43,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726830476] [2025-01-09 10:03:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:43,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:43,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:43,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:43,753 INFO L87 Difference]: Start difference. First operand 394 states and 658 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:43,865 INFO L93 Difference]: Finished difference Result 1176 states and 1968 transitions. [2025-01-09 10:03:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-01-09 10:03:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:43,874 INFO L225 Difference]: With dead ends: 1176 [2025-01-09 10:03:43,874 INFO L226 Difference]: Without dead ends: 785 [2025-01-09 10:03:43,875 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:43,876 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 642 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:43,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1300 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-01-09 10:03:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 783. [2025-01-09 10:03:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 524 states have (on average 1.5229007633587786) internal successors, (798), 524 states have internal predecessors, (798), 256 states have call successors, (256), 2 states have call predecessors, (256), 2 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2025-01-09 10:03:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1310 transitions. [2025-01-09 10:03:44,005 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1310 transitions. Word has length 805 [2025-01-09 10:03:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:44,010 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1310 transitions. [2025-01-09 10:03:44,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1310 transitions. [2025-01-09 10:03:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-09 10:03:44,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:44,020 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:03:44,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:44,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:44,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1751979958, now seen corresponding path program 1 times [2025-01-09 10:03:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:44,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016892849] [2025-01-09 10:03:44,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:44,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-09 10:03:44,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-09 10:03:44,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:44,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-01-09 10:03:44,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016892849] [2025-01-09 10:03:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016892849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:44,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:44,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:44,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758453057] [2025-01-09 10:03:44,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:44,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:44,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:44,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:44,479 INFO L87 Difference]: Start difference. First operand 783 states and 1310 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:44,596 INFO L93 Difference]: Finished difference Result 2039 states and 3420 transitions. [2025-01-09 10:03:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:44,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-01-09 10:03:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:44,611 INFO L225 Difference]: With dead ends: 2039 [2025-01-09 10:03:44,613 INFO L226 Difference]: Without dead ends: 1259 [2025-01-09 10:03:44,619 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:44,621 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 400 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:44,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1376 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-01-09 10:03:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1255. [2025-01-09 10:03:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 912 states have (on average 1.5657894736842106) internal successors, (1428), 914 states have internal predecessors, (1428), 338 states have call successors, (338), 4 states have call predecessors, (338), 4 states have return successors, (338), 336 states have call predecessors, (338), 338 states have call successors, (338) [2025-01-09 10:03:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 2104 transitions. [2025-01-09 10:03:44,773 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 2104 transitions. Word has length 805 [2025-01-09 10:03:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:44,775 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 2104 transitions. [2025-01-09 10:03:44,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2104 transitions. [2025-01-09 10:03:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-09 10:03:44,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:44,784 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:03:44,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:44,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:44,786 INFO L85 PathProgramCache]: Analyzing trace with hash -402001358, now seen corresponding path program 1 times [2025-01-09 10:03:44,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:44,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700079609] [2025-01-09 10:03:44,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:44,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:44,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-09 10:03:44,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-09 10:03:44,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:44,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-01-09 10:03:45,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700079609] [2025-01-09 10:03:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700079609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:45,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066154861] [2025-01-09 10:03:45,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:45,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:45,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:45,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:45,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:45,098 INFO L87 Difference]: Start difference. First operand 1255 states and 2104 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:45,215 INFO L93 Difference]: Finished difference Result 3755 states and 6298 transitions. [2025-01-09 10:03:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:45,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-01-09 10:03:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:45,234 INFO L225 Difference]: With dead ends: 3755 [2025-01-09 10:03:45,234 INFO L226 Difference]: Without dead ends: 2503 [2025-01-09 10:03:45,240 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,243 INFO L435 NwaCegarLoop]: 1181 mSDtfsCounter, 633 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:45,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1829 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2025-01-09 10:03:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1567. [2025-01-09 10:03:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1224 states have (on average 1.6143790849673203) internal successors, (1976), 1226 states have internal predecessors, (1976), 338 states have call successors, (338), 4 states have call predecessors, (338), 4 states have return successors, (338), 336 states have call predecessors, (338), 338 states have call successors, (338) [2025-01-09 10:03:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2652 transitions. [2025-01-09 10:03:45,436 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2652 transitions. Word has length 805 [2025-01-09 10:03:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:45,438 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2652 transitions. [2025-01-09 10:03:45,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2652 transitions. [2025-01-09 10:03:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-09 10:03:45,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:45,445 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:03:45,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:45,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash 858915892, now seen corresponding path program 1 times [2025-01-09 10:03:45,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:45,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604660460] [2025-01-09 10:03:45,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:45,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:45,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-09 10:03:45,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-09 10:03:45,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:45,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-01-09 10:03:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:45,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604660460] [2025-01-09 10:03:45,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604660460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:45,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:45,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387678444] [2025-01-09 10:03:45,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:45,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:45,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:45,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:45,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:45,762 INFO L87 Difference]: Start difference. First operand 1567 states and 2652 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:45,894 INFO L93 Difference]: Finished difference Result 4067 states and 6834 transitions. [2025-01-09 10:03:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-01-09 10:03:45,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:45,916 INFO L225 Difference]: With dead ends: 4067 [2025-01-09 10:03:45,916 INFO L226 Difference]: Without dead ends: 2503 [2025-01-09 10:03:45,923 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,924 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 623 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:45,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1366 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:45,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2025-01-09 10:03:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1567. [2025-01-09 10:03:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1224 states have (on average 1.607843137254902) internal successors, (1968), 1226 states have internal predecessors, (1968), 338 states have call successors, (338), 4 states have call predecessors, (338), 4 states have return successors, (338), 336 states have call predecessors, (338), 338 states have call successors, (338) [2025-01-09 10:03:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2644 transitions. [2025-01-09 10:03:46,172 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2644 transitions. Word has length 805 [2025-01-09 10:03:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:46,173 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2644 transitions. [2025-01-09 10:03:46,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2644 transitions. [2025-01-09 10:03:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-09 10:03:46,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:46,184 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:03:46,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:46,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:46,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1512823370, now seen corresponding path program 1 times [2025-01-09 10:03:46,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:46,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731766007] [2025-01-09 10:03:46,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:46,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:46,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-09 10:03:46,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-09 10:03:46,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:46,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-01-09 10:03:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:46,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731766007] [2025-01-09 10:03:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731766007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:46,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800047607] [2025-01-09 10:03:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:46,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:46,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:46,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:46,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:46,416 INFO L87 Difference]: Start difference. First operand 1567 states and 2644 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:46,543 INFO L93 Difference]: Finished difference Result 4357 states and 7340 transitions. [2025-01-09 10:03:46,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:46,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-01-09 10:03:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:46,558 INFO L225 Difference]: With dead ends: 4357 [2025-01-09 10:03:46,559 INFO L226 Difference]: Without dead ends: 2793 [2025-01-09 10:03:46,562 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,563 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 397 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:46,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1506 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2025-01-09 10:03:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2789. [2025-01-09 10:03:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2200 states have (on average 1.6018181818181818) internal successors, (3524), 2206 states have internal predecessors, (3524), 580 states have call successors, (580), 8 states have call predecessors, (580), 8 states have return successors, (580), 574 states have call predecessors, (580), 580 states have call successors, (580) [2025-01-09 10:03:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4684 transitions. [2025-01-09 10:03:46,726 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4684 transitions. Word has length 805 [2025-01-09 10:03:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:46,727 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4684 transitions. [2025-01-09 10:03:46,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4684 transitions. [2025-01-09 10:03:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-09 10:03:46,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:46,735 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:03:46,735 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:46,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:46,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1646836876, now seen corresponding path program 1 times [2025-01-09 10:03:46,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:46,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731712579] [2025-01-09 10:03:46,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:46,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:46,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-09 10:03:46,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-09 10:03:46,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:46,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-01-09 10:03:47,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:47,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731712579] [2025-01-09 10:03:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731712579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:47,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:47,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747523998] [2025-01-09 10:03:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:47,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:47,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:47,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:47,026 INFO L87 Difference]: Start difference. First operand 2789 states and 4684 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:47,194 INFO L93 Difference]: Finished difference Result 7615 states and 12752 transitions. [2025-01-09 10:03:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:47,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-01-09 10:03:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:47,222 INFO L225 Difference]: With dead ends: 7615 [2025-01-09 10:03:47,223 INFO L226 Difference]: Without dead ends: 4829 [2025-01-09 10:03:47,232 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:47,233 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 359 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1295 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:47,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1295 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:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4829 states. [2025-01-09 10:03:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4829 to 4825. [2025-01-09 10:03:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4825 states, 3732 states have (on average 1.5744908896034298) internal successors, (5876), 3746 states have internal predecessors, (5876), 1076 states have call successors, (1076), 16 states have call predecessors, (1076), 16 states have return successors, (1076), 1062 states have call predecessors, (1076), 1076 states have call successors, (1076) [2025-01-09 10:03:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 8028 transitions. [2025-01-09 10:03:47,624 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 8028 transitions. Word has length 805 [2025-01-09 10:03:47,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:47,625 INFO L471 AbstractCegarLoop]: Abstraction has 4825 states and 8028 transitions. [2025-01-09 10:03:47,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 8028 transitions. [2025-01-09 10:03:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-09 10:03:47,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:47,640 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:03:47,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:47,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1224135050, now seen corresponding path program 1 times [2025-01-09 10:03:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:47,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515745586] [2025-01-09 10:03:47,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:47,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:47,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-09 10:03:47,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-09 10:03:47,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:47,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-01-09 10:03:48,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:48,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515745586] [2025-01-09 10:03:48,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515745586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:48,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:48,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:48,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003748627] [2025-01-09 10:03:48,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:48,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:48,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:48,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:48,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:48,036 INFO L87 Difference]: Start difference. First operand 4825 states and 8028 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:48,187 INFO L93 Difference]: Finished difference Result 9679 states and 16117 transitions. [2025-01-09 10:03:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-01-09 10:03:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:48,214 INFO L225 Difference]: With dead ends: 9679 [2025-01-09 10:03:48,214 INFO L226 Difference]: Without dead ends: 4857 [2025-01-09 10:03:48,226 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:48,227 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 0 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:48,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1308 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2025-01-09 10:03:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 4857. [2025-01-09 10:03:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4857 states, 3764 states have (on average 1.569606801275239) internal successors, (5908), 3778 states have internal predecessors, (5908), 1076 states have call successors, (1076), 16 states have call predecessors, (1076), 16 states have return successors, (1076), 1062 states have call predecessors, (1076), 1076 states have call successors, (1076) [2025-01-09 10:03:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4857 states to 4857 states and 8060 transitions. [2025-01-09 10:03:48,525 INFO L78 Accepts]: Start accepts. Automaton has 4857 states and 8060 transitions. Word has length 805 [2025-01-09 10:03:48,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:48,526 INFO L471 AbstractCegarLoop]: Abstraction has 4857 states and 8060 transitions. [2025-01-09 10:03:48,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4857 states and 8060 transitions. [2025-01-09 10:03:48,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-09 10:03:48,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:48,535 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:03:48,535 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:48,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2121528328, now seen corresponding path program 1 times [2025-01-09 10:03:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:48,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97693618] [2025-01-09 10:03:48,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:48,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-09 10:03:48,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-09 10:03:48,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:48,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-01-09 10:03:49,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:49,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97693618] [2025-01-09 10:03:49,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97693618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:49,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:49,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:49,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881707134] [2025-01-09 10:03:49,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:49,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:49,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:49,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:49,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:49,219 INFO L87 Difference]: Start difference. First operand 4857 states and 8060 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:49,540 INFO L93 Difference]: Finished difference Result 13469 states and 22294 transitions. [2025-01-09 10:03:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:49,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-01-09 10:03:49,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:49,616 INFO L225 Difference]: With dead ends: 13469 [2025-01-09 10:03:49,616 INFO L226 Difference]: Without dead ends: 8615 [2025-01-09 10:03:49,626 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:49,627 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 416 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:49,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1371 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8615 states. [2025-01-09 10:03:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8615 to 8613. [2025-01-09 10:03:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8613 states, 6428 states have (on average 1.5413814561294337) internal successors, (9908), 6456 states have internal predecessors, (9908), 2152 states have call successors, (2152), 32 states have call predecessors, (2152), 32 states have return successors, (2152), 2124 states have call predecessors, (2152), 2152 states have call successors, (2152) [2025-01-09 10:03:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 14212 transitions. [2025-01-09 10:03:50,358 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 14212 transitions. Word has length 805 [2025-01-09 10:03:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:50,359 INFO L471 AbstractCegarLoop]: Abstraction has 8613 states and 14212 transitions. [2025-01-09 10:03:50,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:03:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 14212 transitions. [2025-01-09 10:03:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-09 10:03:50,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:50,370 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:03:50,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:50,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2080853578, now seen corresponding path program 1 times [2025-01-09 10:03:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:50,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108083754] [2025-01-09 10:03:50,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:50,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:50,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-09 10:03:50,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-09 10:03:50,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:50,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-01-09 10:03:53,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:53,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108083754] [2025-01-09 10:03:53,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108083754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:53,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:53,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:03:53,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699488273] [2025-01-09 10:03:53,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:53,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:03:53,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:53,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:03:53,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:03:53,669 INFO L87 Difference]: Start difference. First operand 8613 states and 14212 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:04:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:03,155 INFO L93 Difference]: Finished difference Result 68218 states and 111754 transitions. [2025-01-09 10:04:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:04:03,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-01-09 10:04:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:03,359 INFO L225 Difference]: With dead ends: 68218 [2025-01-09 10:04:03,359 INFO L226 Difference]: Without dead ends: 59608 [2025-01-09 10:04:03,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2025-01-09 10:04:03,412 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 6231 mSDsluCounter, 4758 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 1020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6231 SdHoareTripleChecker+Valid, 5456 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1020 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:03,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6231 Valid, 5456 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1020 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 10:04:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59608 states. [2025-01-09 10:04:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59608 to 29109. [2025-01-09 10:04:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29109 states, 23474 states have (on average 1.5716111442446963) internal successors, (36892), 23599 states have internal predecessors, (36892), 5473 states have call successors, (5473), 161 states have call predecessors, (5473), 161 states have return successors, (5473), 5348 states have call predecessors, (5473), 5473 states have call successors, (5473) [2025-01-09 10:04:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29109 states to 29109 states and 47838 transitions. [2025-01-09 10:04:06,707 INFO L78 Accepts]: Start accepts. Automaton has 29109 states and 47838 transitions. Word has length 805 [2025-01-09 10:04:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:06,708 INFO L471 AbstractCegarLoop]: Abstraction has 29109 states and 47838 transitions. [2025-01-09 10:04:06,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:04:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 29109 states and 47838 transitions. [2025-01-09 10:04:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-09 10:04:06,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:06,745 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:04:06,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:06,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1727765196, now seen corresponding path program 1 times [2025-01-09 10:04:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:06,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657178866] [2025-01-09 10:04:06,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:06,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:06,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-09 10:04:07,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-09 10:04:07,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:07,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2025-01-09 10:04:11,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:11,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657178866] [2025-01-09 10:04:11,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657178866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:11,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:11,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 10:04:11,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487604616] [2025-01-09 10:04:11,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:11,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:04:11,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:11,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:04:11,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:04:11,008 INFO L87 Difference]: Start difference. First operand 29109 states and 47838 transitions. Second operand has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:04:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:36,972 INFO L93 Difference]: Finished difference Result 140469 states and 229461 transitions. [2025-01-09 10:04:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:04:36,973 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 805 [2025-01-09 10:04:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:37,308 INFO L225 Difference]: With dead ends: 140469 [2025-01-09 10:04:37,308 INFO L226 Difference]: Without dead ends: 111409 [2025-01-09 10:04:37,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-01-09 10:04:37,378 INFO L435 NwaCegarLoop]: 1143 mSDtfsCounter, 3669 mSDsluCounter, 5896 mSDsCounter, 0 mSdLazyCounter, 3117 mSolverCounterSat, 1059 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3669 SdHoareTripleChecker+Valid, 7039 SdHoareTripleChecker+Invalid, 4176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1059 IncrementalHoareTripleChecker+Valid, 3117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:37,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3669 Valid, 7039 Invalid, 4176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1059 Valid, 3117 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-01-09 10:04:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111409 states. [2025-01-09 10:04:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111409 to 47635. [2025-01-09 10:04:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47635 states, 38218 states have (on average 1.5639750902715999) internal successors, (59772), 38438 states have internal predecessors, (59772), 9096 states have call successors, (9096), 320 states have call predecessors, (9096), 320 states have return successors, (9096), 8876 states have call predecessors, (9096), 9096 states have call successors, (9096) [2025-01-09 10:04:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47635 states to 47635 states and 77964 transitions. [2025-01-09 10:04:46,039 INFO L78 Accepts]: Start accepts. Automaton has 47635 states and 77964 transitions. Word has length 805 [2025-01-09 10:04:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:46,042 INFO L471 AbstractCegarLoop]: Abstraction has 47635 states and 77964 transitions. [2025-01-09 10:04:46,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 1 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-01-09 10:04:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 47635 states and 77964 transitions. [2025-01-09 10:04:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-01-09 10:04:46,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:46,080 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:04:46,081 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:46,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1482146292, now seen corresponding path program 1 times [2025-01-09 10:04:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:46,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009980718] [2025-01-09 10:04:46,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:46,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-01-09 10:04:46,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-01-09 10:04:46,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:46,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat