./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.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_fillercodestructure_filler-pe-cn_file-34.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 18633f06cbfcb2d86a624bf68270d8235f3d798bef0344c8b1ebe935e6a76a6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:38:19,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:38:19,444 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:38:19,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:38:19,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:38:19,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:38:19,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:38:19,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:38:19,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:38:19,474 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:38:19,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:38:19,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:38:19,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:38:19,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:38:19,475 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:38:19,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:38:19,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:38:19,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:38:19,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:38:19,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:38:19,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:38:19,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:38:19,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:38:19,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:38:19,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:38:19,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:38:19,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:38:19,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:38:19,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:38:19,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:38:19,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:38:19,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:38:19,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:38:19,477 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 -> 18633f06cbfcb2d86a624bf68270d8235f3d798bef0344c8b1ebe935e6a76a6f [2025-01-09 10:38:19,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:38:19,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:38:19,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:38:19,709 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:38:19,709 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:38:19,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i [2025-01-09 10:38:20,854 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/255a47f70/669c87f5ccfa476f8f89071d863caa47/FLAGd845f4fba [2025-01-09 10:38:21,102 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:38:21,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i [2025-01-09 10:38:21,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/255a47f70/669c87f5ccfa476f8f89071d863caa47/FLAGd845f4fba [2025-01-09 10:38:21,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/255a47f70/669c87f5ccfa476f8f89071d863caa47 [2025-01-09 10:38:21,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:38:21,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:38:21,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:38:21,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:38:21,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:38:21,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1583dce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21, skipping insertion in model container [2025-01-09 10:38:21,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:38:21,598 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_fillercodestructure_filler-pe-cn_file-34.i[919,932] [2025-01-09 10:38:21,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:38:21,662 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:38:21,672 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_fillercodestructure_filler-pe-cn_file-34.i[919,932] [2025-01-09 10:38:21,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:38:21,747 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:38:21,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21 WrapperNode [2025-01-09 10:38:21,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:38:21,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:38:21,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:38:21,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:38:21,757 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:38:21" (1/1) ... [2025-01-09 10:38:21,772 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:38:21" (1/1) ... [2025-01-09 10:38:21,796 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-01-09 10:38:21,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:38:21,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:38:21,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:38:21,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:38:21,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,822 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:38:21,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:38:21,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:38:21,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:38:21,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:38:21,841 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (1/1) ... [2025-01-09 10:38:21,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:38:21,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:38:21,870 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:38:21,875 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:38:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:38:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:38:21,891 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:38:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:38:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:38:21,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:38:21,946 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:38:21,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:38:22,319 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 10:38:22,319 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:38:22,327 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:38:22,328 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:38:22,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:38:22 BoogieIcfgContainer [2025-01-09 10:38:22,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:38:22,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:38:22,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:38:22,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:38:22,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:38:21" (1/3) ... [2025-01-09 10:38:22,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23649428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:38:22, skipping insertion in model container [2025-01-09 10:38:22,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:21" (2/3) ... [2025-01-09 10:38:22,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23649428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:38:22, skipping insertion in model container [2025-01-09 10:38:22,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:38:22" (3/3) ... [2025-01-09 10:38:22,337 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i [2025-01-09 10:38:22,348 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:38:22,351 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:38:22,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:38:22,400 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;@9008b6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:38:22,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:38:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 10:38:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 10:38:22,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:22,420 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:22,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:22,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash 560439466, now seen corresponding path program 1 times [2025-01-09 10:38:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:22,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590793245] [2025-01-09 10:38:22,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:22,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:22,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 10:38:22,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 10:38:22,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:22,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 10:38:22,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:22,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590793245] [2025-01-09 10:38:22,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590793245] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:38:22,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866491137] [2025-01-09 10:38:22,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:22,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:38:22,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:38:22,765 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:38:22,766 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:38:22,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 10:38:22,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 10:38:22,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:22,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:22,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:38:22,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:38:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 10:38:22,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:38:22,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866491137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:22,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:38:22,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:38:22,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505182727] [2025-01-09 10:38:22,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:22,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:38:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:22,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:38:22,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:38:22,975 INFO L87 Difference]: Start difference. First operand has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 10:38:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:23,004 INFO L93 Difference]: Finished difference Result 216 states and 380 transitions. [2025-01-09 10:38:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:38:23,007 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 212 [2025-01-09 10:38:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:23,012 INFO L225 Difference]: With dead ends: 216 [2025-01-09 10:38:23,012 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 10:38:23,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 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:38:23,019 INFO L435 NwaCegarLoop]: 171 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, 171 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:38:23,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:38:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 10:38:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 10:38:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 10:38:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 171 transitions. [2025-01-09 10:38:23,064 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 171 transitions. Word has length 212 [2025-01-09 10:38:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:23,064 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 171 transitions. [2025-01-09 10:38:23,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 10:38:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 171 transitions. [2025-01-09 10:38:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 10:38:23,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:23,068 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:23,080 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:38:23,273 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:38:23,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:23,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:23,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1826547364, now seen corresponding path program 1 times [2025-01-09 10:38:23,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:23,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968171110] [2025-01-09 10:38:23,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:23,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:23,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 10:38:23,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 10:38:23,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:23,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968171110] [2025-01-09 10:38:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968171110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:23,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:38:23,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087797212] [2025-01-09 10:38:23,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:23,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:38:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:23,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:38:23,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:38:23,832 INFO L87 Difference]: Start difference. First operand 108 states and 171 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:24,017 INFO L93 Difference]: Finished difference Result 358 states and 571 transitions. [2025-01-09 10:38:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:38:24,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-01-09 10:38:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:24,022 INFO L225 Difference]: With dead ends: 358 [2025-01-09 10:38:24,023 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 10:38:24,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:38:24,025 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 178 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:24,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 550 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:38:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 10:38:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 213. [2025-01-09 10:38:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 144 states have (on average 1.4375) internal successors, (207), 144 states have internal predecessors, (207), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 10:38:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 339 transitions. [2025-01-09 10:38:24,062 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 339 transitions. Word has length 212 [2025-01-09 10:38:24,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:24,065 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 339 transitions. [2025-01-09 10:38:24,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 339 transitions. [2025-01-09 10:38:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 10:38:24,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:24,069 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:24,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:38:24,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:24,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1413919984, now seen corresponding path program 1 times [2025-01-09 10:38:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182349032] [2025-01-09 10:38:24,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:24,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 10:38:24,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 10:38:24,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:24,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:24,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:24,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182349032] [2025-01-09 10:38:24,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182349032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:24,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:24,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:38:24,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422965135] [2025-01-09 10:38:24,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:24,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:38:24,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:24,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:38:24,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:38:24,332 INFO L87 Difference]: Start difference. First operand 213 states and 339 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:24,596 INFO L93 Difference]: Finished difference Result 628 states and 1000 transitions. [2025-01-09 10:38:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:38:24,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2025-01-09 10:38:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:24,600 INFO L225 Difference]: With dead ends: 628 [2025-01-09 10:38:24,600 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 10:38:24,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:38:24,602 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 204 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:24,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 606 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:38:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 10:38:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 217. [2025-01-09 10:38:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 148 states have (on average 1.4256756756756757) internal successors, (211), 148 states have internal predecessors, (211), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 10:38:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 343 transitions. [2025-01-09 10:38:24,653 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 343 transitions. Word has length 213 [2025-01-09 10:38:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:24,653 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 343 transitions. [2025-01-09 10:38:24,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 343 transitions. [2025-01-09 10:38:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:38:24,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:24,655 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:24,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:38:24,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:24,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:24,656 INFO L85 PathProgramCache]: Analyzing trace with hash -811221124, now seen corresponding path program 1 times [2025-01-09 10:38:24,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:24,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470610859] [2025-01-09 10:38:24,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:24,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:24,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:38:24,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:38:24,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:24,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:24,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:24,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470610859] [2025-01-09 10:38:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470610859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:24,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:24,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:38:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735728324] [2025-01-09 10:38:24,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:24,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:38:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:24,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:38:24,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:38:24,998 INFO L87 Difference]: Start difference. First operand 217 states and 343 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:25,200 INFO L93 Difference]: Finished difference Result 580 states and 918 transitions. [2025-01-09 10:38:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:38:25,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 10:38:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:25,204 INFO L225 Difference]: With dead ends: 580 [2025-01-09 10:38:25,204 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 10:38:25,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:38:25,206 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 124 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:25,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 651 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:38:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 10:38:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 278. [2025-01-09 10:38:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 175 states have (on average 1.3771428571428572) internal successors, (241), 175 states have internal predecessors, (241), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 10:38:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 439 transitions. [2025-01-09 10:38:25,250 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 439 transitions. Word has length 214 [2025-01-09 10:38:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:25,251 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 439 transitions. [2025-01-09 10:38:25,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 439 transitions. [2025-01-09 10:38:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:38:25,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:25,253 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:25,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:38:25,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:25,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash -951769734, now seen corresponding path program 1 times [2025-01-09 10:38:25,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:25,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447040001] [2025-01-09 10:38:25,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:25,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:38:25,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:38:25,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:25,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:27,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:27,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447040001] [2025-01-09 10:38:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447040001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:27,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:27,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:38:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108967221] [2025-01-09 10:38:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:27,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:38:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:27,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:38:27,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:38:27,911 INFO L87 Difference]: Start difference. First operand 278 states and 439 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:29,072 INFO L93 Difference]: Finished difference Result 746 states and 1177 transitions. [2025-01-09 10:38:29,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:38:29,073 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 10:38:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:29,078 INFO L225 Difference]: With dead ends: 746 [2025-01-09 10:38:29,078 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 10:38:29,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:38:29,080 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 558 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:29,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 673 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:38:29,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 10:38:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 316. [2025-01-09 10:38:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 213 states have (on average 1.403755868544601) internal successors, (299), 213 states have internal predecessors, (299), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 10:38:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 497 transitions. [2025-01-09 10:38:29,121 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 497 transitions. Word has length 214 [2025-01-09 10:38:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:29,122 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 497 transitions. [2025-01-09 10:38:29,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:29,124 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 497 transitions. [2025-01-09 10:38:29,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:38:29,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:29,125 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:29,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:38:29,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:29,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash 59347516, now seen corresponding path program 1 times [2025-01-09 10:38:29,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:29,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596301739] [2025-01-09 10:38:29,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:29,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:29,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:38:29,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:38:29,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:29,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:32,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:32,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596301739] [2025-01-09 10:38:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596301739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:32,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:32,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:38:32,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246533757] [2025-01-09 10:38:32,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:32,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:38:32,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:32,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:38:32,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:38:32,253 INFO L87 Difference]: Start difference. First operand 316 states and 497 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:34,799 INFO L93 Difference]: Finished difference Result 831 states and 1298 transitions. [2025-01-09 10:38:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:38:34,799 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 10:38:34,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:34,802 INFO L225 Difference]: With dead ends: 831 [2025-01-09 10:38:34,802 INFO L226 Difference]: Without dead ends: 617 [2025-01-09 10:38:34,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2025-01-09 10:38:34,803 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 981 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:34,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 763 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 10:38:34,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-01-09 10:38:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 434. [2025-01-09 10:38:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 319 states have (on average 1.45141065830721) internal successors, (463), 321 states have internal predecessors, (463), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 10:38:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 681 transitions. [2025-01-09 10:38:34,847 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 681 transitions. Word has length 214 [2025-01-09 10:38:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:34,848 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 681 transitions. [2025-01-09 10:38:34,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 681 transitions. [2025-01-09 10:38:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:38:34,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:34,851 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:34,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:38:34,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:34,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:34,851 INFO L85 PathProgramCache]: Analyzing trace with hash -961720838, now seen corresponding path program 1 times [2025-01-09 10:38:34,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:34,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648951621] [2025-01-09 10:38:34,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:34,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:34,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:38:34,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:38:34,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:34,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:36,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:36,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648951621] [2025-01-09 10:38:36,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648951621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:36,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:36,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:38:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755649234] [2025-01-09 10:38:36,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:36,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:38:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:36,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:38:36,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:38:36,782 INFO L87 Difference]: Start difference. First operand 434 states and 681 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:37,898 INFO L93 Difference]: Finished difference Result 1273 states and 2013 transitions. [2025-01-09 10:38:37,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:38:37,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 10:38:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:37,903 INFO L225 Difference]: With dead ends: 1273 [2025-01-09 10:38:37,903 INFO L226 Difference]: Without dead ends: 908 [2025-01-09 10:38:37,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:38:37,905 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 513 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:37,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 715 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:38:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-01-09 10:38:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 708. [2025-01-09 10:38:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 593 states have (on average 1.5446880269814502) internal successors, (916), 595 states have internal predecessors, (916), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 10:38:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1134 transitions. [2025-01-09 10:38:37,948 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1134 transitions. Word has length 214 [2025-01-09 10:38:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:37,948 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1134 transitions. [2025-01-09 10:38:37,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1134 transitions. [2025-01-09 10:38:37,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:38:37,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:37,951 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:37,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:38:37,951 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:37,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1664780907, now seen corresponding path program 1 times [2025-01-09 10:38:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:37,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126756851] [2025-01-09 10:38:37,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:37,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:38:37,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:38:37,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:37,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:39,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:39,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126756851] [2025-01-09 10:38:39,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126756851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:39,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:39,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:38:39,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870277157] [2025-01-09 10:38:39,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:39,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:38:39,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:39,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:38:39,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:38:39,133 INFO L87 Difference]: Start difference. First operand 708 states and 1134 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:39,588 INFO L93 Difference]: Finished difference Result 1392 states and 2224 transitions. [2025-01-09 10:38:39,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:38:39,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 10:38:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:39,599 INFO L225 Difference]: With dead ends: 1392 [2025-01-09 10:38:39,599 INFO L226 Difference]: Without dead ends: 984 [2025-01-09 10:38:39,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:38:39,605 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 276 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:39,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 564 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:38:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-01-09 10:38:39,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 714. [2025-01-09 10:38:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 599 states have (on average 1.5358931552587647) internal successors, (920), 601 states have internal predecessors, (920), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 10:38:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1138 transitions. [2025-01-09 10:38:39,646 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1138 transitions. Word has length 214 [2025-01-09 10:38:39,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:39,646 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 1138 transitions. [2025-01-09 10:38:39,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1138 transitions. [2025-01-09 10:38:39,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:38:39,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:39,649 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:39,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:38:39,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:39,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:39,650 INFO L85 PathProgramCache]: Analyzing trace with hash -529067908, now seen corresponding path program 1 times [2025-01-09 10:38:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:39,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627343432] [2025-01-09 10:38:39,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:39,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:39,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:38:39,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:38:39,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:39,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:39,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627343432] [2025-01-09 10:38:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627343432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:39,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:39,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:38:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124965361] [2025-01-09 10:38:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:39,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:38:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:39,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:38:39,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:38:39,950 INFO L87 Difference]: Start difference. First operand 714 states and 1138 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:40,486 INFO L93 Difference]: Finished difference Result 1580 states and 2537 transitions. [2025-01-09 10:38:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:38:40,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 10:38:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:40,490 INFO L225 Difference]: With dead ends: 1580 [2025-01-09 10:38:40,491 INFO L226 Difference]: Without dead ends: 1146 [2025-01-09 10:38:40,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:38:40,492 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 355 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:40,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 784 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:38:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-01-09 10:38:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 712. [2025-01-09 10:38:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 597 states have (on average 1.5343383584589614) internal successors, (916), 599 states have internal predecessors, (916), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 10:38:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1134 transitions. [2025-01-09 10:38:40,534 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1134 transitions. Word has length 214 [2025-01-09 10:38:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:40,534 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1134 transitions. [2025-01-09 10:38:40,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1134 transitions. [2025-01-09 10:38:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:38:40,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:40,537 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:40,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:38:40,538 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:40,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash -539019012, now seen corresponding path program 1 times [2025-01-09 10:38:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:40,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483756305] [2025-01-09 10:38:40,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:40,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:38:40,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:38:40,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:40,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:41,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:41,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483756305] [2025-01-09 10:38:41,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483756305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:41,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:41,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:38:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030571557] [2025-01-09 10:38:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:41,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:38:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:41,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:38:41,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:38:41,275 INFO L87 Difference]: Start difference. First operand 712 states and 1134 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:41,946 INFO L93 Difference]: Finished difference Result 1418 states and 2227 transitions. [2025-01-09 10:38:41,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:38:41,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 10:38:41,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:41,954 INFO L225 Difference]: With dead ends: 1418 [2025-01-09 10:38:41,954 INFO L226 Difference]: Without dead ends: 1028 [2025-01-09 10:38:41,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:38:41,956 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 333 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:41,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 828 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:38:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-01-09 10:38:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 670. [2025-01-09 10:38:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 555 states have (on average 1.5243243243243243) internal successors, (846), 557 states have internal predecessors, (846), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 10:38:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1064 transitions. [2025-01-09 10:38:41,996 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1064 transitions. Word has length 214 [2025-01-09 10:38:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:41,996 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 1064 transitions. [2025-01-09 10:38:41,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1064 transitions. [2025-01-09 10:38:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:38:41,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:41,998 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:41,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:38:41,999 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:41,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2087482733, now seen corresponding path program 1 times [2025-01-09 10:38:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715006460] [2025-01-09 10:38:42,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:42,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:42,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:38:42,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:38:42,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:42,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:42,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:42,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715006460] [2025-01-09 10:38:42,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715006460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:42,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:42,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:38:42,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535708979] [2025-01-09 10:38:42,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:42,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:38:42,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:42,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:38:42,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:38:42,345 INFO L87 Difference]: Start difference. First operand 670 states and 1064 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:42,561 INFO L93 Difference]: Finished difference Result 1256 states and 1989 transitions. [2025-01-09 10:38:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:38:42,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 10:38:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:42,565 INFO L225 Difference]: With dead ends: 1256 [2025-01-09 10:38:42,565 INFO L226 Difference]: Without dead ends: 706 [2025-01-09 10:38:42,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:38:42,568 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 111 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:42,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 440 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:38:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-01-09 10:38:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 652. [2025-01-09 10:38:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 537 states have (on average 1.5083798882681565) internal successors, (810), 539 states have internal predecessors, (810), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-01-09 10:38:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1028 transitions. [2025-01-09 10:38:42,616 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1028 transitions. Word has length 214 [2025-01-09 10:38:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:42,616 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 1028 transitions. [2025-01-09 10:38:42,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1028 transitions. [2025-01-09 10:38:42,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 10:38:42,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:42,619 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:42,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:38:42,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:42,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:42,620 INFO L85 PathProgramCache]: Analyzing trace with hash -369249601, now seen corresponding path program 1 times [2025-01-09 10:38:42,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:42,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220525363] [2025-01-09 10:38:42,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:42,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:42,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 10:38:42,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 10:38:42,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:42,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:44,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:44,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220525363] [2025-01-09 10:38:44,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220525363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:44,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:44,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:38:44,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171767790] [2025-01-09 10:38:44,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:44,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:38:44,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:44,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:38:44,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:38:44,533 INFO L87 Difference]: Start difference. First operand 652 states and 1028 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:45,450 INFO L93 Difference]: Finished difference Result 1332 states and 2110 transitions. [2025-01-09 10:38:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:38:45,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-01-09 10:38:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:45,456 INFO L225 Difference]: With dead ends: 1332 [2025-01-09 10:38:45,456 INFO L226 Difference]: Without dead ends: 1010 [2025-01-09 10:38:45,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:38:45,458 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 571 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:45,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 822 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:38:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-01-09 10:38:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 542. [2025-01-09 10:38:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 437 states have (on average 1.4874141876430207) internal successors, (650), 437 states have internal predecessors, (650), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 10:38:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 848 transitions. [2025-01-09 10:38:45,495 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 848 transitions. Word has length 215 [2025-01-09 10:38:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:45,495 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 848 transitions. [2025-01-09 10:38:45,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 848 transitions. [2025-01-09 10:38:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 10:38:45,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:45,496 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:45,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:38:45,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:45,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:45,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2019950199, now seen corresponding path program 1 times [2025-01-09 10:38:45,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:45,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257637007] [2025-01-09 10:38:45,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:45,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:45,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 10:38:45,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 10:38:45,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:45,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:49,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:49,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:49,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257637007] [2025-01-09 10:38:49,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257637007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:49,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:49,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 10:38:49,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111111637] [2025-01-09 10:38:49,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:49,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:38:49,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:49,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:38:49,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:38:49,953 INFO L87 Difference]: Start difference. First operand 542 states and 848 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:51,818 INFO L93 Difference]: Finished difference Result 1196 states and 1872 transitions. [2025-01-09 10:38:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:38:51,819 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-01-09 10:38:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:51,822 INFO L225 Difference]: With dead ends: 1196 [2025-01-09 10:38:51,822 INFO L226 Difference]: Without dead ends: 852 [2025-01-09 10:38:51,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2025-01-09 10:38:51,823 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 428 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:51,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1301 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:38:51,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-01-09 10:38:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 639. [2025-01-09 10:38:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 534 states have (on average 1.5280898876404494) internal successors, (816), 534 states have internal predecessors, (816), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 10:38:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1014 transitions. [2025-01-09 10:38:51,859 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1014 transitions. Word has length 215 [2025-01-09 10:38:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:51,860 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 1014 transitions. [2025-01-09 10:38:51,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1014 transitions. [2025-01-09 10:38:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 10:38:51,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:51,862 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:51,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:38:51,862 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:51,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash -523649839, now seen corresponding path program 1 times [2025-01-09 10:38:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533955630] [2025-01-09 10:38:51,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:51,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 10:38:51,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 10:38:51,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:51,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:38:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:38:56,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:38:56,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533955630] [2025-01-09 10:38:56,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533955630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:38:56,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:38:56,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 10:38:56,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113033926] [2025-01-09 10:38:56,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:38:56,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:38:56,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:38:56,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:38:56,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:38:56,703 INFO L87 Difference]: Start difference. First operand 639 states and 1014 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:38:58,827 INFO L93 Difference]: Finished difference Result 1149 states and 1821 transitions. [2025-01-09 10:38:58,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:38:58,828 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2025-01-09 10:38:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:38:58,832 INFO L225 Difference]: With dead ends: 1149 [2025-01-09 10:38:58,832 INFO L226 Difference]: Without dead ends: 897 [2025-01-09 10:38:58,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2025-01-09 10:38:58,833 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 664 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:38:58,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 996 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:38:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2025-01-09 10:38:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 609. [2025-01-09 10:38:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 504 states have (on average 1.5198412698412698) internal successors, (766), 504 states have internal predecessors, (766), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 10:38:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 964 transitions. [2025-01-09 10:38:58,873 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 964 transitions. Word has length 216 [2025-01-09 10:38:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:38:58,873 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 964 transitions. [2025-01-09 10:38:58,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:38:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 964 transitions. [2025-01-09 10:38:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 10:38:58,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:38:58,875 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:58,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:38:58,875 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:38:58,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:38:58,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1865496163, now seen corresponding path program 1 times [2025-01-09 10:38:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:38:58,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115137064] [2025-01-09 10:38:58,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:38:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:38:58,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 10:38:58,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 10:38:58,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:38:58,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:39:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:39:02,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:39:02,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115137064] [2025-01-09 10:39:02,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115137064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:39:02,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:39:02,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 10:39:02,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061064108] [2025-01-09 10:39:02,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:39:02,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:39:02,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:39:02,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:39:02,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:39:02,521 INFO L87 Difference]: Start difference. First operand 609 states and 964 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:39:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:39:05,220 INFO L93 Difference]: Finished difference Result 1418 states and 2253 transitions. [2025-01-09 10:39:05,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 10:39:05,221 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2025-01-09 10:39:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:39:05,232 INFO L225 Difference]: With dead ends: 1418 [2025-01-09 10:39:05,232 INFO L226 Difference]: Without dead ends: 1166 [2025-01-09 10:39:05,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-01-09 10:39:05,233 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 719 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:39:05,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1458 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 10:39:05,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-01-09 10:39:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 899. [2025-01-09 10:39:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 724 states have (on average 1.5041436464088398) internal successors, (1089), 724 states have internal predecessors, (1089), 165 states have call successors, (165), 9 states have call predecessors, (165), 9 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2025-01-09 10:39:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1419 transitions. [2025-01-09 10:39:05,371 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1419 transitions. Word has length 216 [2025-01-09 10:39:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:39:05,371 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1419 transitions. [2025-01-09 10:39:05,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:39:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1419 transitions. [2025-01-09 10:39:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 10:39:05,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:39:05,378 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:05,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:39:05,378 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:39:05,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:39:05,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1408402779, now seen corresponding path program 1 times [2025-01-09 10:39:05,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:39:05,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656712414] [2025-01-09 10:39:05,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:39:05,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:39:05,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 10:39:05,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 10:39:05,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:39:05,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:39:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:39:10,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:39:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656712414] [2025-01-09 10:39:10,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656712414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:39:10,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:39:10,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:39:10,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743393396] [2025-01-09 10:39:10,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:39:10,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:39:10,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:39:10,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:39:10,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:39:10,939 INFO L87 Difference]: Start difference. First operand 899 states and 1419 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:39:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:39:19,469 INFO L93 Difference]: Finished difference Result 1832 states and 2861 transitions. [2025-01-09 10:39:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 10:39:19,469 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2025-01-09 10:39:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:39:19,474 INFO L225 Difference]: With dead ends: 1832 [2025-01-09 10:39:19,474 INFO L226 Difference]: Without dead ends: 1193 [2025-01-09 10:39:19,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2025-01-09 10:39:19,476 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 538 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:39:19,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1497 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 10:39:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-01-09 10:39:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 962. [2025-01-09 10:39:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 787 states have (on average 1.5006353240152477) internal successors, (1181), 787 states have internal predecessors, (1181), 165 states have call successors, (165), 9 states have call predecessors, (165), 9 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2025-01-09 10:39:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1511 transitions. [2025-01-09 10:39:19,553 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1511 transitions. Word has length 216 [2025-01-09 10:39:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:39:19,554 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1511 transitions. [2025-01-09 10:39:19,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 10:39:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1511 transitions. [2025-01-09 10:39:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 10:39:19,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:39:19,555 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:19,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 10:39:19,556 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:39:19,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:39:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash -520270850, now seen corresponding path program 1 times [2025-01-09 10:39:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:39:19,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544919020] [2025-01-09 10:39:19,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:39:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:39:19,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 10:39:19,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 10:39:19,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:39:19,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:39:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 10:39:39,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:39:39,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544919020] [2025-01-09 10:39:39,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544919020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:39:39,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:39:39,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:39:39,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105554655] [2025-01-09 10:39:39,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:39:39,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:39:39,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:39:39,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:39:39,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:39:39,229 INFO L87 Difference]: Start difference. First operand 962 states and 1511 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 10:39:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:39:40,606 INFO L93 Difference]: Finished difference Result 1381 states and 2138 transitions. [2025-01-09 10:39:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:39:40,607 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 217 [2025-01-09 10:39:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:39:40,613 INFO L225 Difference]: With dead ends: 1381 [2025-01-09 10:39:40,613 INFO L226 Difference]: Without dead ends: 1379 [2025-01-09 10:39:40,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-01-09 10:39:40,614 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 573 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:39:40,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1345 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:39:40,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-01-09 10:39:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1058. [2025-01-09 10:39:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 883 states have (on average 1.5084937712344282) internal successors, (1332), 883 states have internal predecessors, (1332), 165 states have call successors, (165), 9 states have call predecessors, (165), 9 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2025-01-09 10:39:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1662 transitions. [2025-01-09 10:39:40,675 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1662 transitions. Word has length 217 [2025-01-09 10:39:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:39:40,676 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1662 transitions. [2025-01-09 10:39:40,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 10:39:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1662 transitions. [2025-01-09 10:39:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 10:39:40,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:39:40,678 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:40,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 10:39:40,678 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:39:40,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:39:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1402957184, now seen corresponding path program 1 times [2025-01-09 10:39:40,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:39:40,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473516198] [2025-01-09 10:39:40,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:39:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:39:40,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 10:39:40,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 10:39:40,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:39:40,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat