./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-97.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-97.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 1168304632f0077b83496b9ac9fcc9f4b7202af110e2ee289e9a700c4c953dc1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:09:58,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:09:58,960 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:09:58,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:09:58,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:09:58,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:09:58,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:09:58,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:09:58,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:09:58,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:09:58,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:09:58,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:09:58,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:09:58,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:09:58,996 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:09:58,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:09:58,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:09:58,997 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:09:58,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:09:58,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:09:58,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:09:58,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:09:58,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:09:58,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:09:58,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:09:58,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:09:58,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:09:58,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:09:58,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:09:58,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:09:58,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:09:58,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:09:58,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:58,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:09:58,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:09:58,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:09:58,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:09:58,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:58,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:09:58,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:09:58,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:09:59,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:09:59,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:09:59,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:09:59,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:09:59,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:09:59,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:09:59,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:09:59,000 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 -> 1168304632f0077b83496b9ac9fcc9f4b7202af110e2ee289e9a700c4c953dc1 [2025-01-09 10:09:59,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:09:59,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:09:59,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:09:59,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:09:59,199 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:09:59,200 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-97.i [2025-01-09 10:10:00,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76b81fc0a/f854c52b744940f08a0c72b19bbac350/FLAG93ce55708 [2025-01-09 10:10:00,748 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:10:00,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-97.i [2025-01-09 10:10:00,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76b81fc0a/f854c52b744940f08a0c72b19bbac350/FLAG93ce55708 [2025-01-09 10:10:00,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76b81fc0a/f854c52b744940f08a0c72b19bbac350 [2025-01-09 10:10:00,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:10:00,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:10:00,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:10:00,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:10:00,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:10:00,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:10:00" (1/1) ... [2025-01-09 10:10:00,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@940d15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:00, skipping insertion in model container [2025-01-09 10:10:00,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:10:00" (1/1) ... [2025-01-09 10:10:01,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:10:01,194 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-97.i[916,929] [2025-01-09 10:10:01,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:10:01,377 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:10:01,384 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-97.i[916,929] [2025-01-09 10:10:01,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:10:01,450 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:10:01,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01 WrapperNode [2025-01-09 10:10:01,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:10:01,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:10:01,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:10:01,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:10:01,464 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:10:01" (1/1) ... [2025-01-09 10:10:01,486 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:10:01" (1/1) ... [2025-01-09 10:10:01,560 INFO L138 Inliner]: procedures = 26, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 850 [2025-01-09 10:10:01,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:10:01,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:10:01,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:10:01,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:10:01,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (1/1) ... [2025-01-09 10:10:01,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (1/1) ... [2025-01-09 10:10:01,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (1/1) ... [2025-01-09 10:10:01,637 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:10:01,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (1/1) ... [2025-01-09 10:10:01,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (1/1) ... [2025-01-09 10:10:01,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (1/1) ... [2025-01-09 10:10:01,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (1/1) ... [2025-01-09 10:10:01,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (1/1) ... [2025-01-09 10:10:01,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (1/1) ... [2025-01-09 10:10:01,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (1/1) ... [2025-01-09 10:10:01,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:10:01,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:10:01,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:10:01,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:10:01,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (1/1) ... [2025-01-09 10:10:01,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:10:01,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:10:01,769 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:10:01,815 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:10:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:10:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:10:01,831 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:10:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:10:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:10:01,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:10:01,935 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:10:01,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:10:03,034 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-01-09 10:10:03,034 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:10:03,054 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:10:03,054 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:10:03,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:03 BoogieIcfgContainer [2025-01-09 10:10:03,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:10:03,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:10:03,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:10:03,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:10:03,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:10:00" (1/3) ... [2025-01-09 10:10:03,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2975cdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:10:03, skipping insertion in model container [2025-01-09 10:10:03,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:01" (2/3) ... [2025-01-09 10:10:03,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2975cdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:10:03, skipping insertion in model container [2025-01-09 10:10:03,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:03" (3/3) ... [2025-01-09 10:10:03,061 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-97.i [2025-01-09 10:10:03,071 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:10:03,074 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-97.i that has 2 procedures, 341 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:10:03,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:10:03,128 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;@1cf20704, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:10:03,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:10:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 341 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 242 states have internal predecessors, (379), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2025-01-09 10:10:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-01-09 10:10:03,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:03,157 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:03,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:03,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:03,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2114229308, now seen corresponding path program 1 times [2025-01-09 10:10:03,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:03,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060424412] [2025-01-09 10:10:03,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:03,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:03,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-01-09 10:10:03,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-01-09 10:10:03,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:03,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:03,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:03,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060424412] [2025-01-09 10:10:03,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060424412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:03,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:10:03,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276826823] [2025-01-09 10:10:03,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:03,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:10:03,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:03,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:10:03,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:10:03,886 INFO L87 Difference]: Start difference. First operand has 341 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 242 states have internal predecessors, (379), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:03,972 INFO L93 Difference]: Finished difference Result 676 states and 1238 transitions. [2025-01-09 10:10:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:10:03,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 630 [2025-01-09 10:10:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:03,986 INFO L225 Difference]: With dead ends: 676 [2025-01-09 10:10:03,987 INFO L226 Difference]: Without dead ends: 338 [2025-01-09 10:10:03,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:10:03,998 INFO L435 NwaCegarLoop]: 566 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, 566 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:10:03,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-01-09 10:10:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-01-09 10:10:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 239 states have (on average 1.5564853556485356) internal successors, (372), 239 states have internal predecessors, (372), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2025-01-09 10:10:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 566 transitions. [2025-01-09 10:10:04,085 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 566 transitions. Word has length 630 [2025-01-09 10:10:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:04,087 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 566 transitions. [2025-01-09 10:10:04,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 566 transitions. [2025-01-09 10:10:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-01-09 10:10:04,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:04,099 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 10:10:04,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:04,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1341704326, now seen corresponding path program 1 times [2025-01-09 10:10:04,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:04,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025556291] [2025-01-09 10:10:04,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:04,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:04,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-01-09 10:10:04,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-01-09 10:10:04,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:04,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:04,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025556291] [2025-01-09 10:10:04,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025556291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:04,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488420668] [2025-01-09 10:10:04,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:04,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:04,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:04,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:04,761 INFO L87 Difference]: Start difference. First operand 338 states and 566 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:04,824 INFO L93 Difference]: Finished difference Result 871 states and 1467 transitions. [2025-01-09 10:10:04,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:04,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 630 [2025-01-09 10:10:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:04,829 INFO L225 Difference]: With dead ends: 871 [2025-01-09 10:10:04,829 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 10:10:04,830 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:10:04,831 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 344 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:04,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1443 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 10:10:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2025-01-09 10:10:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 417 states have (on average 1.6163069544364508) internal successors, (674), 418 states have internal predecessors, (674), 113 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-01-09 10:10:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 900 transitions. [2025-01-09 10:10:04,879 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 900 transitions. Word has length 630 [2025-01-09 10:10:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:04,880 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 900 transitions. [2025-01-09 10:10:04,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 900 transitions. [2025-01-09 10:10:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:10:04,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:04,889 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:10:04,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:04,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash -708134807, now seen corresponding path program 1 times [2025-01-09 10:10:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:04,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116340004] [2025-01-09 10:10:04,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:04,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:04,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:10:04,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:10:04,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:04,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:05,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:05,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116340004] [2025-01-09 10:10:05,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116340004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:05,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:05,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:05,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710524165] [2025-01-09 10:10:05,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:05,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:05,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:05,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:05,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:05,243 INFO L87 Difference]: Start difference. First operand 533 states and 900 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:05,299 INFO L93 Difference]: Finished difference Result 1464 states and 2478 transitions. [2025-01-09 10:10:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:05,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:10:05,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:05,310 INFO L225 Difference]: With dead ends: 1464 [2025-01-09 10:10:05,311 INFO L226 Difference]: Without dead ends: 934 [2025-01-09 10:10:05,313 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:10:05,315 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 366 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:05,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1246 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:05,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-01-09 10:10:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 931. [2025-01-09 10:10:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 755 states have (on average 1.6304635761589403) internal successors, (1231), 758 states have internal predecessors, (1231), 171 states have call successors, (171), 4 states have call predecessors, (171), 4 states have return successors, (171), 168 states have call predecessors, (171), 171 states have call successors, (171) [2025-01-09 10:10:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1573 transitions. [2025-01-09 10:10:05,390 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1573 transitions. Word has length 631 [2025-01-09 10:10:05,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:05,392 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1573 transitions. [2025-01-09 10:10:05,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1573 transitions. [2025-01-09 10:10:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:10:05,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:05,401 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:05,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:10:05,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:05,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:05,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1200760981, now seen corresponding path program 1 times [2025-01-09 10:10:05,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:05,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864645103] [2025-01-09 10:10:05,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:05,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:10:05,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:10:05,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:05,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:05,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:05,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864645103] [2025-01-09 10:10:05,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864645103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:05,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:05,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924790633] [2025-01-09 10:10:05,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:05,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:05,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:05,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:05,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:05,732 INFO L87 Difference]: Start difference. First operand 931 states and 1573 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:05,843 INFO L93 Difference]: Finished difference Result 1866 states and 3148 transitions. [2025-01-09 10:10:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:05,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:10:05,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:05,851 INFO L225 Difference]: With dead ends: 1866 [2025-01-09 10:10:05,851 INFO L226 Difference]: Without dead ends: 938 [2025-01-09 10:10:05,853 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:10:05,854 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 352 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:05,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1138 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-01-09 10:10:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 585. [2025-01-09 10:10:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 468 states have (on average 1.6175213675213675) internal successors, (757), 469 states have internal predecessors, (757), 113 states have call successors, (113), 3 states have call predecessors, (113), 3 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-01-09 10:10:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 983 transitions. [2025-01-09 10:10:05,908 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 983 transitions. Word has length 631 [2025-01-09 10:10:05,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:05,910 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 983 transitions. [2025-01-09 10:10:05,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 983 transitions. [2025-01-09 10:10:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:10:05,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:05,915 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:05,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:10:05,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:05,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash -640061203, now seen corresponding path program 1 times [2025-01-09 10:10:05,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:05,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234761551] [2025-01-09 10:10:05,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:05,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:05,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:10:06,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:10:06,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:06,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:06,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234761551] [2025-01-09 10:10:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234761551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:06,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:06,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19006123] [2025-01-09 10:10:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:06,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:06,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:06,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:06,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:06,194 INFO L87 Difference]: Start difference. First operand 585 states and 983 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:06,266 INFO L93 Difference]: Finished difference Result 1538 states and 2579 transitions. [2025-01-09 10:10:06,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:06,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:10:06,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:06,272 INFO L225 Difference]: With dead ends: 1538 [2025-01-09 10:10:06,272 INFO L226 Difference]: Without dead ends: 956 [2025-01-09 10:10:06,274 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:10:06,274 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 322 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:06,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1258 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-01-09 10:10:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 953. [2025-01-09 10:10:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 759 states have (on average 1.598155467720685) internal successors, (1213), 762 states have internal predecessors, (1213), 187 states have call successors, (187), 6 states have call predecessors, (187), 6 states have return successors, (187), 184 states have call predecessors, (187), 187 states have call successors, (187) [2025-01-09 10:10:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1587 transitions. [2025-01-09 10:10:06,318 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1587 transitions. Word has length 631 [2025-01-09 10:10:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:06,319 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1587 transitions. [2025-01-09 10:10:06,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1587 transitions. [2025-01-09 10:10:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:10:06,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:06,325 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:06,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:10:06,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:06,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:06,327 INFO L85 PathProgramCache]: Analyzing trace with hash 746142191, now seen corresponding path program 1 times [2025-01-09 10:10:06,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:06,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806934974] [2025-01-09 10:10:06,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:06,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:06,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:10:06,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:10:06,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:06,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:06,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:06,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806934974] [2025-01-09 10:10:06,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806934974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:06,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:06,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:10:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932160071] [2025-01-09 10:10:06,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:06,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:10:06,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:06,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:10:06,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:10:06,814 INFO L87 Difference]: Start difference. First operand 953 states and 1587 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:07,232 INFO L93 Difference]: Finished difference Result 2833 states and 4723 transitions. [2025-01-09 10:10:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:10:07,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:10:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:07,245 INFO L225 Difference]: With dead ends: 2833 [2025-01-09 10:10:07,245 INFO L226 Difference]: Without dead ends: 1883 [2025-01-09 10:10:07,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:10:07,249 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 544 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:07,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1482 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:10:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2025-01-09 10:10:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1033. [2025-01-09 10:10:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 839 states have (on average 1.6269368295589988) internal successors, (1365), 842 states have internal predecessors, (1365), 187 states have call successors, (187), 6 states have call predecessors, (187), 6 states have return successors, (187), 184 states have call predecessors, (187), 187 states have call successors, (187) [2025-01-09 10:10:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1739 transitions. [2025-01-09 10:10:07,331 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1739 transitions. Word has length 631 [2025-01-09 10:10:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:07,333 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1739 transitions. [2025-01-09 10:10:07,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1739 transitions. [2025-01-09 10:10:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:10:07,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:07,340 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:07,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:10:07,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:07,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1303245651, now seen corresponding path program 1 times [2025-01-09 10:10:07,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:07,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717163788] [2025-01-09 10:10:07,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:07,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:10:07,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:10:07,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:07,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:08,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:08,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717163788] [2025-01-09 10:10:08,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717163788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:08,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:08,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:10:08,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947725550] [2025-01-09 10:10:08,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:08,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:10:08,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:08,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:10:08,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:10:08,040 INFO L87 Difference]: Start difference. First operand 1033 states and 1739 transitions. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:08,960 INFO L93 Difference]: Finished difference Result 4175 states and 6962 transitions. [2025-01-09 10:10:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:10:08,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:10:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:08,977 INFO L225 Difference]: With dead ends: 4175 [2025-01-09 10:10:08,978 INFO L226 Difference]: Without dead ends: 3145 [2025-01-09 10:10:08,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:10:08,983 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1839 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:08,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1839 Valid, 1645 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:10:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2025-01-09 10:10:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 2633. [2025-01-09 10:10:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2191 states have (on average 1.627110908261068) internal successors, (3565), 2202 states have internal predecessors, (3565), 423 states have call successors, (423), 18 states have call predecessors, (423), 18 states have return successors, (423), 412 states have call predecessors, (423), 423 states have call successors, (423) [2025-01-09 10:10:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 4411 transitions. [2025-01-09 10:10:09,110 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 4411 transitions. Word has length 631 [2025-01-09 10:10:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:09,111 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 4411 transitions. [2025-01-09 10:10:09,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 4411 transitions. [2025-01-09 10:10:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:10:09,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:09,118 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:09,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:10:09,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:09,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2120894101, now seen corresponding path program 1 times [2025-01-09 10:10:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:09,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716106168] [2025-01-09 10:10:09,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:09,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:09,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:10:09,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:10:09,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:09,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:09,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:09,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716106168] [2025-01-09 10:10:09,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716106168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:09,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:09,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:10:09,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752785068] [2025-01-09 10:10:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:09,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:10:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:09,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:10:09,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:10:09,603 INFO L87 Difference]: Start difference. First operand 2633 states and 4411 transitions. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 2 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2025-01-09 10:10:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:10,765 INFO L93 Difference]: Finished difference Result 10137 states and 17014 transitions. [2025-01-09 10:10:10,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:10:10,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 2 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) Word has length 631 [2025-01-09 10:10:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:10,805 INFO L225 Difference]: With dead ends: 10137 [2025-01-09 10:10:10,805 INFO L226 Difference]: Without dead ends: 7507 [2025-01-09 10:10:10,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:10:10,814 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 949 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 2997 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:10,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 2997 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:10:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7507 states. [2025-01-09 10:10:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7507 to 7497. [2025-01-09 10:10:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7497 states, 6308 states have (on average 1.6318960050729232) internal successors, (10294), 6342 states have internal predecessors, (10294), 1140 states have call successors, (1140), 48 states have call predecessors, (1140), 48 states have return successors, (1140), 1106 states have call predecessors, (1140), 1140 states have call successors, (1140) [2025-01-09 10:10:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7497 states to 7497 states and 12574 transitions. [2025-01-09 10:10:11,225 INFO L78 Accepts]: Start accepts. Automaton has 7497 states and 12574 transitions. Word has length 631 [2025-01-09 10:10:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:11,226 INFO L471 AbstractCegarLoop]: Abstraction has 7497 states and 12574 transitions. [2025-01-09 10:10:11,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 2 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2025-01-09 10:10:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 7497 states and 12574 transitions. [2025-01-09 10:10:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:10:11,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:11,243 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:11,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:10:11,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:11,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2066501203, now seen corresponding path program 1 times [2025-01-09 10:10:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036212749] [2025-01-09 10:10:11,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:11,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:11,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:10:11,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:10:11,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:11,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:11,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:11,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036212749] [2025-01-09 10:10:11,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036212749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:11,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:10:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034828623] [2025-01-09 10:10:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:11,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:10:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:11,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:10:11,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:10:11,778 INFO L87 Difference]: Start difference. First operand 7497 states and 12574 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:12,456 INFO L93 Difference]: Finished difference Result 20869 states and 35099 transitions. [2025-01-09 10:10:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:10:12,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:10:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:12,514 INFO L225 Difference]: With dead ends: 20869 [2025-01-09 10:10:12,515 INFO L226 Difference]: Without dead ends: 13375 [2025-01-09 10:10:12,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:10:12,536 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 727 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:12,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2198 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:10:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13375 states. [2025-01-09 10:10:13,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13375 to 13359. [2025-01-09 10:10:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13359 states, 11636 states have (on average 1.6491921622550705) internal successors, (19190), 11694 states have internal predecessors, (19190), 1650 states have call successors, (1650), 72 states have call predecessors, (1650), 72 states have return successors, (1650), 1592 states have call predecessors, (1650), 1650 states have call successors, (1650) [2025-01-09 10:10:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13359 states to 13359 states and 22490 transitions. [2025-01-09 10:10:13,224 INFO L78 Accepts]: Start accepts. Automaton has 13359 states and 22490 transitions. Word has length 631 [2025-01-09 10:10:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:13,225 INFO L471 AbstractCegarLoop]: Abstraction has 13359 states and 22490 transitions. [2025-01-09 10:10:13,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 13359 states and 22490 transitions. [2025-01-09 10:10:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:10:13,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:13,251 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:13,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:10:13,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:13,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:13,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1063005905, now seen corresponding path program 1 times [2025-01-09 10:10:13,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:13,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080922241] [2025-01-09 10:10:13,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:13,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:13,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:10:13,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:10:13,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:13,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:13,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080922241] [2025-01-09 10:10:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080922241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:13,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:13,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:13,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385402852] [2025-01-09 10:10:13,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:13,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:13,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:13,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:13,793 INFO L87 Difference]: Start difference. First operand 13359 states and 22490 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:14,276 INFO L93 Difference]: Finished difference Result 30859 states and 51828 transitions. [2025-01-09 10:10:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:14,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:10:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:14,343 INFO L225 Difference]: With dead ends: 30859 [2025-01-09 10:10:14,343 INFO L226 Difference]: Without dead ends: 17503 [2025-01-09 10:10:14,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:14,374 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 379 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:14,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1285 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2025-01-09 10:10:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17501. [2025-01-09 10:10:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17501 states, 14890 states have (on average 1.6311618535930155) internal successors, (24288), 14971 states have internal predecessors, (24288), 2502 states have call successors, (2502), 108 states have call predecessors, (2502), 108 states have return successors, (2502), 2421 states have call predecessors, (2502), 2502 states have call successors, (2502) [2025-01-09 10:10:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17501 states to 17501 states and 29292 transitions. [2025-01-09 10:10:15,102 INFO L78 Accepts]: Start accepts. Automaton has 17501 states and 29292 transitions. Word has length 631 [2025-01-09 10:10:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:15,103 INFO L471 AbstractCegarLoop]: Abstraction has 17501 states and 29292 transitions. [2025-01-09 10:10:15,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 17501 states and 29292 transitions. [2025-01-09 10:10:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:10:15,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:15,120 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:15,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:10:15,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:15,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2122099221, now seen corresponding path program 1 times [2025-01-09 10:10:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:15,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150824671] [2025-01-09 10:10:15,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:15,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:10:15,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:10:15,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:15,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:15,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:15,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150824671] [2025-01-09 10:10:15,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150824671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:15,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:15,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:10:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649825336] [2025-01-09 10:10:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:15,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:10:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:15,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:10:15,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:10:15,618 INFO L87 Difference]: Start difference. First operand 17501 states and 29292 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:18,258 INFO L93 Difference]: Finished difference Result 85073 states and 140669 transitions. [2025-01-09 10:10:18,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:10:18,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:10:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:18,476 INFO L225 Difference]: With dead ends: 85073 [2025-01-09 10:10:18,477 INFO L226 Difference]: Without dead ends: 67657 [2025-01-09 10:10:18,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:10:18,525 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 1452 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:18,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 2363 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:10:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67657 states. [2025-01-09 10:10:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67657 to 59129. [2025-01-09 10:10:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59129 states, 49946 states have (on average 1.611740679934329) internal successors, (80500), 50275 states have internal predecessors, (80500), 8802 states have call successors, (8802), 380 states have call predecessors, (8802), 380 states have return successors, (8802), 8473 states have call predecessors, (8802), 8802 states have call successors, (8802) [2025-01-09 10:10:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59129 states to 59129 states and 98104 transitions. [2025-01-09 10:10:20,913 INFO L78 Accepts]: Start accepts. Automaton has 59129 states and 98104 transitions. Word has length 631 [2025-01-09 10:10:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:20,914 INFO L471 AbstractCegarLoop]: Abstraction has 59129 states and 98104 transitions. [2025-01-09 10:10:20,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 59129 states and 98104 transitions. [2025-01-09 10:10:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:10:20,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:20,968 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:20,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:10:20,970 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:20,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1663394985, now seen corresponding path program 1 times [2025-01-09 10:10:20,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:20,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948155125] [2025-01-09 10:10:20,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:20,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:21,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:10:21,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:10:21,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:21,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:21,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948155125] [2025-01-09 10:10:21,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948155125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:21,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:21,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:10:21,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379935083] [2025-01-09 10:10:21,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:21,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:10:21,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:21,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:10:21,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:10:21,668 INFO L87 Difference]: Start difference. First operand 59129 states and 98104 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:25,976 INFO L93 Difference]: Finished difference Result 195701 states and 326575 transitions. [2025-01-09 10:10:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:10:25,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:10:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:26,444 INFO L225 Difference]: With dead ends: 195701 [2025-01-09 10:10:26,444 INFO L226 Difference]: Without dead ends: 136657 [2025-01-09 10:10:26,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:10:26,567 INFO L435 NwaCegarLoop]: 1089 mSDtfsCounter, 823 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:26,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 2653 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:10:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136657 states. [2025-01-09 10:10:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136657 to 116924. [2025-01-09 10:10:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116924 states, 98548 states have (on average 1.6030360839387912) internal successors, (157976), 99205 states have internal predecessors, (157976), 17617 states have call successors, (17617), 758 states have call predecessors, (17617), 758 states have return successors, (17617), 16960 states have call predecessors, (17617), 17617 states have call successors, (17617) [2025-01-09 10:10:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116924 states to 116924 states and 193210 transitions. [2025-01-09 10:10:32,043 INFO L78 Accepts]: Start accepts. Automaton has 116924 states and 193210 transitions. Word has length 631 [2025-01-09 10:10:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:32,044 INFO L471 AbstractCegarLoop]: Abstraction has 116924 states and 193210 transitions. [2025-01-09 10:10:32,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:10:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 116924 states and 193210 transitions. [2025-01-09 10:10:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:10:32,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:32,303 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:32,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:10:32,304 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:32,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1351708633, now seen corresponding path program 1 times [2025-01-09 10:10:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145218119] [2025-01-09 10:10:32,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:32,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:10:32,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:10:32,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:32,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:10:32,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:32,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145218119] [2025-01-09 10:10:32,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145218119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:32,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:32,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:32,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056366790] [2025-01-09 10:10:32,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:32,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:32,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:32,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:32,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:32,463 INFO L87 Difference]: Start difference. First operand 116924 states and 193210 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97)