./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-31.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-31.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 86d647ec7a81d0bdbb105f00a2f8baf20d2b0ea117dcb47d88d4f39ade918712 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:25:33,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:25:33,931 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:25:33,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:25:33,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:25:33,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:25:33,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:25:33,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:25:33,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:25:33,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:25:33,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:25:33,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:25:33,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:25:33,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:25:33,951 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:25:33,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:25:33,952 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:25:33,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:25:33,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:25:33,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:25:33,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:25:33,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:25:33,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:25:33,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:25:33,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:25:33,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:25:33,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:25:33,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:25:33,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:25:33,953 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:25:33,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:25:33,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:25:33,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:25:33,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:25:33,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:25:33,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:25:33,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:25:33,954 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 -> 86d647ec7a81d0bdbb105f00a2f8baf20d2b0ea117dcb47d88d4f39ade918712 [2025-01-09 10:25:34,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:25:34,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:25:34,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:25:34,183 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:25:34,184 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:25:34,184 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-31.i [2025-01-09 10:25:35,362 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34138dcc2/12df8dfbe9334b8d93f882fd1c29d19b/FLAGace77baeb [2025-01-09 10:25:35,600 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:25:35,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-31.i [2025-01-09 10:25:35,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34138dcc2/12df8dfbe9334b8d93f882fd1c29d19b/FLAGace77baeb [2025-01-09 10:25:35,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34138dcc2/12df8dfbe9334b8d93f882fd1c29d19b [2025-01-09 10:25:35,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:25:35,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:25:35,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:25:35,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:25:35,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:25:35,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:25:35" (1/1) ... [2025-01-09 10:25:35,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab1f4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:35, skipping insertion in model container [2025-01-09 10:25:35,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:25:35" (1/1) ... [2025-01-09 10:25:35,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:25:36,066 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-31.i[919,932] [2025-01-09 10:25:36,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:25:36,142 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:25:36,151 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-31.i[919,932] [2025-01-09 10:25:36,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:25:36,189 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:25:36,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36 WrapperNode [2025-01-09 10:25:36,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:25:36,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:25:36,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:25:36,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:25:36,194 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:25:36" (1/1) ... [2025-01-09 10:25:36,201 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:25:36" (1/1) ... [2025-01-09 10:25:36,231 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2025-01-09 10:25:36,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:25:36,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:25:36,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:25:36,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:25:36,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (1/1) ... [2025-01-09 10:25:36,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (1/1) ... [2025-01-09 10:25:36,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (1/1) ... [2025-01-09 10:25:36,272 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:25:36,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (1/1) ... [2025-01-09 10:25:36,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (1/1) ... [2025-01-09 10:25:36,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (1/1) ... [2025-01-09 10:25:36,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (1/1) ... [2025-01-09 10:25:36,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (1/1) ... [2025-01-09 10:25:36,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (1/1) ... [2025-01-09 10:25:36,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (1/1) ... [2025-01-09 10:25:36,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:25:36,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:25:36,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:25:36,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:25:36,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (1/1) ... [2025-01-09 10:25:36,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:25:36,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:25:36,344 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:25:36,350 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:25:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:25:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:25:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:25:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:25:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:25:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:25:36,446 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:25:36,447 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:25:36,827 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 10:25:36,827 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:25:36,834 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:25:36,834 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:25:36,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:25:36 BoogieIcfgContainer [2025-01-09 10:25:36,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:25:36,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:25:36,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:25:36,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:25:36,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:25:35" (1/3) ... [2025-01-09 10:25:36,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa9a6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:25:36, skipping insertion in model container [2025-01-09 10:25:36,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:36" (2/3) ... [2025-01-09 10:25:36,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa9a6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:25:36, skipping insertion in model container [2025-01-09 10:25:36,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:25:36" (3/3) ... [2025-01-09 10:25:36,841 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-31.i [2025-01-09 10:25:36,855 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:25:36,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-31.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:25:36,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:25:36,927 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;@6a27c794, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:25:36,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:25:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 10:25:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 10:25:36,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:25:36,943 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:36,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:25:36,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:25:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash 830663469, now seen corresponding path program 1 times [2025-01-09 10:25:36,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:25:36,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687196544] [2025-01-09 10:25:36,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:36,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:25:37,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 10:25:37,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 10:25:37,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:37,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:25:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-01-09 10:25:37,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:25:37,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687196544] [2025-01-09 10:25:37,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687196544] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:25:37,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066624886] [2025-01-09 10:25:37,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:37,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:25:37,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:25:37,210 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:25:37,214 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:25:37,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 10:25:37,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 10:25:37,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:37,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:25:37,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:25:37,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:25:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-01-09 10:25:37,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:25:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066624886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:25:37,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:25:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:25:37,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119257214] [2025-01-09 10:25:37,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:25:37,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:25:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:25:37,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:25:37,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:25:37,469 INFO L87 Difference]: Start difference. First operand has 91 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 10:25:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:25:37,495 INFO L93 Difference]: Finished difference Result 176 states and 310 transitions. [2025-01-09 10:25:37,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:25:37,497 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 186 [2025-01-09 10:25:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:25:37,502 INFO L225 Difference]: With dead ends: 176 [2025-01-09 10:25:37,503 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 10:25:37,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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:25:37,507 INFO L435 NwaCegarLoop]: 138 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, 138 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:25:37,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:25:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 10:25:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 10:25:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 10:25:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2025-01-09 10:25:37,534 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 186 [2025-01-09 10:25:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:25:37,534 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2025-01-09 10:25:37,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 10:25:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2025-01-09 10:25:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 10:25:37,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:25:37,537 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:37,545 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:25:37,742 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:25:37,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:25:37,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:25:37,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1105352887, now seen corresponding path program 1 times [2025-01-09 10:25:37,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:25:37,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027022397] [2025-01-09 10:25:37,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:37,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:25:37,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 10:25:37,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 10:25:37,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:37,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:25:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:25:37,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:25:37,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027022397] [2025-01-09 10:25:37,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027022397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:25:37,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:25:37,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:25:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555157925] [2025-01-09 10:25:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:25:37,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:25:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:25:37,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:25:37,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:25:37,969 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:25:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:25:38,042 INFO L93 Difference]: Finished difference Result 257 states and 406 transitions. [2025-01-09 10:25:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:25:38,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 186 [2025-01-09 10:25:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:25:38,044 INFO L225 Difference]: With dead ends: 257 [2025-01-09 10:25:38,044 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 10:25:38,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:25:38,045 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 126 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:25:38,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 386 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:25:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 10:25:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 92. [2025-01-09 10:25:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 10:25:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2025-01-09 10:25:38,069 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 143 transitions. Word has length 186 [2025-01-09 10:25:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:25:38,072 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 143 transitions. [2025-01-09 10:25:38,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:25:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 143 transitions. [2025-01-09 10:25:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 10:25:38,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:25:38,076 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:38,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:25:38,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:25:38,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:25:38,076 INFO L85 PathProgramCache]: Analyzing trace with hash 84284533, now seen corresponding path program 1 times [2025-01-09 10:25:38,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:25:38,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33850114] [2025-01-09 10:25:38,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:25:38,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 10:25:38,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 10:25:38,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:38,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:25:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:25:49,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:25:49,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33850114] [2025-01-09 10:25:49,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33850114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:25:49,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:25:49,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:25:49,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62289926] [2025-01-09 10:25:49,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:25:49,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:25:49,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:25:49,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:25:49,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:25:49,663 INFO L87 Difference]: Start difference. First operand 92 states and 143 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 10:25:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:25:53,982 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2025-01-09 10:25:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:25:53,984 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 186 [2025-01-09 10:25:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:25:53,987 INFO L225 Difference]: With dead ends: 376 [2025-01-09 10:25:53,987 INFO L226 Difference]: Without dead ends: 287 [2025-01-09 10:25:53,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2025-01-09 10:25:53,996 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 842 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:25:53,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 644 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 10:25:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-01-09 10:25:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 156. [2025-01-09 10:25:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 10:25:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2025-01-09 10:25:54,056 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 186 [2025-01-09 10:25:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:25:54,057 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2025-01-09 10:25:54,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 10:25:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2025-01-09 10:25:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 10:25:54,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:25:54,068 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:54,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:25:54,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:25:54,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:25:54,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1859291895, now seen corresponding path program 1 times [2025-01-09 10:25:54,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:25:54,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410422504] [2025-01-09 10:25:54,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:25:54,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 10:25:54,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 10:25:54,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:54,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:25:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:25:58,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:25:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410422504] [2025-01-09 10:25:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410422504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:25:58,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:25:58,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 10:25:58,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691140932] [2025-01-09 10:25:58,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:25:58,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:25:58,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:25:58,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:25:58,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:25:58,578 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:25:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:25:59,884 INFO L93 Difference]: Finished difference Result 311 states and 451 transitions. [2025-01-09 10:25:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:25:59,885 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 186 [2025-01-09 10:25:59,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:25:59,887 INFO L225 Difference]: With dead ends: 311 [2025-01-09 10:25:59,887 INFO L226 Difference]: Without dead ends: 309 [2025-01-09 10:25:59,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:25:59,888 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 445 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:25:59,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 707 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:25:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-09 10:25:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 164. [2025-01-09 10:25:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 10:25:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 248 transitions. [2025-01-09 10:25:59,909 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 248 transitions. Word has length 186 [2025-01-09 10:25:59,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:25:59,910 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 248 transitions. [2025-01-09 10:25:59,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:25:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 248 transitions. [2025-01-09 10:25:59,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 10:25:59,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:25:59,913 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:59,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:25:59,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:25:59,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:25:59,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2044239780, now seen corresponding path program 1 times [2025-01-09 10:25:59,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:25:59,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47527317] [2025-01-09 10:25:59,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:59,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:25:59,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 10:25:59,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 10:25:59,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:59,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:26:07,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:07,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47527317] [2025-01-09 10:26:07,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47527317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:07,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:07,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:26:07,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741549633] [2025-01-09 10:26:07,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:07,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:26:07,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:07,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:26:07,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:26:07,006 INFO L87 Difference]: Start difference. First operand 164 states and 248 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 10:26:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:09,448 INFO L93 Difference]: Finished difference Result 317 states and 463 transitions. [2025-01-09 10:26:09,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:26:09,448 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 187 [2025-01-09 10:26:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:09,452 INFO L225 Difference]: With dead ends: 317 [2025-01-09 10:26:09,453 INFO L226 Difference]: Without dead ends: 315 [2025-01-09 10:26:09,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2025-01-09 10:26:09,455 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 639 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:09,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 725 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 10:26:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-01-09 10:26:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 174. [2025-01-09 10:26:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.489051094890511) internal successors, (204), 138 states have internal predecessors, (204), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 10:26:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 266 transitions. [2025-01-09 10:26:09,483 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 266 transitions. Word has length 187 [2025-01-09 10:26:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:09,483 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 266 transitions. [2025-01-09 10:26:09,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 10:26:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 266 transitions. [2025-01-09 10:26:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 10:26:09,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:09,488 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:09,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:26:09,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:09,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:09,489 INFO L85 PathProgramCache]: Analyzing trace with hash -269232418, now seen corresponding path program 1 times [2025-01-09 10:26:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:09,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279120605] [2025-01-09 10:26:09,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:09,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:09,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 10:26:09,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 10:26:09,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:09,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:26:12,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:12,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279120605] [2025-01-09 10:26:12,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279120605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:12,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:12,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:26:12,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640486457] [2025-01-09 10:26:12,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:12,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:26:12,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:12,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:26:12,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:26:12,849 INFO L87 Difference]: Start difference. First operand 174 states and 266 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:26:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:14,364 INFO L93 Difference]: Finished difference Result 347 states and 510 transitions. [2025-01-09 10:26:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:26:14,364 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-01-09 10:26:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:14,367 INFO L225 Difference]: With dead ends: 347 [2025-01-09 10:26:14,368 INFO L226 Difference]: Without dead ends: 345 [2025-01-09 10:26:14,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:26:14,370 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 451 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:14,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 788 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 10:26:14,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-09 10:26:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 174. [2025-01-09 10:26:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.489051094890511) internal successors, (204), 138 states have internal predecessors, (204), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 10:26:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 266 transitions. [2025-01-09 10:26:14,392 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 266 transitions. Word has length 187 [2025-01-09 10:26:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:14,393 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 266 transitions. [2025-01-09 10:26:14,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:26:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 266 transitions. [2025-01-09 10:26:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 10:26:14,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:14,394 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:14,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:26:14,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:14,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1663921502, now seen corresponding path program 1 times [2025-01-09 10:26:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:14,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136252509] [2025-01-09 10:26:14,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:14,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 10:26:14,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 10:26:14,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:14,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:26:20,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:20,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136252509] [2025-01-09 10:26:20,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136252509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:20,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:20,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:26:20,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283728755] [2025-01-09 10:26:20,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:20,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:26:20,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:20,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:26:20,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:26:20,092 INFO L87 Difference]: Start difference. First operand 174 states and 266 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 10:26:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:23,261 INFO L93 Difference]: Finished difference Result 325 states and 475 transitions. [2025-01-09 10:26:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:26:23,262 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 187 [2025-01-09 10:26:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:23,268 INFO L225 Difference]: With dead ends: 325 [2025-01-09 10:26:23,268 INFO L226 Difference]: Without dead ends: 323 [2025-01-09 10:26:23,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2025-01-09 10:26:23,269 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 873 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:23,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 782 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 10:26:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-01-09 10:26:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 183. [2025-01-09 10:26:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 146 states have (on average 1.5136986301369864) internal successors, (221), 147 states have internal predecessors, (221), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 10:26:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 283 transitions. [2025-01-09 10:26:23,293 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 283 transitions. Word has length 187 [2025-01-09 10:26:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:23,294 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 283 transitions. [2025-01-09 10:26:23,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 10:26:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 283 transitions. [2025-01-09 10:26:23,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 10:26:23,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:23,296 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:23,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:26:23,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:23,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:23,297 INFO L85 PathProgramCache]: Analyzing trace with hash -856038432, now seen corresponding path program 1 times [2025-01-09 10:26:23,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:23,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543320533] [2025-01-09 10:26:23,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:23,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:23,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 10:26:23,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 10:26:23,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:23,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:26:27,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:27,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543320533] [2025-01-09 10:26:27,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543320533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:27,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:27,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:26:27,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88097959] [2025-01-09 10:26:27,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:27,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:26:27,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:27,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:26:27,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:26:27,543 INFO L87 Difference]: Start difference. First operand 183 states and 283 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:26:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:28,931 INFO L93 Difference]: Finished difference Result 355 states and 522 transitions. [2025-01-09 10:26:28,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:26:28,931 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-01-09 10:26:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:28,936 INFO L225 Difference]: With dead ends: 355 [2025-01-09 10:26:28,936 INFO L226 Difference]: Without dead ends: 353 [2025-01-09 10:26:28,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:26:28,937 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 456 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:28,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 787 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:26:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-09 10:26:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 174. [2025-01-09 10:26:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.489051094890511) internal successors, (204), 138 states have internal predecessors, (204), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 10:26:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 266 transitions. [2025-01-09 10:26:28,957 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 266 transitions. Word has length 187 [2025-01-09 10:26:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:28,957 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 266 transitions. [2025-01-09 10:26:28,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:26:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 266 transitions. [2025-01-09 10:26:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 10:26:28,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:28,959 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:28,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:26:28,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:28,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash 75573600, now seen corresponding path program 1 times [2025-01-09 10:26:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:28,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479493713] [2025-01-09 10:26:28,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:28,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 10:26:28,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 10:26:28,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:26:29,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479493713] [2025-01-09 10:26:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479493713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:26:29,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796363010] [2025-01-09 10:26:29,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:29,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:26:29,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:29,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:26:29,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:26:29,052 INFO L87 Difference]: Start difference. First operand 174 states and 266 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:26:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:29,162 INFO L93 Difference]: Finished difference Result 456 states and 692 transitions. [2025-01-09 10:26:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:26:29,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-01-09 10:26:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:29,165 INFO L225 Difference]: With dead ends: 456 [2025-01-09 10:26:29,167 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 10:26:29,167 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:26:29,168 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 126 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:29,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 332 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:26:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 10:26:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2025-01-09 10:26:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 206 states have (on average 1.4223300970873787) internal successors, (293), 208 states have internal predecessors, (293), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:26:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 413 transitions. [2025-01-09 10:26:29,225 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 413 transitions. Word has length 187 [2025-01-09 10:26:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:29,227 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 413 transitions. [2025-01-09 10:26:29,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:26:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 413 transitions. [2025-01-09 10:26:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 10:26:29,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:29,232 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:29,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:26:29,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:29,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash 970835778, now seen corresponding path program 1 times [2025-01-09 10:26:29,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:29,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225361062] [2025-01-09 10:26:29,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:29,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:29,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 10:26:29,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 10:26:29,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:29,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:26:34,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:34,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225361062] [2025-01-09 10:26:34,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225361062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:34,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:34,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:26:34,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126426885] [2025-01-09 10:26:34,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:34,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:26:34,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:34,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:26:34,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:26:34,461 INFO L87 Difference]: Start difference. First operand 277 states and 413 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 10:26:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:37,056 INFO L93 Difference]: Finished difference Result 419 states and 601 transitions. [2025-01-09 10:26:37,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:26:37,057 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 187 [2025-01-09 10:26:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:37,062 INFO L225 Difference]: With dead ends: 419 [2025-01-09 10:26:37,062 INFO L226 Difference]: Without dead ends: 417 [2025-01-09 10:26:37,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=537, Unknown=0, NotChecked=0, Total=756 [2025-01-09 10:26:37,063 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 756 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:37,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 801 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 10:26:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-01-09 10:26:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 289. [2025-01-09 10:26:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 218 states have (on average 1.4357798165137614) internal successors, (313), 220 states have internal predecessors, (313), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:26:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 433 transitions. [2025-01-09 10:26:37,097 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 433 transitions. Word has length 187 [2025-01-09 10:26:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:37,097 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 433 transitions. [2025-01-09 10:26:37,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 3 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 10:26:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 433 transitions. [2025-01-09 10:26:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 10:26:37,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:37,099 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:37,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:26:37,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:37,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1549124156, now seen corresponding path program 1 times [2025-01-09 10:26:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:37,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707953887] [2025-01-09 10:26:37,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:37,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 10:26:37,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 10:26:37,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:37,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:26:41,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:41,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707953887] [2025-01-09 10:26:41,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707953887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:41,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:41,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:26:41,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884643091] [2025-01-09 10:26:41,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:41,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:26:41,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:41,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:26:41,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:26:41,217 INFO L87 Difference]: Start difference. First operand 289 states and 433 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:26:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:43,005 INFO L93 Difference]: Finished difference Result 449 states and 648 transitions. [2025-01-09 10:26:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:26:43,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-01-09 10:26:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:43,010 INFO L225 Difference]: With dead ends: 449 [2025-01-09 10:26:43,010 INFO L226 Difference]: Without dead ends: 447 [2025-01-09 10:26:43,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:26:43,011 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 503 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:43,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 847 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:26:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-01-09 10:26:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 289. [2025-01-09 10:26:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 218 states have (on average 1.4357798165137614) internal successors, (313), 220 states have internal predecessors, (313), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:26:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 433 transitions. [2025-01-09 10:26:43,059 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 433 transitions. Word has length 187 [2025-01-09 10:26:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:43,060 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 433 transitions. [2025-01-09 10:26:43,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:26:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 433 transitions. [2025-01-09 10:26:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 10:26:43,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:43,062 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:43,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:26:43,063 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:43,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash 547044473, now seen corresponding path program 1 times [2025-01-09 10:26:43,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:43,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474996954] [2025-01-09 10:26:43,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:43,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:43,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 10:26:43,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 10:26:43,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:43,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat