./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f21456a779194f7e287a67040f0a4e45ea1ac95220541a0a40827a16bb32aae0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:44:45,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:44:45,798 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:44:45,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:44:45,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:44:45,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:44:45,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:44:45,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:44:45,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:44:45,841 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:44:45,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:44:45,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:44:45,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:44:45,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:44:45,842 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:44:45,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:44:45,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:44:45,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:44:45,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:44:45,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:44:45,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:44:45,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:44:45,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:44:45,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:44:45,843 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:44:45,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:44:45,843 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:44:45,843 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:44:45,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:44:45,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:44:45,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:44:45,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:44:45,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:44:45,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:44:45,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:44:45,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:44:45,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:44:45,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:44:45,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:44:45,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:44:45,847 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:44:45,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:44:45,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:44:45,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:44:45,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:44:45,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:44:45,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:44:45,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:44:45,848 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 -> f21456a779194f7e287a67040f0a4e45ea1ac95220541a0a40827a16bb32aae0 [2025-01-09 10:44:46,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:44:46,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:44:46,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:44:46,146 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:44:46,147 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:44:46,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2025-01-09 10:44:47,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03136f756/0a870be8d9f0430386fe617c820b993d/FLAGc562d985b [2025-01-09 10:44:47,875 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:44:47,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2025-01-09 10:44:47,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03136f756/0a870be8d9f0430386fe617c820b993d/FLAGc562d985b [2025-01-09 10:44:47,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03136f756/0a870be8d9f0430386fe617c820b993d [2025-01-09 10:44:47,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:44:47,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:44:47,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:44:47,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:44:47,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:44:47,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:44:47" (1/1) ... [2025-01-09 10:44:47,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47addc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:47, skipping insertion in model container [2025-01-09 10:44:47,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:44:47" (1/1) ... [2025-01-09 10:44:47,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:44:48,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i[919,932] [2025-01-09 10:44:48,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:44:48,167 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:44:48,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i[919,932] [2025-01-09 10:44:48,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:44:48,241 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:44:48,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48 WrapperNode [2025-01-09 10:44:48,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:44:48,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:44:48,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:44:48,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:44:48,251 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:44:48" (1/1) ... [2025-01-09 10:44:48,267 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:44:48" (1/1) ... [2025-01-09 10:44:48,307 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 305 [2025-01-09 10:44:48,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:44:48,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:44:48,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:44:48,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:44:48,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (1/1) ... [2025-01-09 10:44:48,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (1/1) ... [2025-01-09 10:44:48,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (1/1) ... [2025-01-09 10:44:48,345 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:44:48,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (1/1) ... [2025-01-09 10:44:48,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (1/1) ... [2025-01-09 10:44:48,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (1/1) ... [2025-01-09 10:44:48,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (1/1) ... [2025-01-09 10:44:48,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (1/1) ... [2025-01-09 10:44:48,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (1/1) ... [2025-01-09 10:44:48,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (1/1) ... [2025-01-09 10:44:48,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:44:48,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:44:48,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:44:48,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:44:48,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (1/1) ... [2025-01-09 10:44:48,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:44:48,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:44:48,434 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:44:48,441 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:44:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:44:48,464 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:44:48,464 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:44:48,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:44:48,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:44:48,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:44:48,564 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:44:48,565 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:44:49,161 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 10:44:49,161 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:44:49,183 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:44:49,183 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:44:49,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:44:49 BoogieIcfgContainer [2025-01-09 10:44:49,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:44:49,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:44:49,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:44:49,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:44:49,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:44:47" (1/3) ... [2025-01-09 10:44:49,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fed2aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:44:49, skipping insertion in model container [2025-01-09 10:44:49,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:48" (2/3) ... [2025-01-09 10:44:49,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fed2aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:44:49, skipping insertion in model container [2025-01-09 10:44:49,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:44:49" (3/3) ... [2025-01-09 10:44:49,197 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i [2025-01-09 10:44:49,215 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:44:49,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-81.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:44:49,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:44:49,321 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;@2f31ecf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:44:49,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:44:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 10:44:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-01-09 10:44:49,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:44:49,348 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:49,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:44:49,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:44:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1070352002, now seen corresponding path program 1 times [2025-01-09 10:44:49,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:44:49,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436004873] [2025-01-09 10:44:49,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:44:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:44:49,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 10:44:49,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 10:44:49,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:44:49,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:44:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:44:51,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:44:51,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436004873] [2025-01-09 10:44:51,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436004873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:44:51,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:44:51,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:44:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030681811] [2025-01-09 10:44:51,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:44:51,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:44:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:44:51,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:44:51,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:44:51,042 INFO L87 Difference]: Start difference. First operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:44:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:44:51,520 INFO L93 Difference]: Finished difference Result 388 states and 731 transitions. [2025-01-09 10:44:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:44:51,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 306 [2025-01-09 10:44:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:44:51,537 INFO L225 Difference]: With dead ends: 388 [2025-01-09 10:44:51,538 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 10:44:51,546 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:44:51,550 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 112 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:44:51,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 501 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:44:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 10:44:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-01-09 10:44:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 153 states have (on average 1.392156862745098) internal successors, (213), 153 states have internal predecessors, (213), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 10:44:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 413 transitions. [2025-01-09 10:44:51,683 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 413 transitions. Word has length 306 [2025-01-09 10:44:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:44:51,686 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 413 transitions. [2025-01-09 10:44:51,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:44:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 413 transitions. [2025-01-09 10:44:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:44:51,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:44:51,696 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 10:44:51,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:44:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:44:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 51447497, now seen corresponding path program 1 times [2025-01-09 10:44:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:44:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639319132] [2025-01-09 10:44:51,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:44:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:44:51,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:44:51,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:44:51,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:44:51,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:45:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:45:05,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:45:05,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639319132] [2025-01-09 10:45:05,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639319132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:45:05,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:45:05,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:45:05,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317394959] [2025-01-09 10:45:05,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:45:05,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:45:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:45:05,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:45:05,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:45:05,228 INFO L87 Difference]: Start difference. First operand 256 states and 413 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:45:07,788 INFO L93 Difference]: Finished difference Result 1007 states and 1632 transitions. [2025-01-09 10:45:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:45:07,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 10:45:07,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:45:07,799 INFO L225 Difference]: With dead ends: 1007 [2025-01-09 10:45:07,801 INFO L226 Difference]: Without dead ends: 754 [2025-01-09 10:45:07,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-01-09 10:45:07,805 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 1503 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:45:07,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1167 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 10:45:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-01-09 10:45:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 391. [2025-01-09 10:45:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 237 states have (on average 1.4135021097046414) internal successors, (335), 237 states have internal predecessors, (335), 150 states have call successors, (150), 3 states have call predecessors, (150), 3 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-01-09 10:45:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 635 transitions. [2025-01-09 10:45:07,913 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 635 transitions. Word has length 307 [2025-01-09 10:45:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:45:07,914 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 635 transitions. [2025-01-09 10:45:07,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 635 transitions. [2025-01-09 10:45:07,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:45:07,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:45:07,918 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:07,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:45:07,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:45:07,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:45:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash -766200953, now seen corresponding path program 1 times [2025-01-09 10:45:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:45:07,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814888246] [2025-01-09 10:45:07,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:45:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:45:07,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:45:07,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:45:07,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:45:07,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:45:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:45:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:45:08,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814888246] [2025-01-09 10:45:08,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814888246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:45:08,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:45:08,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:45:08,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793674170] [2025-01-09 10:45:08,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:45:08,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:45:08,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:45:08,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:45:08,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:45:08,272 INFO L87 Difference]: Start difference. First operand 391 states and 635 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:45:08,358 INFO L93 Difference]: Finished difference Result 751 states and 1213 transitions. [2025-01-09 10:45:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:45:08,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 10:45:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:45:08,363 INFO L225 Difference]: With dead ends: 751 [2025-01-09 10:45:08,363 INFO L226 Difference]: Without dead ends: 498 [2025-01-09 10:45:08,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:45:08,365 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 77 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:45:08,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 615 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:45:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-01-09 10:45:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 494. [2025-01-09 10:45:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 330 states have (on average 1.4515151515151514) internal successors, (479), 332 states have internal predecessors, (479), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:45:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 795 transitions. [2025-01-09 10:45:08,456 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 795 transitions. Word has length 307 [2025-01-09 10:45:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:45:08,457 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 795 transitions. [2025-01-09 10:45:08,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 795 transitions. [2025-01-09 10:45:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:45:08,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:45:08,462 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:08,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:45:08,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:45:08,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:45:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash 474149323, now seen corresponding path program 1 times [2025-01-09 10:45:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:45:08,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867335073] [2025-01-09 10:45:08,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:45:08,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:45:08,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:45:08,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:45:08,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:45:08,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:45:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:45:17,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:45:17,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867335073] [2025-01-09 10:45:17,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867335073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:45:17,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:45:17,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:45:17,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496060685] [2025-01-09 10:45:17,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:45:17,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:45:17,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:45:17,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:45:17,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:45:17,772 INFO L87 Difference]: Start difference. First operand 494 states and 795 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:45:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:45:21,110 INFO L93 Difference]: Finished difference Result 1191 states and 1917 transitions. [2025-01-09 10:45:21,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:45:21,111 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 307 [2025-01-09 10:45:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:45:21,121 INFO L225 Difference]: With dead ends: 1191 [2025-01-09 10:45:21,121 INFO L226 Difference]: Without dead ends: 835 [2025-01-09 10:45:21,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2025-01-09 10:45:21,125 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 881 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:45:21,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1403 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 10:45:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-01-09 10:45:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 494. [2025-01-09 10:45:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 330 states have (on average 1.4515151515151514) internal successors, (479), 332 states have internal predecessors, (479), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:45:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 795 transitions. [2025-01-09 10:45:21,198 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 795 transitions. Word has length 307 [2025-01-09 10:45:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:45:21,199 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 795 transitions. [2025-01-09 10:45:21,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:45:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 795 transitions. [2025-01-09 10:45:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:45:21,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:45:21,203 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:21,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:45:21,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:45:21,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:45:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 270302215, now seen corresponding path program 1 times [2025-01-09 10:45:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:45:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903788726] [2025-01-09 10:45:21,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:45:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:45:21,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:45:21,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:45:21,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:45:21,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:45:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:45:22,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:45:22,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903788726] [2025-01-09 10:45:22,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903788726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:45:22,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:45:22,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:45:22,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242596841] [2025-01-09 10:45:22,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:45:22,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:45:22,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:45:22,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:45:22,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:45:22,901 INFO L87 Difference]: Start difference. First operand 494 states and 795 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:45:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:45:24,366 INFO L93 Difference]: Finished difference Result 1393 states and 2254 transitions. [2025-01-09 10:45:24,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:45:24,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 307 [2025-01-09 10:45:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:45:24,377 INFO L225 Difference]: With dead ends: 1393 [2025-01-09 10:45:24,377 INFO L226 Difference]: Without dead ends: 1037 [2025-01-09 10:45:24,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:45:24,382 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 862 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:45:24,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1127 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:45:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-01-09 10:45:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 498. [2025-01-09 10:45:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 334 states have (on average 1.4491017964071857) internal successors, (484), 336 states have internal predecessors, (484), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:45:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 800 transitions. [2025-01-09 10:45:24,464 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 800 transitions. Word has length 307 [2025-01-09 10:45:24,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:45:24,464 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 800 transitions. [2025-01-09 10:45:24,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 10:45:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 800 transitions. [2025-01-09 10:45:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:45:24,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:45:24,472 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:24,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:45:24,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:45:24,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:45:24,476 INFO L85 PathProgramCache]: Analyzing trace with hash -82566009, now seen corresponding path program 1 times [2025-01-09 10:45:24,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:45:24,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923172624] [2025-01-09 10:45:24,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:45:24,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:45:24,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:45:24,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:45:24,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:45:24,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:45:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:45:31,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:45:31,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923172624] [2025-01-09 10:45:31,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923172624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:45:31,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:45:31,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:45:31,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594612804] [2025-01-09 10:45:31,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:45:31,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:45:31,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:45:31,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:45:31,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:45:31,754 INFO L87 Difference]: Start difference. First operand 498 states and 800 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:45:34,483 INFO L93 Difference]: Finished difference Result 1240 states and 1998 transitions. [2025-01-09 10:45:34,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:45:34,484 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 10:45:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:45:34,490 INFO L225 Difference]: With dead ends: 1240 [2025-01-09 10:45:34,490 INFO L226 Difference]: Without dead ends: 884 [2025-01-09 10:45:34,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:45:34,494 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 462 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:45:34,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1174 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 10:45:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-01-09 10:45:34,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 501. [2025-01-09 10:45:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 337 states have (on average 1.4510385756676558) internal successors, (489), 339 states have internal predecessors, (489), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:45:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 805 transitions. [2025-01-09 10:45:34,564 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 805 transitions. Word has length 307 [2025-01-09 10:45:34,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:45:34,565 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 805 transitions. [2025-01-09 10:45:34,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 805 transitions. [2025-01-09 10:45:34,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:45:34,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:45:34,568 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:34,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:45:34,568 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:45:34,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:45:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash 340135817, now seen corresponding path program 1 times [2025-01-09 10:45:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:45:34,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097645814] [2025-01-09 10:45:34,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:45:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:45:34,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:45:34,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:45:34,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:45:34,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:45:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:45:41,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:45:41,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097645814] [2025-01-09 10:45:41,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097645814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:45:41,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:45:41,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:45:41,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950287807] [2025-01-09 10:45:41,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:45:41,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:45:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:45:41,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:45:41,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:45:41,017 INFO L87 Difference]: Start difference. First operand 501 states and 805 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:45:42,944 INFO L93 Difference]: Finished difference Result 1126 states and 1811 transitions. [2025-01-09 10:45:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:45:42,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 10:45:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:45:42,953 INFO L225 Difference]: With dead ends: 1126 [2025-01-09 10:45:42,953 INFO L226 Difference]: Without dead ends: 770 [2025-01-09 10:45:42,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:45:42,957 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 575 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:45:42,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 982 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 10:45:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-01-09 10:45:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 500. [2025-01-09 10:45:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 336 states have (on average 1.4494047619047619) internal successors, (487), 338 states have internal predecessors, (487), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:45:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 803 transitions. [2025-01-09 10:45:43,027 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 803 transitions. Word has length 307 [2025-01-09 10:45:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:45:43,028 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 803 transitions. [2025-01-09 10:45:43,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 803 transitions. [2025-01-09 10:45:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 10:45:43,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:45:43,032 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:43,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:45:43,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:45:43,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:45:43,034 INFO L85 PathProgramCache]: Analyzing trace with hash 136288709, now seen corresponding path program 1 times [2025-01-09 10:45:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:45:43,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233187108] [2025-01-09 10:45:43,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:45:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:45:43,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 10:45:43,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 10:45:43,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:45:43,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:45:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:45:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:45:43,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233187108] [2025-01-09 10:45:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233187108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:45:43,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:45:43,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:45:43,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443434008] [2025-01-09 10:45:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:45:43,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:45:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:45:43,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:45:43,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:45:43,585 INFO L87 Difference]: Start difference. First operand 500 states and 803 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:45:44,200 INFO L93 Difference]: Finished difference Result 990 states and 1593 transitions. [2025-01-09 10:45:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:45:44,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 10:45:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:45:44,206 INFO L225 Difference]: With dead ends: 990 [2025-01-09 10:45:44,206 INFO L226 Difference]: Without dead ends: 634 [2025-01-09 10:45:44,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:45:44,208 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 255 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:45:44,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 780 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:45:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-01-09 10:45:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 498. [2025-01-09 10:45:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 334 states have (on average 1.4491017964071857) internal successors, (484), 336 states have internal predecessors, (484), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:45:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 800 transitions. [2025-01-09 10:45:44,272 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 800 transitions. Word has length 307 [2025-01-09 10:45:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:45:44,275 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 800 transitions. [2025-01-09 10:45:44,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 800 transitions. [2025-01-09 10:45:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 10:45:44,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:45:44,279 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:44,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:45:44,279 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:45:44,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:45:44,283 INFO L85 PathProgramCache]: Analyzing trace with hash 405303889, now seen corresponding path program 1 times [2025-01-09 10:45:44,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:45:44,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403495649] [2025-01-09 10:45:44,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:45:44,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:45:44,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 10:45:44,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 10:45:44,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:45:44,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:45:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:45:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:45:50,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403495649] [2025-01-09 10:45:50,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403495649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:45:50,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:45:50,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:45:50,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42881567] [2025-01-09 10:45:50,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:45:50,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:45:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:45:50,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:45:50,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:45:50,751 INFO L87 Difference]: Start difference. First operand 498 states and 800 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:45:52,133 INFO L93 Difference]: Finished difference Result 1543 states and 2500 transitions. [2025-01-09 10:45:52,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:45:52,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-01-09 10:45:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:45:52,142 INFO L225 Difference]: With dead ends: 1543 [2025-01-09 10:45:52,143 INFO L226 Difference]: Without dead ends: 1187 [2025-01-09 10:45:52,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-01-09 10:45:52,148 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 924 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:45:52,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1132 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:45:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-01-09 10:45:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 503. [2025-01-09 10:45:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 339 states have (on average 1.4513274336283186) internal successors, (492), 341 states have internal predecessors, (492), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:45:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 808 transitions. [2025-01-09 10:45:52,217 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 808 transitions. Word has length 308 [2025-01-09 10:45:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:45:52,218 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 808 transitions. [2025-01-09 10:45:52,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 808 transitions. [2025-01-09 10:45:52,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 10:45:52,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:45:52,220 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:52,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:45:52,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:45:52,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:45:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash -412344561, now seen corresponding path program 1 times [2025-01-09 10:45:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:45:52,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253991921] [2025-01-09 10:45:52,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:45:52,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:45:52,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 10:45:52,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 10:45:52,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:45:52,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:45:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 10:45:56,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:45:56,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253991921] [2025-01-09 10:45:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253991921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:45:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:45:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:45:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304686193] [2025-01-09 10:45:56,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:45:56,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:45:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:45:56,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:45:56,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:45:56,548 INFO L87 Difference]: Start difference. First operand 503 states and 808 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:45:58,469 INFO L93 Difference]: Finished difference Result 1304 states and 2107 transitions. [2025-01-09 10:45:58,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:45:58,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-01-09 10:45:58,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:45:58,477 INFO L225 Difference]: With dead ends: 1304 [2025-01-09 10:45:58,477 INFO L226 Difference]: Without dead ends: 948 [2025-01-09 10:45:58,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:45:58,480 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 670 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:45:58,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1402 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:45:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-01-09 10:45:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 553. [2025-01-09 10:45:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 389 states have (on average 1.4832904884318765) internal successors, (577), 391 states have internal predecessors, (577), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:45:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 893 transitions. [2025-01-09 10:45:58,552 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 893 transitions. Word has length 308 [2025-01-09 10:45:58,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:45:58,552 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 893 transitions. [2025-01-09 10:45:58,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 10:45:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 893 transitions. [2025-01-09 10:45:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 10:45:58,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:45:58,556 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:58,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:45:58,556 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:45:58,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:45:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 828005715, now seen corresponding path program 1 times [2025-01-09 10:45:58,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:45:58,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910768006] [2025-01-09 10:45:58,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:45:58,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:45:58,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 10:45:58,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 10:45:58,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:45:58,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat