./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-17.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-17.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 3893bf360a85f05760b77c740edd1d0464d11dea1da72a67fc941d09eb87c9f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:02:50,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:02:50,495 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:02:50,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:02:50,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:02:50,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:02:50,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:02:50,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:02:50,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:02:50,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:02:50,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:02:50,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:02:50,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:02:50,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:02:50,530 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:02:50,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:02:50,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:02:50,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:02:50,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:02:50,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:02:50,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:02:50,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:02:50,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:02:50,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:02:50,531 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:02:50,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:02:50,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:02:50,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:02:50,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:02:50,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:02:50,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:02:50,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:02:50,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:02:50,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:02:50,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:02:50,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:02:50,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:02:50,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:02:50,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:02:50,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:02:50,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:02:50,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:02:50,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:02:50,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:02:50,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:02:50,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:02:50,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:02:50,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:02:50,534 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 -> 3893bf360a85f05760b77c740edd1d0464d11dea1da72a67fc941d09eb87c9f1 [2025-01-09 10:02:50,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:02:50,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:02:50,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:02:50,821 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:02:50,821 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:02:50,822 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-17.i [2025-01-09 10:02:52,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b952a85c6/fa59223cc8194c6dbc4136cd69c99606/FLAG4d0d08928 [2025-01-09 10:02:52,422 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:02:52,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-17.i [2025-01-09 10:02:52,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b952a85c6/fa59223cc8194c6dbc4136cd69c99606/FLAG4d0d08928 [2025-01-09 10:02:52,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b952a85c6/fa59223cc8194c6dbc4136cd69c99606 [2025-01-09 10:02:52,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:02:52,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:02:52,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:02:52,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:02:52,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:02:52,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:52,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210113b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52, skipping insertion in model container [2025-01-09 10:02:52,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:52,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:02:52,652 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-17.i[916,929] [2025-01-09 10:02:52,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:02:52,870 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:02:52,881 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-17.i[916,929] [2025-01-09 10:02:52,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:02:52,996 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:02:52,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52 WrapperNode [2025-01-09 10:02:52,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:02:52,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:02:52,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:02:52,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:02:53,004 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:02:52" (1/1) ... [2025-01-09 10:02:53,020 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:02:52" (1/1) ... [2025-01-09 10:02:53,087 INFO L138 Inliner]: procedures = 26, calls = 108, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 868 [2025-01-09 10:02:53,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:02:53,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:02:53,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:02:53,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:02:53,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:53,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:53,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:53,151 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:02:53,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:53,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:53,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:53,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:53,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:53,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:53,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:53,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:02:53,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:02:53,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:02:53,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:02:53,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (1/1) ... [2025-01-09 10:02:53,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:02:53,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:02:53,282 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:02:53,289 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:02:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:02:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:02:53,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:02:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:02:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:02:53,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:02:53,460 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:02:53,462 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:02:54,907 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-09 10:02:54,907 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:02:54,930 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:02:54,934 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:02:54,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:02:54 BoogieIcfgContainer [2025-01-09 10:02:54,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:02:54,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:02:54,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:02:54,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:02:54,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:02:52" (1/3) ... [2025-01-09 10:02:54,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7227116e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:02:54, skipping insertion in model container [2025-01-09 10:02:54,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:52" (2/3) ... [2025-01-09 10:02:54,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7227116e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:02:54, skipping insertion in model container [2025-01-09 10:02:54,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:02:54" (3/3) ... [2025-01-09 10:02:54,946 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-17.i [2025-01-09 10:02:54,959 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:02:54,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-17.i that has 2 procedures, 362 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:02:55,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:02:55,054 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;@13779442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:02:55,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:02:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 264 states have (on average 1.6136363636363635) internal successors, (426), 265 states have internal predecessors, (426), 95 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 10:02:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-01-09 10:02:55,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:55,115 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:55,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:55,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2045907592, now seen corresponding path program 1 times [2025-01-09 10:02:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:55,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846650350] [2025-01-09 10:02:55,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:55,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:55,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-01-09 10:02:55,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-01-09 10:02:55,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:55,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 17672 trivial. 0 not checked. [2025-01-09 10:02:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846650350] [2025-01-09 10:02:55,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846650350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:02:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846869605] [2025-01-09 10:02:55,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:55,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:02:55,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:02:55,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:02:55,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:02:56,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-01-09 10:02:56,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-01-09 10:02:56,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:56,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:56,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:02:56,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:02:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 17672 trivial. 0 not checked. [2025-01-09 10:02:56,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:02:56,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846869605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:56,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:02:56,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:02:56,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880559709] [2025-01-09 10:02:56,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:56,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:02:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:56,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:02:56,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:02:56,450 INFO L87 Difference]: Start difference. First operand has 362 states, 264 states have (on average 1.6136363636363635) internal successors, (426), 265 states have internal predecessors, (426), 95 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 2 states have call successors, (95) [2025-01-09 10:02:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:56,526 INFO L93 Difference]: Finished difference Result 718 states and 1322 transitions. [2025-01-09 10:02:56,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:02:56,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 2 states have call successors, (95) Word has length 622 [2025-01-09 10:02:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:56,536 INFO L225 Difference]: With dead ends: 718 [2025-01-09 10:02:56,536 INFO L226 Difference]: Without dead ends: 359 [2025-01-09 10:02:56,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 623 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:02:56,544 INFO L435 NwaCegarLoop]: 608 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, 608 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:02:56,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-09 10:02:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-01-09 10:02:56,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 262 states have (on average 1.5954198473282444) internal successors, (418), 262 states have internal predecessors, (418), 95 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 10:02:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 608 transitions. [2025-01-09 10:02:56,658 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 608 transitions. Word has length 622 [2025-01-09 10:02:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:56,659 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 608 transitions. [2025-01-09 10:02:56,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 2 states have call successors, (95) [2025-01-09 10:02:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 608 transitions. [2025-01-09 10:02:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-01-09 10:02:56,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:56,673 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:56,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:02:56,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:02:56,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:56,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash -49443526, now seen corresponding path program 1 times [2025-01-09 10:02:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:56,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235557746] [2025-01-09 10:02:56,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:56,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:56,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-01-09 10:02:57,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-01-09 10:02:57,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:57,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:02:57,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:57,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235557746] [2025-01-09 10:02:57,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235557746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:57,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:57,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132657779] [2025-01-09 10:02:57,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:57,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:57,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:57,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:57,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:57,705 INFO L87 Difference]: Start difference. First operand 359 states and 608 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:02:57,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:57,818 INFO L93 Difference]: Finished difference Result 1067 states and 1810 transitions. [2025-01-09 10:02:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:57,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 622 [2025-01-09 10:02:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:57,832 INFO L225 Difference]: With dead ends: 1067 [2025-01-09 10:02:57,834 INFO L226 Difference]: Without dead ends: 711 [2025-01-09 10:02:57,837 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:02:57,837 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 583 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:57,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1195 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-01-09 10:02:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 709. [2025-01-09 10:02:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 516 states have (on average 1.5910852713178294) internal successors, (821), 516 states have internal predecessors, (821), 190 states have call successors, (190), 2 states have call predecessors, (190), 2 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-01-09 10:02:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1201 transitions. [2025-01-09 10:02:57,937 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1201 transitions. Word has length 622 [2025-01-09 10:02:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:57,942 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1201 transitions. [2025-01-09 10:02:57,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:02:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1201 transitions. [2025-01-09 10:02:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-01-09 10:02:57,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:57,957 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:57,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:02:57,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:57,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:57,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1605930418, now seen corresponding path program 1 times [2025-01-09 10:02:57,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:57,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149676220] [2025-01-09 10:02:57,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:58,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-01-09 10:02:58,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-01-09 10:02:58,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:58,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:02:58,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:58,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149676220] [2025-01-09 10:02:58,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149676220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:58,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:58,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130416316] [2025-01-09 10:02:58,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:58,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:58,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:58,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:58,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:58,414 INFO L87 Difference]: Start difference. First operand 709 states and 1201 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:02:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:58,555 INFO L93 Difference]: Finished difference Result 1891 states and 3213 transitions. [2025-01-09 10:02:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:58,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 623 [2025-01-09 10:02:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:58,571 INFO L225 Difference]: With dead ends: 1891 [2025-01-09 10:02:58,571 INFO L226 Difference]: Without dead ends: 1185 [2025-01-09 10:02:58,574 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:02:58,577 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 373 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:58,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1261 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:02:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-01-09 10:02:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1181. [2025-01-09 10:02:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 930 states have (on average 1.621505376344086) internal successors, (1508), 932 states have internal predecessors, (1508), 246 states have call successors, (246), 4 states have call predecessors, (246), 4 states have return successors, (246), 244 states have call predecessors, (246), 246 states have call successors, (246) [2025-01-09 10:02:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2000 transitions. [2025-01-09 10:02:58,735 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 2000 transitions. Word has length 623 [2025-01-09 10:02:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:58,737 INFO L471 AbstractCegarLoop]: Abstraction has 1181 states and 2000 transitions. [2025-01-09 10:02:58,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:02:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 2000 transitions. [2025-01-09 10:02:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2025-01-09 10:02:58,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:58,752 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:58,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:02:58,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:58,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:58,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1203666231, now seen corresponding path program 1 times [2025-01-09 10:02:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:58,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851821273] [2025-01-09 10:02:58,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:58,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:58,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-01-09 10:02:58,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-01-09 10:02:58,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:58,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:02:59,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:59,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851821273] [2025-01-09 10:02:59,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851821273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:59,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:59,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:59,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110725273] [2025-01-09 10:02:59,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:59,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:59,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:59,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:59,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:59,099 INFO L87 Difference]: Start difference. First operand 1181 states and 2000 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:02:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:59,206 INFO L93 Difference]: Finished difference Result 3019 states and 5080 transitions. [2025-01-09 10:02:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:59,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 624 [2025-01-09 10:02:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:59,225 INFO L225 Difference]: With dead ends: 3019 [2025-01-09 10:02:59,225 INFO L226 Difference]: Without dead ends: 1841 [2025-01-09 10:02:59,229 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:02:59,231 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 316 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:59,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1193 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2025-01-09 10:02:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1837. [2025-01-09 10:02:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1386 states have (on average 1.5786435786435786) internal successors, (2188), 1392 states have internal predecessors, (2188), 442 states have call successors, (442), 8 states have call predecessors, (442), 8 states have return successors, (442), 436 states have call predecessors, (442), 442 states have call successors, (442) [2025-01-09 10:02:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 3072 transitions. [2025-01-09 10:02:59,419 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 3072 transitions. Word has length 624 [2025-01-09 10:02:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:59,421 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 3072 transitions. [2025-01-09 10:02:59,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:02:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 3072 transitions. [2025-01-09 10:02:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2025-01-09 10:02:59,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:59,429 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:59,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:02:59,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:59,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1321778150, now seen corresponding path program 1 times [2025-01-09 10:02:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:59,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273921303] [2025-01-09 10:02:59,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:59,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:59,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes. [2025-01-09 10:02:59,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements. [2025-01-09 10:02:59,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:59,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:02:59,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:59,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273921303] [2025-01-09 10:02:59,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273921303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:59,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:59,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:02:59,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201233276] [2025-01-09 10:02:59,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:59,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:02:59,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:59,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:02:59,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:02:59,953 INFO L87 Difference]: Start difference. First operand 1837 states and 3072 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:03:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:00,740 INFO L93 Difference]: Finished difference Result 6701 states and 11092 transitions. [2025-01-09 10:03:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:03:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 625 [2025-01-09 10:03:00,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:00,778 INFO L225 Difference]: With dead ends: 6701 [2025-01-09 10:03:00,778 INFO L226 Difference]: Without dead ends: 4867 [2025-01-09 10:03:00,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:03:00,790 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 745 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 2829 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:00,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 2829 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:03:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4867 states. [2025-01-09 10:03:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 3269. [2025-01-09 10:03:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 2634 states have (on average 1.612756264236902) internal successors, (4248), 2648 states have internal predecessors, (4248), 618 states have call successors, (618), 16 states have call predecessors, (618), 16 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-01-09 10:03:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 5484 transitions. [2025-01-09 10:03:01,146 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 5484 transitions. Word has length 625 [2025-01-09 10:03:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:01,148 INFO L471 AbstractCegarLoop]: Abstraction has 3269 states and 5484 transitions. [2025-01-09 10:03:01,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:03:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 5484 transitions. [2025-01-09 10:03:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2025-01-09 10:03:01,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:01,160 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:01,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:03:01,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:01,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:01,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1915351068, now seen corresponding path program 1 times [2025-01-09 10:03:01,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:01,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987783553] [2025-01-09 10:03:01,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:01,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:01,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes. [2025-01-09 10:03:01,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements. [2025-01-09 10:03:01,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:01,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:03:02,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:02,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987783553] [2025-01-09 10:03:02,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987783553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:02,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:02,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:03:02,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668585956] [2025-01-09 10:03:02,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:02,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:03:02,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:02,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:03:02,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:02,300 INFO L87 Difference]: Start difference. First operand 3269 states and 5484 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:03:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:02,989 INFO L93 Difference]: Finished difference Result 8866 states and 14963 transitions. [2025-01-09 10:03:02,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:03:02,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 625 [2025-01-09 10:03:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:03,023 INFO L225 Difference]: With dead ends: 8866 [2025-01-09 10:03:03,024 INFO L226 Difference]: Without dead ends: 5600 [2025-01-09 10:03:03,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:03:03,037 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 646 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:03,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 2192 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:03:03,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5600 states. [2025-01-09 10:03:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5600 to 5118. [2025-01-09 10:03:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5118 states, 4386 states have (on average 1.661422708618331) internal successors, (7287), 4400 states have internal predecessors, (7287), 713 states have call successors, (713), 18 states have call predecessors, (713), 18 states have return successors, (713), 699 states have call predecessors, (713), 713 states have call successors, (713) [2025-01-09 10:03:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 8713 transitions. [2025-01-09 10:03:03,436 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 8713 transitions. Word has length 625 [2025-01-09 10:03:03,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:03,438 INFO L471 AbstractCegarLoop]: Abstraction has 5118 states and 8713 transitions. [2025-01-09 10:03:03,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:03:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 8713 transitions. [2025-01-09 10:03:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-01-09 10:03:03,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:03,447 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:03,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:03:03,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:03,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:03,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1713464221, now seen corresponding path program 1 times [2025-01-09 10:03:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:03,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464477034] [2025-01-09 10:03:03,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:03,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-01-09 10:03:03,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-01-09 10:03:03,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:03,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:03:04,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:04,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464477034] [2025-01-09 10:03:04,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464477034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:04,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:04,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:03:04,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897944642] [2025-01-09 10:03:04,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:04,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:03:04,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:04,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:03:04,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:04,819 INFO L87 Difference]: Start difference. First operand 5118 states and 8713 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:03:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:05,756 INFO L93 Difference]: Finished difference Result 12684 states and 21464 transitions. [2025-01-09 10:03:05,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:03:05,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 626 [2025-01-09 10:03:05,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:05,812 INFO L225 Difference]: With dead ends: 12684 [2025-01-09 10:03:05,813 INFO L226 Difference]: Without dead ends: 8850 [2025-01-09 10:03:05,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:03:05,831 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 718 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:05,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 2852 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:03:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8850 states. [2025-01-09 10:03:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8850 to 8838. [2025-01-09 10:03:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8838 states, 7440 states have (on average 1.6428763440860215) internal successors, (12223), 7468 states have internal predecessors, (12223), 1363 states have call successors, (1363), 34 states have call predecessors, (1363), 34 states have return successors, (1363), 1335 states have call predecessors, (1363), 1363 states have call successors, (1363) [2025-01-09 10:03:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8838 states to 8838 states and 14949 transitions. [2025-01-09 10:03:06,511 INFO L78 Accepts]: Start accepts. Automaton has 8838 states and 14949 transitions. Word has length 626 [2025-01-09 10:03:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:06,513 INFO L471 AbstractCegarLoop]: Abstraction has 8838 states and 14949 transitions. [2025-01-09 10:03:06,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:03:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 8838 states and 14949 transitions. [2025-01-09 10:03:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-01-09 10:03:06,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:06,528 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:06,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:03:06,528 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:06,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1360375839, now seen corresponding path program 1 times [2025-01-09 10:03:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:06,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115397434] [2025-01-09 10:03:06,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:06,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:06,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-01-09 10:03:06,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-01-09 10:03:06,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:06,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:03:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115397434] [2025-01-09 10:03:07,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115397434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:07,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:07,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:07,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468682393] [2025-01-09 10:03:07,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:07,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:07,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:07,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:07,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:07,321 INFO L87 Difference]: Start difference. First operand 8838 states and 14949 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:03:07,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:07,960 INFO L93 Difference]: Finished difference Result 19842 states and 33479 transitions. [2025-01-09 10:03:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:07,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 626 [2025-01-09 10:03:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:08,027 INFO L225 Difference]: With dead ends: 19842 [2025-01-09 10:03:08,028 INFO L226 Difference]: Without dead ends: 12224 [2025-01-09 10:03:08,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:08,052 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 307 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:08,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1843 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:03:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2025-01-09 10:03:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12206. [2025-01-09 10:03:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12206 states, 10408 states have (on average 1.642870868562644) internal successors, (17099), 10452 states have internal predecessors, (17099), 1747 states have call successors, (1747), 50 states have call predecessors, (1747), 50 states have return successors, (1747), 1703 states have call predecessors, (1747), 1747 states have call successors, (1747) [2025-01-09 10:03:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12206 states to 12206 states and 20593 transitions. [2025-01-09 10:03:08,800 INFO L78 Accepts]: Start accepts. Automaton has 12206 states and 20593 transitions. Word has length 626 [2025-01-09 10:03:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:08,802 INFO L471 AbstractCegarLoop]: Abstraction has 12206 states and 20593 transitions. [2025-01-09 10:03:08,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:03:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 12206 states and 20593 transitions. [2025-01-09 10:03:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-01-09 10:03:08,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:08,816 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:08,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:03:08,816 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:08,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:08,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1718437731, now seen corresponding path program 1 times [2025-01-09 10:03:08,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:08,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739597618] [2025-01-09 10:03:08,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:08,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-01-09 10:03:09,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-01-09 10:03:09,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:09,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:03:10,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739597618] [2025-01-09 10:03:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739597618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:10,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:03:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981860724] [2025-01-09 10:03:10,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:10,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:03:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:10,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:03:10,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:03:10,642 INFO L87 Difference]: Start difference. First operand 12206 states and 20593 transitions. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-01-09 10:03:17,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:17,826 INFO L93 Difference]: Finished difference Result 48375 states and 80393 transitions. [2025-01-09 10:03:17,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 10:03:17,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) Word has length 626 [2025-01-09 10:03:17,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:18,048 INFO L225 Difference]: With dead ends: 48375 [2025-01-09 10:03:18,049 INFO L226 Difference]: Without dead ends: 38769 [2025-01-09 10:03:18,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2025-01-09 10:03:18,109 INFO L435 NwaCegarLoop]: 1187 mSDtfsCounter, 5893 mSDsluCounter, 5309 mSDsCounter, 0 mSdLazyCounter, 2784 mSolverCounterSat, 1096 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5893 SdHoareTripleChecker+Valid, 6496 SdHoareTripleChecker+Invalid, 3880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1096 IncrementalHoareTripleChecker+Valid, 2784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:18,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5893 Valid, 6496 Invalid, 3880 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1096 Valid, 2784 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 10:03:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38769 states. [2025-01-09 10:03:19,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38769 to 20254. [2025-01-09 10:03:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20254 states, 17616 states have (on average 1.64458446866485) internal successors, (28971), 17692 states have internal predecessors, (28971), 2547 states have call successors, (2547), 90 states have call predecessors, (2547), 90 states have return successors, (2547), 2471 states have call predecessors, (2547), 2547 states have call successors, (2547) [2025-01-09 10:03:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20254 states to 20254 states and 34065 transitions. [2025-01-09 10:03:19,419 INFO L78 Accepts]: Start accepts. Automaton has 20254 states and 34065 transitions. Word has length 626 [2025-01-09 10:03:19,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:19,420 INFO L471 AbstractCegarLoop]: Abstraction has 20254 states and 34065 transitions. [2025-01-09 10:03:19,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-01-09 10:03:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20254 states and 34065 transitions. [2025-01-09 10:03:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-01-09 10:03:19,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:19,439 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:19,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:03:19,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:19,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash -813915764, now seen corresponding path program 1 times [2025-01-09 10:03:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:19,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876372915] [2025-01-09 10:03:19,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:19,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-01-09 10:03:19,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-01-09 10:03:19,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:19,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:03:19,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:19,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876372915] [2025-01-09 10:03:19,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876372915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:19,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:19,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:19,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928216926] [2025-01-09 10:03:19,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:19,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:19,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:19,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:19,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:19,676 INFO L87 Difference]: Start difference. First operand 20254 states and 34065 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:03:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:20,289 INFO L93 Difference]: Finished difference Result 33341 states and 55971 transitions. [2025-01-09 10:03:20,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:20,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 626 [2025-01-09 10:03:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:20,355 INFO L225 Difference]: With dead ends: 33341 [2025-01-09 10:03:20,356 INFO L226 Difference]: Without dead ends: 14831 [2025-01-09 10:03:20,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:20,401 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 356 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:20,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1415 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14831 states. [2025-01-09 10:03:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14831 to 14829. [2025-01-09 10:03:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14829 states, 12814 states have (on average 1.6339160293429063) internal successors, (20937), 12866 states have internal predecessors, (20937), 1939 states have call successors, (1939), 75 states have call predecessors, (1939), 75 states have return successors, (1939), 1887 states have call predecessors, (1939), 1939 states have call successors, (1939) [2025-01-09 10:03:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14829 states to 14829 states and 24815 transitions. [2025-01-09 10:03:21,268 INFO L78 Accepts]: Start accepts. Automaton has 14829 states and 24815 transitions. Word has length 626 [2025-01-09 10:03:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:21,269 INFO L471 AbstractCegarLoop]: Abstraction has 14829 states and 24815 transitions. [2025-01-09 10:03:21,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-01-09 10:03:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 14829 states and 24815 transitions. [2025-01-09 10:03:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-01-09 10:03:21,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:21,284 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:21,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:03:21,284 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:21,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash 62814540, now seen corresponding path program 1 times [2025-01-09 10:03:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308176938] [2025-01-09 10:03:21,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:21,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-01-09 10:03:21,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-01-09 10:03:21,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:21,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:03:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308176938] [2025-01-09 10:03:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308176938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:22,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 10:03:22,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964531521] [2025-01-09 10:03:22,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:22,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:03:22,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:22,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:03:22,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:03:22,724 INFO L87 Difference]: Start difference. First operand 14829 states and 24815 transitions. Second operand has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-01-09 10:03:29,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:29,944 INFO L93 Difference]: Finished difference Result 70893 states and 117494 transitions. [2025-01-09 10:03:29,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-09 10:03:29,945 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) Word has length 626 [2025-01-09 10:03:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:30,152 INFO L225 Difference]: With dead ends: 70893 [2025-01-09 10:03:30,153 INFO L226 Difference]: Without dead ends: 58651 [2025-01-09 10:03:30,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=532, Invalid=1538, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 10:03:30,206 INFO L435 NwaCegarLoop]: 1382 mSDtfsCounter, 11328 mSDsluCounter, 7278 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 2229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11328 SdHoareTripleChecker+Valid, 8660 SdHoareTripleChecker+Invalid, 5539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2229 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:30,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11328 Valid, 8660 Invalid, 5539 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2229 Valid, 3310 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 10:03:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58651 states. [2025-01-09 10:03:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58651 to 31744. [2025-01-09 10:03:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31744 states, 27764 states have (on average 1.6437112807952745) internal successors, (45636), 27876 states have internal predecessors, (45636), 3815 states have call successors, (3815), 164 states have call predecessors, (3815), 164 states have return successors, (3815), 3703 states have call predecessors, (3815), 3815 states have call successors, (3815) [2025-01-09 10:03:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31744 states to 31744 states and 53266 transitions. [2025-01-09 10:03:32,175 INFO L78 Accepts]: Start accepts. Automaton has 31744 states and 53266 transitions. Word has length 626 [2025-01-09 10:03:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:32,176 INFO L471 AbstractCegarLoop]: Abstraction has 31744 states and 53266 transitions. [2025-01-09 10:03:32,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-01-09 10:03:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 31744 states and 53266 transitions. [2025-01-09 10:03:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-01-09 10:03:32,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:32,199 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:32,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:03:32,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:32,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1877767474, now seen corresponding path program 1 times [2025-01-09 10:03:32,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:32,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069791949] [2025-01-09 10:03:32,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:32,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-01-09 10:03:32,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-01-09 10:03:32,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:32,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:03:33,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:33,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069791949] [2025-01-09 10:03:33,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069791949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:33,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:33,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:03:33,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432096824] [2025-01-09 10:03:33,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:33,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:03:33,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:33,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:03:33,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:03:33,056 INFO L87 Difference]: Start difference. First operand 31744 states and 53266 transitions. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-01-09 10:03:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:38,673 INFO L93 Difference]: Finished difference Result 108095 states and 179291 transitions. [2025-01-09 10:03:38,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 10:03:38,674 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) Word has length 626 [2025-01-09 10:03:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:38,950 INFO L225 Difference]: With dead ends: 108095 [2025-01-09 10:03:38,951 INFO L226 Difference]: Without dead ends: 84026 [2025-01-09 10:03:39,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2025-01-09 10:03:39,026 INFO L435 NwaCegarLoop]: 1426 mSDtfsCounter, 6060 mSDsluCounter, 6613 mSDsCounter, 0 mSdLazyCounter, 2841 mSolverCounterSat, 1086 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6060 SdHoareTripleChecker+Valid, 8039 SdHoareTripleChecker+Invalid, 3927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1086 IncrementalHoareTripleChecker+Valid, 2841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:39,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6060 Valid, 8039 Invalid, 3927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1086 Valid, 2841 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 10:03:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84026 states. [2025-01-09 10:03:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84026 to 50540. [2025-01-09 10:03:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50540 states, 44632 states have (on average 1.6484585051084424) internal successors, (73574), 44824 states have internal predecessors, (73574), 5639 states have call successors, (5639), 268 states have call predecessors, (5639), 268 states have return successors, (5639), 5447 states have call predecessors, (5639), 5639 states have call successors, (5639) [2025-01-09 10:03:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50540 states to 50540 states and 84852 transitions. [2025-01-09 10:03:41,748 INFO L78 Accepts]: Start accepts. Automaton has 50540 states and 84852 transitions. Word has length 626 [2025-01-09 10:03:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:41,749 INFO L471 AbstractCegarLoop]: Abstraction has 50540 states and 84852 transitions. [2025-01-09 10:03:41,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-01-09 10:03:41,749 INFO L276 IsEmpty]: Start isEmpty. Operand 50540 states and 84852 transitions. [2025-01-09 10:03:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2025-01-09 10:03:41,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:41,780 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:03:41,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:03:41,781 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:41,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1199502057, now seen corresponding path program 1 times [2025-01-09 10:03:41,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:41,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898344280] [2025-01-09 10:03:41,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:41,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-01-09 10:03:41,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-01-09 10:03:41,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:41,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-01-09 10:03:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898344280] [2025-01-09 10:03:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898344280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:44,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 10:03:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538608909] [2025-01-09 10:03:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:44,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:03:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:44,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:03:44,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:03:44,078 INFO L87 Difference]: Start difference. First operand 50540 states and 84852 transitions. Second operand has 12 states, 12 states have (on average 12.916666666666666) internal successors, (155), 12 states have internal predecessors, (155), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95)