./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.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-pr-co_file-81.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 d402cd14beee6851ca97c58b2a2589220820214ac9c394c1c5bdac6dbc1a1025 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:34:13,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:34:13,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:34:13,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:34:13,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:34:13,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:34:13,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:34:13,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:34:13,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:34:13,688 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:34:13,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:34:13,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:34:13,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:34:13,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:34:13,689 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:34:13,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:34:13,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:34:13,690 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:34:13,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:34:13,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:34:13,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:34:13,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:34:13,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:34:13,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:34:13,690 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:34:13,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:34:13,690 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:34:13,691 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:34:13,691 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:34:13,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:34:13,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:34:13,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:34:13,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:34:13,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:34:13,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:34:13,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:34:13,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:34:13,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:34:13,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:34:13,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:34:13,692 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:34:13,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:34:13,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:34:13,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:34:13,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:34:13,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:34:13,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:34:13,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:34:13,692 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 -> d402cd14beee6851ca97c58b2a2589220820214ac9c394c1c5bdac6dbc1a1025 [2025-01-09 11:34:13,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:34:13,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:34:13,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:34:13,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:34:13,903 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:34:13,904 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-pr-co_file-81.i [2025-01-09 11:34:15,023 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32bfa83f4/d5ab4d7046a7418e9e6e0f389dc5c1ef/FLAGb0a22f5c2 [2025-01-09 11:34:15,283 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:34:15,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i [2025-01-09 11:34:15,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32bfa83f4/d5ab4d7046a7418e9e6e0f389dc5c1ef/FLAGb0a22f5c2 [2025-01-09 11:34:15,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32bfa83f4/d5ab4d7046a7418e9e6e0f389dc5c1ef [2025-01-09 11:34:15,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:34:15,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:34:15,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:34:15,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:34:15,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:34:15,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19722464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15, skipping insertion in model container [2025-01-09 11:34:15,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:34:15,723 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-pr-co_file-81.i[919,932] [2025-01-09 11:34:15,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:34:15,801 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:34:15,808 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-pr-co_file-81.i[919,932] [2025-01-09 11:34:15,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:34:15,847 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:34:15,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15 WrapperNode [2025-01-09 11:34:15,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:34:15,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:34:15,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:34:15,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:34:15,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,900 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 299 [2025-01-09 11:34:15,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:34:15,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:34:15,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:34:15,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:34:15,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,932 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 11:34:15,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:34:15,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:34:15,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:34:15,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:34:15,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (1/1) ... [2025-01-09 11:34:15,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:34:15,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:34:15,974 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 11:34:15,979 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 11:34:15,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:34:15,991 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:34:15,991 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:34:15,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:34:15,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:34:15,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:34:16,068 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:34:16,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:34:16,478 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 11:34:16,478 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:34:16,487 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:34:16,489 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:34:16,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:34:16 BoogieIcfgContainer [2025-01-09 11:34:16,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:34:16,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:34:16,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:34:16,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:34:16,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:34:15" (1/3) ... [2025-01-09 11:34:16,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148c04d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:34:16, skipping insertion in model container [2025-01-09 11:34:16,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:34:15" (2/3) ... [2025-01-09 11:34:16,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148c04d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:34:16, skipping insertion in model container [2025-01-09 11:34:16,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:34:16" (3/3) ... [2025-01-09 11:34:16,495 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i [2025-01-09 11:34:16,504 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:34:16,505 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:34:16,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:34:16,569 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;@6a7b94d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:34:16,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:34:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 11:34:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 11:34:16,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:34:16,586 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:16,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:34:16,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:34:16,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1680492675, now seen corresponding path program 1 times [2025-01-09 11:34:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:34:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682655758] [2025-01-09 11:34:16,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:34:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:34:16,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 11:34:16,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 11:34:16,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:34:16,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:34:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-01-09 11:34:16,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:34:16,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682655758] [2025-01-09 11:34:16,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682655758] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:34:16,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355249476] [2025-01-09 11:34:16,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:34:16,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:34:16,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:34:16,910 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 11:34:16,912 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 11:34:16,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 11:34:17,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 11:34:17,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:34:17,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:34:17,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:34:17,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:34:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-01-09 11:34:17,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:34:17,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355249476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:34:17,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:34:17,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:34:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398824230] [2025-01-09 11:34:17,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:34:17,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:34:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:34:17,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:34:17,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:34:17,165 INFO L87 Difference]: Start difference. First operand has 130 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 11:34:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:34:17,189 INFO L93 Difference]: Finished difference Result 254 states and 459 transitions. [2025-01-09 11:34:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:34:17,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2025-01-09 11:34:17,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:34:17,195 INFO L225 Difference]: With dead ends: 254 [2025-01-09 11:34:17,195 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 11:34:17,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 296 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 11:34:17,200 INFO L435 NwaCegarLoop]: 203 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, 203 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 11:34:17,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:34:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 11:34:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-01-09 11:34:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 11:34:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 203 transitions. [2025-01-09 11:34:17,265 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 203 transitions. Word has length 295 [2025-01-09 11:34:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:34:17,265 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 203 transitions. [2025-01-09 11:34:17,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 11:34:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 203 transitions. [2025-01-09 11:34:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 11:34:17,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:34:17,269 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:17,277 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 11:34:17,470 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 11:34:17,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:34:17,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:34:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash 312019061, now seen corresponding path program 1 times [2025-01-09 11:34:17,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:34:17,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586124324] [2025-01-09 11:34:17,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:34:17,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:34:17,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 11:34:17,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 11:34:17,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:34:17,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:34:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:34:28,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:34:28,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586124324] [2025-01-09 11:34:28,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586124324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:34:28,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:34:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:34:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983211754] [2025-01-09 11:34:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:34:28,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:34:28,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:34:28,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:34:28,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:34:28,604 INFO L87 Difference]: Start difference. First operand 127 states and 203 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 11:34:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:34:31,222 INFO L93 Difference]: Finished difference Result 519 states and 831 transitions. [2025-01-09 11:34:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:34:31,223 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2025-01-09 11:34:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:34:31,229 INFO L225 Difference]: With dead ends: 519 [2025-01-09 11:34:31,229 INFO L226 Difference]: Without dead ends: 395 [2025-01-09 11:34:31,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:34:31,231 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1017 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:34:31,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 1204 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 11:34:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-01-09 11:34:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 240. [2025-01-09 11:34:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 141 states have (on average 1.3829787234042554) internal successors, (195), 141 states have internal predecessors, (195), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 11:34:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 387 transitions. [2025-01-09 11:34:31,312 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 387 transitions. Word has length 295 [2025-01-09 11:34:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:34:31,315 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 387 transitions. [2025-01-09 11:34:31,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 11:34:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 387 transitions. [2025-01-09 11:34:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 11:34:31,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:34:31,324 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:31,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:34:31,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:34:31,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:34:31,324 INFO L85 PathProgramCache]: Analyzing trace with hash -699098189, now seen corresponding path program 1 times [2025-01-09 11:34:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:34:31,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514955275] [2025-01-09 11:34:31,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:34:31,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:34:31,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 11:34:31,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 11:34:31,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:34:31,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:34:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:34:31,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:34:31,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514955275] [2025-01-09 11:34:31,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514955275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:34:31,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:34:31,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:34:31,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943448891] [2025-01-09 11:34:31,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:34:31,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:34:31,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:34:31,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:34:31,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:34:31,696 INFO L87 Difference]: Start difference. First operand 240 states and 387 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:34:31,805 INFO L93 Difference]: Finished difference Result 418 states and 671 transitions. [2025-01-09 11:34:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:34:31,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-01-09 11:34:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:34:31,810 INFO L225 Difference]: With dead ends: 418 [2025-01-09 11:34:31,810 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 11:34:31,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:34:31,812 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 72 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:34:31,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 600 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:34:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 11:34:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2025-01-09 11:34:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 187 states have (on average 1.4224598930481283) internal successors, (266), 188 states have internal predecessors, (266), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 11:34:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 466 transitions. [2025-01-09 11:34:31,832 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 466 transitions. Word has length 295 [2025-01-09 11:34:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:34:31,833 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 466 transitions. [2025-01-09 11:34:31,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 466 transitions. [2025-01-09 11:34:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 11:34:31,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:34:31,835 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:31,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:34:31,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:34:31,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:34:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1682125645, now seen corresponding path program 1 times [2025-01-09 11:34:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:34:31,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068019014] [2025-01-09 11:34:31,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:34:31,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:34:31,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 11:34:31,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 11:34:31,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:34:31,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:34:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:34:32,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:34:32,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068019014] [2025-01-09 11:34:32,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068019014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:34:32,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:34:32,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:34:32,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772086993] [2025-01-09 11:34:32,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:34:32,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:34:32,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:34:32,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:34:32,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:34:32,426 INFO L87 Difference]: Start difference. First operand 291 states and 466 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:34:32,967 INFO L93 Difference]: Finished difference Result 635 states and 1021 transitions. [2025-01-09 11:34:32,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:34:32,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-01-09 11:34:32,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:34:32,972 INFO L225 Difference]: With dead ends: 635 [2025-01-09 11:34:32,972 INFO L226 Difference]: Without dead ends: 460 [2025-01-09 11:34:32,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:34:32,973 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 357 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:34:32,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 789 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:34:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-09 11:34:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 305. [2025-01-09 11:34:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 201 states have (on average 1.427860696517413) internal successors, (287), 202 states have internal predecessors, (287), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 11:34:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 487 transitions. [2025-01-09 11:34:33,005 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 487 transitions. Word has length 295 [2025-01-09 11:34:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:34:33,005 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 487 transitions. [2025-01-09 11:34:33,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 487 transitions. [2025-01-09 11:34:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 11:34:33,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:34:33,008 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:33,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:34:33,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:34:33,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:34:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash 734720887, now seen corresponding path program 1 times [2025-01-09 11:34:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:34:33,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472162604] [2025-01-09 11:34:33,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:34:33,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:34:33,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 11:34:33,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 11:34:33,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:34:33,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:34:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:34:41,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:34:41,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472162604] [2025-01-09 11:34:41,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472162604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:34:41,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:34:41,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 11:34:41,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39633898] [2025-01-09 11:34:41,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:34:41,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:34:41,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:34:41,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:34:41,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:34:41,820 INFO L87 Difference]: Start difference. First operand 305 states and 487 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:34:43,834 INFO L93 Difference]: Finished difference Result 619 states and 985 transitions. [2025-01-09 11:34:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:34:43,835 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-01-09 11:34:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:34:43,838 INFO L225 Difference]: With dead ends: 619 [2025-01-09 11:34:43,838 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 11:34:43,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-01-09 11:34:43,839 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 407 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:34:43,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 960 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 11:34:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 11:34:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 302. [2025-01-09 11:34:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 198 states have (on average 1.4292929292929293) internal successors, (283), 199 states have internal predecessors, (283), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 11:34:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 483 transitions. [2025-01-09 11:34:43,861 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 483 transitions. Word has length 295 [2025-01-09 11:34:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:34:43,861 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 483 transitions. [2025-01-09 11:34:43,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 483 transitions. [2025-01-09 11:34:43,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 11:34:43,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:34:43,863 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:43,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:34:43,863 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:34:43,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:34:43,864 INFO L85 PathProgramCache]: Analyzing trace with hash 664780846, now seen corresponding path program 1 times [2025-01-09 11:34:43,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:34:43,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746928426] [2025-01-09 11:34:43,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:34:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:34:43,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 11:34:43,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 11:34:43,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:34:43,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:34:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:34:44,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:34:44,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746928426] [2025-01-09 11:34:44,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746928426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:34:44,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:34:44,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:34:44,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499739416] [2025-01-09 11:34:44,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:34:44,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:34:44,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:34:44,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:34:44,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:34:44,689 INFO L87 Difference]: Start difference. First operand 302 states and 483 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:34:46,136 INFO L93 Difference]: Finished difference Result 852 states and 1361 transitions. [2025-01-09 11:34:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:34:46,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-01-09 11:34:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:34:46,140 INFO L225 Difference]: With dead ends: 852 [2025-01-09 11:34:46,140 INFO L226 Difference]: Without dead ends: 677 [2025-01-09 11:34:46,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:34:46,142 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 527 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:34:46,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1505 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 11:34:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-01-09 11:34:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 333. [2025-01-09 11:34:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 229 states have (on average 1.4716157205240175) internal successors, (337), 230 states have internal predecessors, (337), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 11:34:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 537 transitions. [2025-01-09 11:34:46,173 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 537 transitions. Word has length 296 [2025-01-09 11:34:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:34:46,173 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 537 transitions. [2025-01-09 11:34:46,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 537 transitions. [2025-01-09 11:34:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 11:34:46,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:34:46,175 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:46,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:34:46,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:34:46,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:34:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2041838548, now seen corresponding path program 1 times [2025-01-09 11:34:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:34:46,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220550839] [2025-01-09 11:34:46,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:34:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:34:46,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 11:34:46,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 11:34:46,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:34:46,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:34:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:34:46,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:34:46,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220550839] [2025-01-09 11:34:46,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220550839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:34:46,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:34:46,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:34:46,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592856431] [2025-01-09 11:34:46,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:34:46,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:34:46,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:34:46,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:34:46,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:34:46,639 INFO L87 Difference]: Start difference. First operand 333 states and 537 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:47,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:34:47,074 INFO L93 Difference]: Finished difference Result 569 states and 913 transitions. [2025-01-09 11:34:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:34:47,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-01-09 11:34:47,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:34:47,078 INFO L225 Difference]: With dead ends: 569 [2025-01-09 11:34:47,078 INFO L226 Difference]: Without dead ends: 370 [2025-01-09 11:34:47,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:34:47,079 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 259 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:34:47,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 737 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:34:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-01-09 11:34:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 301. [2025-01-09 11:34:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 197 states have (on average 1.4314720812182742) internal successors, (282), 198 states have internal predecessors, (282), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 11:34:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 482 transitions. [2025-01-09 11:34:47,112 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 482 transitions. Word has length 296 [2025-01-09 11:34:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:34:47,112 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 482 transitions. [2025-01-09 11:34:47,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 482 transitions. [2025-01-09 11:34:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 11:34:47,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:34:47,115 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:47,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:34:47,115 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:34:47,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:34:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1808973456, now seen corresponding path program 1 times [2025-01-09 11:34:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:34:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311819664] [2025-01-09 11:34:47,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:34:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:34:47,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 11:34:47,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 11:34:47,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:34:47,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:34:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:34:53,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:34:53,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311819664] [2025-01-09 11:34:53,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311819664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:34:53,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:34:53,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 11:34:53,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521192773] [2025-01-09 11:34:53,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:34:53,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:34:53,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:34:53,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:34:53,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:34:53,962 INFO L87 Difference]: Start difference. First operand 301 states and 482 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:34:55,656 INFO L93 Difference]: Finished difference Result 710 states and 1127 transitions. [2025-01-09 11:34:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:34:55,657 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-01-09 11:34:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:34:55,660 INFO L225 Difference]: With dead ends: 710 [2025-01-09 11:34:55,660 INFO L226 Difference]: Without dead ends: 535 [2025-01-09 11:34:55,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:34:55,663 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 678 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:34:55,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 973 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 11:34:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-01-09 11:34:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 315. [2025-01-09 11:34:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 211 states have (on average 1.4549763033175356) internal successors, (307), 212 states have internal predecessors, (307), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 11:34:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 507 transitions. [2025-01-09 11:34:55,695 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 507 transitions. Word has length 296 [2025-01-09 11:34:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:34:55,695 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 507 transitions. [2025-01-09 11:34:55,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:34:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 507 transitions. [2025-01-09 11:34:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 11:34:55,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:34:55,698 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:55,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:34:55,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:34:55,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:34:55,699 INFO L85 PathProgramCache]: Analyzing trace with hash 797856206, now seen corresponding path program 1 times [2025-01-09 11:34:55,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:34:55,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069577563] [2025-01-09 11:34:55,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:34:55,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:34:55,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 11:34:55,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 11:34:55,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:34:55,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:35:00,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:00,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069577563] [2025-01-09 11:35:00,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069577563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:00,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:00,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:35:00,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619012289] [2025-01-09 11:35:00,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:00,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:35:00,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:00,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:35:00,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:35:00,411 INFO L87 Difference]: Start difference. First operand 315 states and 507 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:35:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:03,422 INFO L93 Difference]: Finished difference Result 788 states and 1247 transitions. [2025-01-09 11:35:03,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 11:35:03,423 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-01-09 11:35:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:03,427 INFO L225 Difference]: With dead ends: 788 [2025-01-09 11:35:03,427 INFO L226 Difference]: Without dead ends: 613 [2025-01-09 11:35:03,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2025-01-09 11:35:03,428 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 878 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:03,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1314 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 11:35:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-01-09 11:35:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 333. [2025-01-09 11:35:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 229 states have (on average 1.4672489082969433) internal successors, (336), 230 states have internal predecessors, (336), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 11:35:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 536 transitions. [2025-01-09 11:35:03,455 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 536 transitions. Word has length 296 [2025-01-09 11:35:03,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:03,456 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 536 transitions. [2025-01-09 11:35:03,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:35:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 536 transitions. [2025-01-09 11:35:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 11:35:03,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:03,458 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:03,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:35:03,458 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:03,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:03,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2063292014, now seen corresponding path program 1 times [2025-01-09 11:35:03,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130418745] [2025-01-09 11:35:03,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:03,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 11:35:03,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 11:35:03,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:03,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:35:09,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:09,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130418745] [2025-01-09 11:35:09,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130418745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:09,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:09,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:35:09,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232577437] [2025-01-09 11:35:09,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:09,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:35:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:09,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:35:09,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:35:09,695 INFO L87 Difference]: Start difference. First operand 333 states and 536 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:35:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:10,262 INFO L93 Difference]: Finished difference Result 660 states and 1053 transitions. [2025-01-09 11:35:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:35:10,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-01-09 11:35:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:10,271 INFO L225 Difference]: With dead ends: 660 [2025-01-09 11:35:10,271 INFO L226 Difference]: Without dead ends: 485 [2025-01-09 11:35:10,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:35:10,272 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 445 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:10,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 666 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:35:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-01-09 11:35:10,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 350. [2025-01-09 11:35:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 246 states have (on average 1.4878048780487805) internal successors, (366), 247 states have internal predecessors, (366), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 11:35:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 566 transitions. [2025-01-09 11:35:10,317 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 566 transitions. Word has length 296 [2025-01-09 11:35:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:10,317 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 566 transitions. [2025-01-09 11:35:10,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:35:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 566 transitions. [2025-01-09 11:35:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 11:35:10,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:10,319 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:10,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:35:10,319 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:10,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1220558032, now seen corresponding path program 1 times [2025-01-09 11:35:10,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:10,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989295352] [2025-01-09 11:35:10,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:10,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 11:35:10,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 11:35:10,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:10,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:35:11,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:11,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989295352] [2025-01-09 11:35:11,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989295352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:11,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:11,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:35:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556436672] [2025-01-09 11:35:11,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:11,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:35:11,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:11,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:35:11,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:35:11,190 INFO L87 Difference]: Start difference. First operand 350 states and 566 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:35:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:11,869 INFO L93 Difference]: Finished difference Result 690 states and 1108 transitions. [2025-01-09 11:35:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:35:11,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-01-09 11:35:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:11,872 INFO L225 Difference]: With dead ends: 690 [2025-01-09 11:35:11,872 INFO L226 Difference]: Without dead ends: 478 [2025-01-09 11:35:11,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:35:11,873 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 446 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:11,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 858 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:35:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-01-09 11:35:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 347. [2025-01-09 11:35:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 244 states have internal predecessors, (362), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 11:35:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 562 transitions. [2025-01-09 11:35:11,898 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 562 transitions. Word has length 296 [2025-01-09 11:35:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:11,899 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 562 transitions. [2025-01-09 11:35:11,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:35:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 562 transitions. [2025-01-09 11:35:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 11:35:11,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:11,900 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:11,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:35:11,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:11,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1674959950, now seen corresponding path program 1 times [2025-01-09 11:35:11,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:11,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775975669] [2025-01-09 11:35:11,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:11,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:11,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 11:35:11,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 11:35:11,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:11,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:35:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775975669] [2025-01-09 11:35:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775975669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:12,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:12,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:35:12,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469349818] [2025-01-09 11:35:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:12,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:35:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:12,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:35:12,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:35:12,053 INFO L87 Difference]: Start difference. First operand 347 states and 562 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:35:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:12,110 INFO L93 Difference]: Finished difference Result 617 states and 993 transitions. [2025-01-09 11:35:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:35:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-01-09 11:35:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:12,113 INFO L225 Difference]: With dead ends: 617 [2025-01-09 11:35:12,113 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 11:35:12,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:35:12,114 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 126 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:12,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 679 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:35:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 11:35:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 337. [2025-01-09 11:35:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 236 states have (on average 1.5) internal successors, (354), 236 states have internal predecessors, (354), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 11:35:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 546 transitions. [2025-01-09 11:35:12,139 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 546 transitions. Word has length 296 [2025-01-09 11:35:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:12,139 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 546 transitions. [2025-01-09 11:35:12,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:35:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 546 transitions. [2025-01-09 11:35:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 11:35:12,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:12,141 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:12,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:35:12,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:12,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:12,141 INFO L85 PathProgramCache]: Analyzing trace with hash 663842700, now seen corresponding path program 1 times [2025-01-09 11:35:12,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:12,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124620819] [2025-01-09 11:35:12,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:12,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 11:35:12,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 11:35:12,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:12,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:35:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124620819] [2025-01-09 11:35:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124620819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:18,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:35:18,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73779588] [2025-01-09 11:35:18,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:18,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:35:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:18,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:35:18,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:35:18,885 INFO L87 Difference]: Start difference. First operand 337 states and 546 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 11:35:20,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:20,685 INFO L93 Difference]: Finished difference Result 642 states and 1032 transitions. [2025-01-09 11:35:20,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:35:20,686 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 296 [2025-01-09 11:35:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:20,688 INFO L225 Difference]: With dead ends: 642 [2025-01-09 11:35:20,688 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 11:35:20,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:35:20,689 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 525 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:20,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1152 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:35:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 11:35:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 345. [2025-01-09 11:35:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 244 states have (on average 1.5040983606557377) internal successors, (367), 244 states have internal predecessors, (367), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 11:35:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 559 transitions. [2025-01-09 11:35:20,713 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 559 transitions. Word has length 296 [2025-01-09 11:35:20,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:20,714 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 559 transitions. [2025-01-09 11:35:20,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 11:35:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 559 transitions. [2025-01-09 11:35:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 11:35:20,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:20,715 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:20,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 11:35:20,715 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:20,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:20,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1086544526, now seen corresponding path program 1 times [2025-01-09 11:35:20,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:20,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502977259] [2025-01-09 11:35:20,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:20,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:20,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 11:35:20,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 11:35:20,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:20,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:35:26,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:26,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502977259] [2025-01-09 11:35:26,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502977259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:26,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:26,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 11:35:26,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291456253] [2025-01-09 11:35:26,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:26,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:35:26,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:26,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:35:26,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:35:26,349 INFO L87 Difference]: Start difference. First operand 345 states and 559 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:35:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:27,568 INFO L93 Difference]: Finished difference Result 631 states and 1018 transitions. [2025-01-09 11:35:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:35:27,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-01-09 11:35:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:27,572 INFO L225 Difference]: With dead ends: 631 [2025-01-09 11:35:27,572 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 11:35:27,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-01-09 11:35:27,573 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 242 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:27,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1066 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:35:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 11:35:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 342. [2025-01-09 11:35:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 241 states have (on average 1.5062240663900415) internal successors, (363), 241 states have internal predecessors, (363), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 11:35:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 555 transitions. [2025-01-09 11:35:27,604 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 555 transitions. Word has length 296 [2025-01-09 11:35:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:27,605 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 555 transitions. [2025-01-09 11:35:27,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:35:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 555 transitions. [2025-01-09 11:35:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-09 11:35:27,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:27,606 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:27,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 11:35:27,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:27,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1631540880, now seen corresponding path program 1 times [2025-01-09 11:35:27,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:27,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123980211] [2025-01-09 11:35:27,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:27,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:27,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 11:35:27,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 11:35:27,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:27,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat