./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_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-pe-ci_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 6b77a3b8187af54765a505f7649175cf18add0380d30145d0f26a5ac8cc02bbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:32:24,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:32:24,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:32:24,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:32:24,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:32:24,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:32:24,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:32:24,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:32:24,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:32:24,451 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:32:24,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:32:24,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:32:24,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:32:24,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:32:24,452 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:32:24,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:32:24,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:32:24,452 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:32:24,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:32:24,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:32:24,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:32:24,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:32:24,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:32:24,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:24,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:32:24,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:24,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:32:24,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:32:24,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:32:24,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:32:24,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:32:24,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:32:24,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:32:24,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:32:24,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:32:24,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:32:24,454 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 -> 6b77a3b8187af54765a505f7649175cf18add0380d30145d0f26a5ac8cc02bbd [2025-01-09 10:32:24,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:32:24,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:32:24,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:32:24,764 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:32:24,764 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:32:24,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-81.i [2025-01-09 10:32:26,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b02e6877e/86a39031c3b64eb38d7103c77fca8a98/FLAG5299a94b2 [2025-01-09 10:32:26,481 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:32:26,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-81.i [2025-01-09 10:32:26,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b02e6877e/86a39031c3b64eb38d7103c77fca8a98/FLAG5299a94b2 [2025-01-09 10:32:26,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b02e6877e/86a39031c3b64eb38d7103c77fca8a98 [2025-01-09 10:32:26,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:32:26,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:32:26,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:32:26,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:32:26,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:32:26,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:26,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26, skipping insertion in model container [2025-01-09 10:32:26,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:26,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:32:26,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-81.i[919,932] [2025-01-09 10:32:26,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:32:26,822 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:32:26,835 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-81.i[919,932] [2025-01-09 10:32:26,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:32:26,911 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:32:26,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26 WrapperNode [2025-01-09 10:32:26,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:32:26,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:32:26,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:32:26,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:32:26,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:26,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:26,996 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2025-01-09 10:32:27,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:32:27,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:32:27,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:32:27,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:32:27,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:27,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:27,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:27,049 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:32:27,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:27,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:27,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:27,070 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:27,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:27,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:27,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:27,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:32:27,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:32:27,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:32:27,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:32:27,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (1/1) ... [2025-01-09 10:32:27,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:27,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:27,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:32:27,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:32:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:32:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:32:27,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:32:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:32:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:32:27,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:32:27,263 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:32:27,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:32:27,726 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 10:32:27,726 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:32:27,738 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:32:27,740 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:32:27,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:27 BoogieIcfgContainer [2025-01-09 10:32:27,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:32:27,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:32:27,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:32:27,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:32:27,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:32:26" (1/3) ... [2025-01-09 10:32:27,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213e1efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:27, skipping insertion in model container [2025-01-09 10:32:27,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:26" (2/3) ... [2025-01-09 10:32:27,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213e1efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:27, skipping insertion in model container [2025-01-09 10:32:27,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:27" (3/3) ... [2025-01-09 10:32:27,754 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-81.i [2025-01-09 10:32:27,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:32:27,771 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-81.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:32:27,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:32:27,840 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;@4186f816, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:32:27,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:32:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 10:32:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 10:32:27,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:27,857 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:27,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:27,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1009060745, now seen corresponding path program 1 times [2025-01-09 10:32:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:27,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602342539] [2025-01-09 10:32:27,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:27,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:27,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 10:32:28,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 10:32:28,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:28,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 10:32:28,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:28,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602342539] [2025-01-09 10:32:28,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602342539] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:32:28,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648585866] [2025-01-09 10:32:28,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:28,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:28,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:28,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:32:28,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:32:28,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 10:32:28,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 10:32:28,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:28,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:28,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:32:28,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:32:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 10:32:28,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:32:28,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648585866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:28,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:32:28,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:32:28,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145569342] [2025-01-09 10:32:28,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:28,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:32:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:28,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:32:28,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:32:28,584 INFO L87 Difference]: Start difference. First operand has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 10:32:28,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:28,613 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2025-01-09 10:32:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:32:28,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-01-09 10:32:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:28,625 INFO L225 Difference]: With dead ends: 204 [2025-01-09 10:32:28,626 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 10:32:28,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:32:28,631 INFO L435 NwaCegarLoop]: 161 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, 161 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:28,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:32:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 10:32:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 10:32:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 10:32:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 161 transitions. [2025-01-09 10:32:28,674 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 161 transitions. Word has length 202 [2025-01-09 10:32:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:28,674 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 161 transitions. [2025-01-09 10:32:28,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 10:32:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 161 transitions. [2025-01-09 10:32:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 10:32:28,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:28,678 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:28,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:32:28,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:32:28,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:28,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1583891437, now seen corresponding path program 1 times [2025-01-09 10:32:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:28,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441095049] [2025-01-09 10:32:28,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:28,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 10:32:28,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 10:32:28,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:28,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:32:29,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:29,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441095049] [2025-01-09 10:32:29,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441095049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:29,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:32:29,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:32:29,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655093221] [2025-01-09 10:32:29,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:29,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:32:29,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:29,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:32:29,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:32:29,287 INFO L87 Difference]: Start difference. First operand 102 states and 161 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:32:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:29,453 INFO L93 Difference]: Finished difference Result 300 states and 470 transitions. [2025-01-09 10:32:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:32:29,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-01-09 10:32:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:29,458 INFO L225 Difference]: With dead ends: 300 [2025-01-09 10:32:29,459 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 10:32:29,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:32:29,463 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 148 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:29,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 427 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:32:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 10:32:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2025-01-09 10:32:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 150 states have (on average 1.4666666666666666) internal successors, (220), 152 states have internal predecessors, (220), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 10:32:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 302 transitions. [2025-01-09 10:32:29,502 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 302 transitions. Word has length 202 [2025-01-09 10:32:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:29,503 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 302 transitions. [2025-01-09 10:32:29,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:32:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 302 transitions. [2025-01-09 10:32:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 10:32:29,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:29,506 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:29,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:32:29,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:29,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:29,512 INFO L85 PathProgramCache]: Analyzing trace with hash -105052305, now seen corresponding path program 1 times [2025-01-09 10:32:29,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:29,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036031067] [2025-01-09 10:32:29,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:29,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 10:32:29,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 10:32:29,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:29,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:32:30,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:30,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036031067] [2025-01-09 10:32:30,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036031067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:30,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:32:30,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:32:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255299645] [2025-01-09 10:32:30,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:30,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:32:30,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:30,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:32:30,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:32:30,175 INFO L87 Difference]: Start difference. First operand 195 states and 302 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:32:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:30,300 INFO L93 Difference]: Finished difference Result 462 states and 712 transitions. [2025-01-09 10:32:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:32:30,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-01-09 10:32:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:30,309 INFO L225 Difference]: With dead ends: 462 [2025-01-09 10:32:30,310 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 10:32:30,311 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 10:32:30,312 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 74 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:30,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 450 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:32:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 10:32:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 245. [2025-01-09 10:32:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 195 states have (on average 1.471794871794872) internal successors, (287), 198 states have internal predecessors, (287), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 10:32:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 377 transitions. [2025-01-09 10:32:30,349 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 377 transitions. Word has length 202 [2025-01-09 10:32:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:30,350 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 377 transitions. [2025-01-09 10:32:30,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:32:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 377 transitions. [2025-01-09 10:32:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 10:32:30,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:30,353 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:30,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:32:30,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:30,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:30,355 INFO L85 PathProgramCache]: Analyzing trace with hash 766242987, now seen corresponding path program 1 times [2025-01-09 10:32:30,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:30,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861088514] [2025-01-09 10:32:30,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:30,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:30,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 10:32:30,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 10:32:30,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:30,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:32:47,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:47,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861088514] [2025-01-09 10:32:47,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861088514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:47,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:32:47,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:32:47,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428285111] [2025-01-09 10:32:47,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:47,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:32:47,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:47,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:32:47,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:32:47,217 INFO L87 Difference]: Start difference. First operand 245 states and 377 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:32:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:50,552 INFO L93 Difference]: Finished difference Result 929 states and 1426 transitions. [2025-01-09 10:32:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 10:32:50,555 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-01-09 10:32:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:50,559 INFO L225 Difference]: With dead ends: 929 [2025-01-09 10:32:50,559 INFO L226 Difference]: Without dead ends: 687 [2025-01-09 10:32:50,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2025-01-09 10:32:50,561 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 494 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:50,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 765 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 10:32:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-01-09 10:32:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 350. [2025-01-09 10:32:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 268 states have (on average 1.4514925373134329) internal successors, (389), 271 states have internal predecessors, (389), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 10:32:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 541 transitions. [2025-01-09 10:32:50,611 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 541 transitions. Word has length 202 [2025-01-09 10:32:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:50,613 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 541 transitions. [2025-01-09 10:32:50,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:32:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 541 transitions. [2025-01-09 10:32:50,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 10:32:50,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:50,618 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:50,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:32:50,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:50,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:50,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1188944813, now seen corresponding path program 1 times [2025-01-09 10:32:50,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:50,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024516377] [2025-01-09 10:32:50,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:50,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:50,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 10:32:50,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 10:32:50,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:50,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:32:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:51,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024516377] [2025-01-09 10:32:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024516377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:51,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:32:51,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:32:51,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268206846] [2025-01-09 10:32:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:51,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:32:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:51,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:32:51,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:32:51,527 INFO L87 Difference]: Start difference. First operand 350 states and 541 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:32:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:52,641 INFO L93 Difference]: Finished difference Result 1147 states and 1758 transitions. [2025-01-09 10:32:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 10:32:52,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-01-09 10:32:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:52,650 INFO L225 Difference]: With dead ends: 1147 [2025-01-09 10:32:52,650 INFO L226 Difference]: Without dead ends: 905 [2025-01-09 10:32:52,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:32:52,651 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 375 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:52,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1310 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:32:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-01-09 10:32:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 622. [2025-01-09 10:32:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 512 states have (on average 1.50390625) internal successors, (770), 519 states have internal predecessors, (770), 100 states have call successors, (100), 9 states have call predecessors, (100), 9 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 10:32:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 970 transitions. [2025-01-09 10:32:52,722 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 970 transitions. Word has length 202 [2025-01-09 10:32:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:52,723 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 970 transitions. [2025-01-09 10:32:52,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:32:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 970 transitions. [2025-01-09 10:32:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 10:32:52,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:52,726 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:52,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:32:52,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:52,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:52,728 INFO L85 PathProgramCache]: Analyzing trace with hash 575373705, now seen corresponding path program 1 times [2025-01-09 10:32:52,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:52,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5489676] [2025-01-09 10:32:52,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:52,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 10:32:52,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 10:32:52,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:52,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:32:59,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:59,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5489676] [2025-01-09 10:32:59,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5489676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:59,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:32:59,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:32:59,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041500462] [2025-01-09 10:32:59,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:59,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:32:59,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:59,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:32:59,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:32:59,680 INFO L87 Difference]: Start difference. First operand 622 states and 970 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:33:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:02,112 INFO L93 Difference]: Finished difference Result 1806 states and 2781 transitions. [2025-01-09 10:33:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:33:02,113 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-01-09 10:33:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:02,125 INFO L225 Difference]: With dead ends: 1806 [2025-01-09 10:33:02,125 INFO L226 Difference]: Without dead ends: 1468 [2025-01-09 10:33:02,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 10:33:02,129 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 758 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:02,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 939 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 10:33:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-01-09 10:33:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 669. [2025-01-09 10:33:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 559 states have (on average 1.516994633273703) internal successors, (848), 566 states have internal predecessors, (848), 100 states have call successors, (100), 9 states have call predecessors, (100), 9 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 10:33:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1048 transitions. [2025-01-09 10:33:02,202 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1048 transitions. Word has length 203 [2025-01-09 10:33:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:02,203 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 1048 transitions. [2025-01-09 10:33:02,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:33:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1048 transitions. [2025-01-09 10:33:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 10:33:02,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:02,207 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:02,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:33:02,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:02,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:02,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1446668997, now seen corresponding path program 1 times [2025-01-09 10:33:02,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:02,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400020266] [2025-01-09 10:33:02,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:02,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:02,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 10:33:02,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 10:33:02,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:02,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:33:12,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:12,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400020266] [2025-01-09 10:33:12,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400020266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:12,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:12,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 10:33:12,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383502150] [2025-01-09 10:33:12,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:12,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:33:12,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:12,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:33:12,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:33:12,363 INFO L87 Difference]: Start difference. First operand 669 states and 1048 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:33:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:20,561 INFO L93 Difference]: Finished difference Result 2633 states and 4053 transitions. [2025-01-09 10:33:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 10:33:20,562 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-01-09 10:33:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:20,575 INFO L225 Difference]: With dead ends: 2633 [2025-01-09 10:33:20,575 INFO L226 Difference]: Without dead ends: 2295 [2025-01-09 10:33:20,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=358, Invalid=1124, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 10:33:20,578 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1078 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:20,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1319 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 10:33:20,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2025-01-09 10:33:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 674. [2025-01-09 10:33:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 564 states have (on average 1.5195035460992907) internal successors, (857), 571 states have internal predecessors, (857), 100 states have call successors, (100), 9 states have call predecessors, (100), 9 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 10:33:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1057 transitions. [2025-01-09 10:33:20,644 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1057 transitions. Word has length 203 [2025-01-09 10:33:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:20,644 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 1057 transitions. [2025-01-09 10:33:20,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:33:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1057 transitions. [2025-01-09 10:33:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 10:33:20,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:20,648 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:20,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:33:20,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:20,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:20,649 INFO L85 PathProgramCache]: Analyzing trace with hash -242274745, now seen corresponding path program 1 times [2025-01-09 10:33:20,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:20,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322370778] [2025-01-09 10:33:20,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:20,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:20,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 10:33:20,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 10:33:20,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:20,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:33:27,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:27,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322370778] [2025-01-09 10:33:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322370778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:27,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:33:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524190498] [2025-01-09 10:33:27,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:27,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:33:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:27,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:33:27,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:33:27,861 INFO L87 Difference]: Start difference. First operand 674 states and 1057 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:33:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:30,070 INFO L93 Difference]: Finished difference Result 2317 states and 3618 transitions. [2025-01-09 10:33:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:33:30,072 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-01-09 10:33:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:30,079 INFO L225 Difference]: With dead ends: 2317 [2025-01-09 10:33:30,080 INFO L226 Difference]: Without dead ends: 1962 [2025-01-09 10:33:30,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2025-01-09 10:33:30,082 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 954 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:30,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 1114 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:33:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-09 10:33:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 809. [2025-01-09 10:33:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 699 states have (on average 1.5464949928469243) internal successors, (1081), 706 states have internal predecessors, (1081), 100 states have call successors, (100), 9 states have call predecessors, (100), 9 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 10:33:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1281 transitions. [2025-01-09 10:33:30,145 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1281 transitions. Word has length 203 [2025-01-09 10:33:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:30,145 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1281 transitions. [2025-01-09 10:33:30,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:33:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1281 transitions. [2025-01-09 10:33:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 10:33:30,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:30,150 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:30,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:33:30,151 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:30,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:30,151 INFO L85 PathProgramCache]: Analyzing trace with hash -358769337, now seen corresponding path program 1 times [2025-01-09 10:33:30,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:30,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841754521] [2025-01-09 10:33:30,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:30,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:30,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 10:33:30,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 10:33:30,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:30,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:33:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:30,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841754521] [2025-01-09 10:33:30,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841754521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:30,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:30,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:33:30,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598844386] [2025-01-09 10:33:30,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:30,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:33:30,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:30,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:33:30,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:33:30,971 INFO L87 Difference]: Start difference. First operand 809 states and 1281 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 10:33:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:32,040 INFO L93 Difference]: Finished difference Result 2566 states and 3932 transitions. [2025-01-09 10:33:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:33:32,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-01-09 10:33:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:32,052 INFO L225 Difference]: With dead ends: 2566 [2025-01-09 10:33:32,053 INFO L226 Difference]: Without dead ends: 2222 [2025-01-09 10:33:32,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2025-01-09 10:33:32,056 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 827 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:32,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1861 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:33:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2025-01-09 10:33:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 799. [2025-01-09 10:33:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 689 states have (on average 1.544267053701016) internal successors, (1064), 696 states have internal predecessors, (1064), 100 states have call successors, (100), 9 states have call predecessors, (100), 9 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 10:33:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1264 transitions. [2025-01-09 10:33:32,131 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1264 transitions. Word has length 203 [2025-01-09 10:33:32,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:32,132 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1264 transitions. [2025-01-09 10:33:32,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 10:33:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1264 transitions. [2025-01-09 10:33:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 10:33:32,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:32,135 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:32,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:33:32,135 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:32,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash 441360199, now seen corresponding path program 1 times [2025-01-09 10:33:32,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:32,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472919054] [2025-01-09 10:33:32,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:32,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:32,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 10:33:32,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 10:33:32,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:32,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:33:40,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:40,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472919054] [2025-01-09 10:33:40,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472919054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:40,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:40,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:33:40,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504009662] [2025-01-09 10:33:40,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:40,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:33:40,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:40,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:33:40,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:33:40,485 INFO L87 Difference]: Start difference. First operand 799 states and 1264 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:33:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:41,663 INFO L93 Difference]: Finished difference Result 1930 states and 3032 transitions. [2025-01-09 10:33:41,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:33:41,664 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-01-09 10:33:41,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:41,670 INFO L225 Difference]: With dead ends: 1930 [2025-01-09 10:33:41,670 INFO L226 Difference]: Without dead ends: 1511 [2025-01-09 10:33:41,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:33:41,672 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 633 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:41,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 668 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:33:41,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-01-09 10:33:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 813. [2025-01-09 10:33:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 703 states have (on average 1.5462304409672831) internal successors, (1087), 710 states have internal predecessors, (1087), 100 states have call successors, (100), 9 states have call predecessors, (100), 9 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 10:33:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1287 transitions. [2025-01-09 10:33:41,736 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1287 transitions. Word has length 203 [2025-01-09 10:33:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:41,738 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1287 transitions. [2025-01-09 10:33:41,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:33:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1287 transitions. [2025-01-09 10:33:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 10:33:41,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:41,740 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:41,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:33:41,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:41,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:41,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1312655491, now seen corresponding path program 1 times [2025-01-09 10:33:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:41,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315207718] [2025-01-09 10:33:41,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:41,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:41,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 10:33:41,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 10:33:41,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:41,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:33:41,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:33:41,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315207718] [2025-01-09 10:33:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315207718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:33:41,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:33:41,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:33:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167761362] [2025-01-09 10:33:41,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:33:41,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:33:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:33:41,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:33:41,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:33:41,923 INFO L87 Difference]: Start difference. First operand 813 states and 1287 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:33:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:42,039 INFO L93 Difference]: Finished difference Result 1520 states and 2376 transitions. [2025-01-09 10:33:42,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:33:42,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-01-09 10:33:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:42,045 INFO L225 Difference]: With dead ends: 1520 [2025-01-09 10:33:42,045 INFO L226 Difference]: Without dead ends: 1015 [2025-01-09 10:33:42,046 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 10:33:42,047 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 122 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:42,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 485 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:33:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-01-09 10:33:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 679. [2025-01-09 10:33:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 584 states have (on average 1.5171232876712328) internal successors, (886), 587 states have internal predecessors, (886), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 10:33:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1054 transitions. [2025-01-09 10:33:42,097 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1054 transitions. Word has length 203 [2025-01-09 10:33:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:42,097 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1054 transitions. [2025-01-09 10:33:42,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:33:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1054 transitions. [2025-01-09 10:33:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 10:33:42,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:42,100 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:42,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:33:42,100 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:42,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash -376288251, now seen corresponding path program 1 times [2025-01-09 10:33:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:33:42,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111092856] [2025-01-09 10:33:42,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:42,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:33:42,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 10:33:42,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 10:33:42,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:42,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat