./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-31.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eef3f12ba451ca840c456da7ee60eaad2b6582b827234fb7a1749b9e80613db0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:04:04,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:04:04,300 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:04:04,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:04:04,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:04:04,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:04:04,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:04:04,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:04:04,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:04:04,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:04:04,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:04:04,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:04:04,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:04:04,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:04:04,343 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:04:04,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:04:04,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:04:04,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:04:04,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:04:04,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:04:04,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:04:04,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:04:04,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:04:04,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:04:04,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:04:04,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:04:04,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:04:04,346 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:04:04,346 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:04:04,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:04:04,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:04:04,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:04:04,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:04,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:04:04,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:04:04,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:04:04,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:04:04,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:04,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:04:04,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:04:04,348 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:04:04,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:04:04,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:04:04,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:04:04,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:04:04,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:04:04,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:04:04,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:04:04,348 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 -> eef3f12ba451ca840c456da7ee60eaad2b6582b827234fb7a1749b9e80613db0 [2025-01-09 10:04:04,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:04:04,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:04:04,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:04:04,626 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:04:04,626 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:04:04,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-31.i [2025-01-09 10:04:05,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3afc78b11/95a0d5e0c0c849adb4517a730b43610a/FLAG5eca801e5 [2025-01-09 10:04:06,231 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:04:06,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-31.i [2025-01-09 10:04:06,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3afc78b11/95a0d5e0c0c849adb4517a730b43610a/FLAG5eca801e5 [2025-01-09 10:04:06,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3afc78b11/95a0d5e0c0c849adb4517a730b43610a [2025-01-09 10:04:06,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:04:06,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:04:06,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:04:06,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:04:06,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:04:06,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:06,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06, skipping insertion in model container [2025-01-09 10:04:06,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:06,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:04:06,431 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_fillercodesize_ps-cn-500_file-31.i[916,929] [2025-01-09 10:04:06,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:04:06,651 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:04:06,662 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_fillercodesize_ps-cn-500_file-31.i[916,929] [2025-01-09 10:04:06,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:04:06,774 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:04:06,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06 WrapperNode [2025-01-09 10:04:06,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:04:06,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:04:06,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:04:06,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:04:06,783 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:04:06" (1/1) ... [2025-01-09 10:04:06,806 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:04:06" (1/1) ... [2025-01-09 10:04:06,897 INFO L138 Inliner]: procedures = 26, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 817 [2025-01-09 10:04:06,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:04:06,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:04:06,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:04:06,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:04:06,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:06,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:06,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:06,971 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:04:06,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:06,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:07,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:07,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:07,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:07,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:07,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:07,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:04:07,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:04:07,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:04:07,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:04:07,056 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (1/1) ... [2025-01-09 10:04:07,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:07,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:04:07,085 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:04:07,087 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:04:07,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:04:07,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:04:07,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:04:07,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:04:07,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:04:07,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:04:07,236 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:04:07,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:04:08,455 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-09 10:04:08,455 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:04:08,475 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:04:08,476 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 10:04:08,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:08 BoogieIcfgContainer [2025-01-09 10:04:08,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:04:08,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:04:08,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:04:08,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:04:08,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:04:06" (1/3) ... [2025-01-09 10:04:08,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afd6409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:08, skipping insertion in model container [2025-01-09 10:04:08,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:06" (2/3) ... [2025-01-09 10:04:08,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afd6409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:08, skipping insertion in model container [2025-01-09 10:04:08,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:08" (3/3) ... [2025-01-09 10:04:08,488 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-31.i [2025-01-09 10:04:08,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:04:08,505 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-31.i that has 2 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:04:08,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:04:08,584 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;@323cb5d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:04:08,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:04:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 241 states have (on average 1.6265560165975104) internal successors, (392), 242 states have internal predecessors, (392), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 10:04:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-01-09 10:04:08,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:08,620 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:08,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:08,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:08,625 INFO L85 PathProgramCache]: Analyzing trace with hash 141219498, now seen corresponding path program 1 times [2025-01-09 10:04:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:08,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651447216] [2025-01-09 10:04:08,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:08,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-01-09 10:04:08,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-01-09 10:04:08,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:08,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 10:04:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:09,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651447216] [2025-01-09 10:04:09,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651447216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:09,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:09,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:04:09,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052109322] [2025-01-09 10:04:09,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:09,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:04:09,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:09,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:04:09,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:04:09,498 INFO L87 Difference]: Start difference. First operand has 335 states, 241 states have (on average 1.6265560165975104) internal successors, (392), 242 states have internal predecessors, (392), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:09,583 INFO L93 Difference]: Finished difference Result 664 states and 1234 transitions. [2025-01-09 10:04:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:04:09,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 596 [2025-01-09 10:04:09,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:09,602 INFO L225 Difference]: With dead ends: 664 [2025-01-09 10:04:09,602 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 10:04:09,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:04:09,614 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:09,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 10:04:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-01-09 10:04:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 239 states have internal predecessors, (379), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 10:04:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 561 transitions. [2025-01-09 10:04:09,712 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 561 transitions. Word has length 596 [2025-01-09 10:04:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:09,715 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 561 transitions. [2025-01-09 10:04:09,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 561 transitions. [2025-01-09 10:04:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-01-09 10:04:09,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:09,734 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:09,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 10:04:09,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:09,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash 722971471, now seen corresponding path program 1 times [2025-01-09 10:04:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304094009] [2025-01-09 10:04:09,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:09,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:09,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-01-09 10:04:09,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-01-09 10:04:09,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:09,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 10:04:10,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:10,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304094009] [2025-01-09 10:04:10,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304094009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:10,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:10,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:10,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501034047] [2025-01-09 10:04:10,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:10,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:10,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:10,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:10,676 INFO L87 Difference]: Start difference. First operand 332 states and 561 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:10,827 INFO L93 Difference]: Finished difference Result 990 states and 1677 transitions. [2025-01-09 10:04:10,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:10,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 597 [2025-01-09 10:04:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:10,840 INFO L225 Difference]: With dead ends: 990 [2025-01-09 10:04:10,842 INFO L226 Difference]: Without dead ends: 661 [2025-01-09 10:04:10,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:10,846 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 395 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:10,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1087 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:04:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-01-09 10:04:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 659. [2025-01-09 10:04:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 474 states have (on average 1.5822784810126582) internal successors, (750), 474 states have internal predecessors, (750), 182 states have call successors, (182), 2 states have call predecessors, (182), 2 states have return successors, (182), 182 states have call predecessors, (182), 182 states have call successors, (182) [2025-01-09 10:04:10,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1114 transitions. [2025-01-09 10:04:10,994 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1114 transitions. Word has length 597 [2025-01-09 10:04:10,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:10,998 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 1114 transitions. [2025-01-09 10:04:10,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1114 transitions. [2025-01-09 10:04:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-01-09 10:04:11,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:11,017 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:11,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:04:11,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:11,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2120275116, now seen corresponding path program 1 times [2025-01-09 10:04:11,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:11,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014915404] [2025-01-09 10:04:11,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:11,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:11,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 10:04:11,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 10:04:11,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:11,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 10:04:11,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:11,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014915404] [2025-01-09 10:04:11,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014915404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:11,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:11,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369456071] [2025-01-09 10:04:11,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:11,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:11,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:11,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:11,389 INFO L87 Difference]: Start difference. First operand 659 states and 1114 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:11,499 INFO L93 Difference]: Finished difference Result 1723 states and 2916 transitions. [2025-01-09 10:04:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:11,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-01-09 10:04:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:11,515 INFO L225 Difference]: With dead ends: 1723 [2025-01-09 10:04:11,515 INFO L226 Difference]: Without dead ends: 1067 [2025-01-09 10:04:11,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:11,521 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 337 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:11,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1169 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-01-09 10:04:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1062. [2025-01-09 10:04:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 823 states have (on average 1.6099635479951397) internal successors, (1325), 825 states have internal predecessors, (1325), 234 states have call successors, (234), 4 states have call predecessors, (234), 4 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) [2025-01-09 10:04:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1793 transitions. [2025-01-09 10:04:11,632 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1793 transitions. Word has length 599 [2025-01-09 10:04:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:11,633 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1793 transitions. [2025-01-09 10:04:11,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1793 transitions. [2025-01-09 10:04:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-01-09 10:04:11,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:11,642 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:11,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:04:11,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:11,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash 754225844, now seen corresponding path program 1 times [2025-01-09 10:04:11,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:11,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727002167] [2025-01-09 10:04:11,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:11,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:11,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 10:04:11,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 10:04:11,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:11,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 10:04:11,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727002167] [2025-01-09 10:04:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727002167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:11,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:11,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:11,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565751981] [2025-01-09 10:04:11,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:11,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:11,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:11,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:11,991 INFO L87 Difference]: Start difference. First operand 1062 states and 1793 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:12,121 INFO L93 Difference]: Finished difference Result 2970 states and 5025 transitions. [2025-01-09 10:04:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:12,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-01-09 10:04:12,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:12,139 INFO L225 Difference]: With dead ends: 2970 [2025-01-09 10:04:12,140 INFO L226 Difference]: Without dead ends: 1911 [2025-01-09 10:04:12,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:12,145 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 319 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:12,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1089 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:04:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2025-01-09 10:04:12,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1907. [2025-01-09 10:04:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1556 states have (on average 1.6272493573264781) internal successors, (2532), 1562 states have internal predecessors, (2532), 342 states have call successors, (342), 8 states have call predecessors, (342), 8 states have return successors, (342), 336 states have call predecessors, (342), 342 states have call successors, (342) [2025-01-09 10:04:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 3216 transitions. [2025-01-09 10:04:12,280 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 3216 transitions. Word has length 599 [2025-01-09 10:04:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:12,281 INFO L471 AbstractCegarLoop]: Abstraction has 1907 states and 3216 transitions. [2025-01-09 10:04:12,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 3216 transitions. [2025-01-09 10:04:12,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-01-09 10:04:12,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:12,287 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:12,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:04:12,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:12,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:12,288 INFO L85 PathProgramCache]: Analyzing trace with hash 894774454, now seen corresponding path program 1 times [2025-01-09 10:04:12,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:12,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715695166] [2025-01-09 10:04:12,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:12,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:12,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 10:04:12,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 10:04:12,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:12,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 10:04:12,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:12,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715695166] [2025-01-09 10:04:12,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715695166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:12,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:12,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:12,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911347573] [2025-01-09 10:04:12,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:12,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:12,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:12,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:12,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:12,580 INFO L87 Difference]: Start difference. First operand 1907 states and 3216 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:12,748 INFO L93 Difference]: Finished difference Result 5445 states and 9172 transitions. [2025-01-09 10:04:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:12,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-01-09 10:04:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:12,770 INFO L225 Difference]: With dead ends: 5445 [2025-01-09 10:04:12,770 INFO L226 Difference]: Without dead ends: 3541 [2025-01-09 10:04:12,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:12,778 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 301 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:12,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1091 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2025-01-09 10:04:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 3537. [2025-01-09 10:04:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3537 states, 2958 states have (on average 1.621365787694388) internal successors, (4796), 2972 states have internal predecessors, (4796), 562 states have call successors, (562), 16 states have call predecessors, (562), 16 states have return successors, (562), 548 states have call predecessors, (562), 562 states have call successors, (562) [2025-01-09 10:04:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 5920 transitions. [2025-01-09 10:04:13,007 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 5920 transitions. Word has length 599 [2025-01-09 10:04:13,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:13,011 INFO L471 AbstractCegarLoop]: Abstraction has 3537 states and 5920 transitions. [2025-01-09 10:04:13,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 5920 transitions. [2025-01-09 10:04:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-01-09 10:04:13,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:13,020 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:13,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:04:13,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:13,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1317476280, now seen corresponding path program 1 times [2025-01-09 10:04:13,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273454343] [2025-01-09 10:04:13,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:13,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 10:04:13,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 10:04:13,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:13,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 10:04:13,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273454343] [2025-01-09 10:04:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273454343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:13,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:13,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32345004] [2025-01-09 10:04:13,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:13,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:13,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:13,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:13,299 INFO L87 Difference]: Start difference. First operand 3537 states and 5920 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:13,604 INFO L93 Difference]: Finished difference Result 10589 states and 17722 transitions. [2025-01-09 10:04:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-01-09 10:04:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:13,651 INFO L225 Difference]: With dead ends: 10589 [2025-01-09 10:04:13,651 INFO L226 Difference]: Without dead ends: 7055 [2025-01-09 10:04:13,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:13,663 INFO L435 NwaCegarLoop]: 1105 mSDtfsCounter, 549 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:13,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1655 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7055 states. [2025-01-09 10:04:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7055 to 3601. [2025-01-09 10:04:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3601 states, 3022 states have (on average 1.613500992720053) internal successors, (4876), 3036 states have internal predecessors, (4876), 562 states have call successors, (562), 16 states have call predecessors, (562), 16 states have return successors, (562), 548 states have call predecessors, (562), 562 states have call successors, (562) [2025-01-09 10:04:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 6000 transitions. [2025-01-09 10:04:14,051 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 6000 transitions. Word has length 599 [2025-01-09 10:04:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:14,054 INFO L471 AbstractCegarLoop]: Abstraction has 3601 states and 6000 transitions. [2025-01-09 10:04:14,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 6000 transitions. [2025-01-09 10:04:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-01-09 10:04:14,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:14,062 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:14,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:04:14,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:14,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash 508129654, now seen corresponding path program 1 times [2025-01-09 10:04:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369234110] [2025-01-09 10:04:14,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:14,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 10:04:14,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 10:04:14,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:14,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 10:04:15,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:15,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369234110] [2025-01-09 10:04:15,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369234110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:15,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:15,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:04:15,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680806191] [2025-01-09 10:04:15,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:15,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:04:15,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:15,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:04:15,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:04:15,096 INFO L87 Difference]: Start difference. First operand 3601 states and 6000 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:15,785 INFO L93 Difference]: Finished difference Result 10813 states and 18026 transitions. [2025-01-09 10:04:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:04:15,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-01-09 10:04:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:15,828 INFO L225 Difference]: With dead ends: 10813 [2025-01-09 10:04:15,828 INFO L226 Difference]: Without dead ends: 7215 [2025-01-09 10:04:15,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:04:15,842 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 366 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:15,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1475 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:04:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7215 states. [2025-01-09 10:04:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7215 to 7213. [2025-01-09 10:04:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7213 states, 6056 states have (on average 1.6122853368560106) internal successors, (9764), 6084 states have internal predecessors, (9764), 1124 states have call successors, (1124), 32 states have call predecessors, (1124), 32 states have return successors, (1124), 1096 states have call predecessors, (1124), 1124 states have call successors, (1124) [2025-01-09 10:04:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7213 states to 7213 states and 12012 transitions. [2025-01-09 10:04:16,369 INFO L78 Accepts]: Start accepts. Automaton has 7213 states and 12012 transitions. Word has length 599 [2025-01-09 10:04:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:16,370 INFO L471 AbstractCegarLoop]: Abstraction has 7213 states and 12012 transitions. [2025-01-09 10:04:16,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7213 states and 12012 transitions. [2025-01-09 10:04:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-01-09 10:04:16,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:16,381 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:16,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:04:16,381 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash -863677644, now seen corresponding path program 1 times [2025-01-09 10:04:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580714839] [2025-01-09 10:04:16,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:16,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 10:04:16,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 10:04:16,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:16,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked. [2025-01-09 10:04:17,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580714839] [2025-01-09 10:04:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580714839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:17,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:17,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:04:17,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884607204] [2025-01-09 10:04:17,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:17,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:04:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:17,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:04:17,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:04:17,407 INFO L87 Difference]: Start difference. First operand 7213 states and 12012 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:18,010 INFO L93 Difference]: Finished difference Result 15943 states and 26527 transitions. [2025-01-09 10:04:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:04:18,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 599 [2025-01-09 10:04:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:18,065 INFO L225 Difference]: With dead ends: 15943 [2025-01-09 10:04:18,066 INFO L226 Difference]: Without dead ends: 8733 [2025-01-09 10:04:18,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:04:18,087 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 618 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:18,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1646 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:04:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8733 states. [2025-01-09 10:04:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8733 to 8721. [2025-01-09 10:04:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8721 states, 7328 states have (on average 1.60971615720524) internal successors, (11796), 7364 states have internal predecessors, (11796), 1348 states have call successors, (1348), 44 states have call predecessors, (1348), 44 states have return successors, (1348), 1312 states have call predecessors, (1348), 1348 states have call successors, (1348) [2025-01-09 10:04:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8721 states to 8721 states and 14492 transitions. [2025-01-09 10:04:18,659 INFO L78 Accepts]: Start accepts. Automaton has 8721 states and 14492 transitions. Word has length 599 [2025-01-09 10:04:18,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:18,660 INFO L471 AbstractCegarLoop]: Abstraction has 8721 states and 14492 transitions. [2025-01-09 10:04:18,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) [2025-01-09 10:04:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 8721 states and 14492 transitions. [2025-01-09 10:04:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-01-09 10:04:18,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:18,673 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:18,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:04:18,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:18,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:18,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1687890932, now seen corresponding path program 1 times [2025-01-09 10:04:18,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:18,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368178217] [2025-01-09 10:04:18,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:18,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:18,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-01-09 10:04:19,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-01-09 10:04:19,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:19,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat