./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-5.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-250_file-5.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 21bdbc3e0ac2e83aebdf4ed5d685b5451eeeab46fc8ce4a523557df5ff3c8a1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:43:38,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:43:38,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:43:38,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:43:38,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:43:38,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:43:38,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:43:38,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:43:38,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:43:38,913 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:43:38,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:43:38,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:43:38,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:43:38,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:43:38,914 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:43:38,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:43:38,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:43:38,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:43:38,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:43:38,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:43:38,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:43:38,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:43:38,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:43:38,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:43:38,915 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:43:38,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:43:38,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:43:38,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:43:38,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:43:38,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:43:38,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:43:38,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:43:38,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:43:38,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:43:38,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:43:38,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:43:38,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:43:38,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:43:38,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:43:38,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:43:38,917 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:43:38,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:43:38,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:43:38,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:43:38,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:43:38,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:43:38,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:43:38,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:43:38,918 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 -> 21bdbc3e0ac2e83aebdf4ed5d685b5451eeeab46fc8ce4a523557df5ff3c8a1c [2025-01-09 09:43:39,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:43:39,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:43:39,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:43:39,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:43:39,205 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:43:39,208 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-250_file-5.i [2025-01-09 09:43:40,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f351f4d0e/ca01f98b830a4871978808f593678268/FLAG8c18d8b7b [2025-01-09 09:43:40,924 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:43:40,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-5.i [2025-01-09 09:43:40,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f351f4d0e/ca01f98b830a4871978808f593678268/FLAG8c18d8b7b [2025-01-09 09:43:40,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f351f4d0e/ca01f98b830a4871978808f593678268 [2025-01-09 09:43:40,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:43:40,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:43:40,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:43:40,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:43:40,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:43:40,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:40" (1/1) ... [2025-01-09 09:43:40,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@220808e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:40, skipping insertion in model container [2025-01-09 09:43:40,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:40" (1/1) ... [2025-01-09 09:43:41,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:43:41,137 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-250_file-5.i[915,928] [2025-01-09 09:43:41,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:43:41,268 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:43:41,277 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-250_file-5.i[915,928] [2025-01-09 09:43:41,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:43:41,348 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:43:41,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41 WrapperNode [2025-01-09 09:43:41,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:43:41,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:43:41,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:43:41,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:43:41,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,450 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 490 [2025-01-09 09:43:41,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:43:41,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:43:41,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:43:41,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:43:41,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,497 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 09:43:41,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:43:41,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:43:41,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:43:41,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:43:41,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (1/1) ... [2025-01-09 09:43:41,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:43:41,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:43:41,608 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 09:43:41,616 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 09:43:41,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:43:41,637 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:43:41,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:43:41,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:43:41,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:43:41,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:43:41,773 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:43:41,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:43:42,776 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 09:43:42,777 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:43:42,797 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:43:42,799 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:43:42,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:42 BoogieIcfgContainer [2025-01-09 09:43:42,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:43:42,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:43:42,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:43:42,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:43:42,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:43:40" (1/3) ... [2025-01-09 09:43:42,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1a5c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:42, skipping insertion in model container [2025-01-09 09:43:42,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:41" (2/3) ... [2025-01-09 09:43:42,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1a5c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:42, skipping insertion in model container [2025-01-09 09:43:42,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:42" (3/3) ... [2025-01-09 09:43:42,810 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-5.i [2025-01-09 09:43:42,824 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:43:42,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-5.i that has 2 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:43:42,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:43:42,907 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;@151d6a9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:43:42,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:43:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 136 states have (on average 1.5220588235294117) internal successors, (207), 137 states have internal predecessors, (207), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 09:43:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 09:43:42,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:42,938 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:42,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:42,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1983444441, now seen corresponding path program 1 times [2025-01-09 09:43:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:42,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230931937] [2025-01-09 09:43:42,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:43,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 09:43:43,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 09:43:43,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:43,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 09:43:43,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:43,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230931937] [2025-01-09 09:43:43,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230931937] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:43:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171665844] [2025-01-09 09:43:43,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:43,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:43:43,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:43:43,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:43:43,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 09:43:43,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 09:43:43,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 09:43:43,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:43,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:43,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:43:43,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:43:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 09:43:43,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:43:43,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171665844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:43:43,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:43:43,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:43:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964187523] [2025-01-09 09:43:43,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:43:43,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:43:43,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:44,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:43:44,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:43:44,010 INFO L87 Difference]: Start difference. First operand has 206 states, 136 states have (on average 1.5220588235294117) internal successors, (207), 137 states have internal predecessors, (207), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 09:43:44,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:44,058 INFO L93 Difference]: Finished difference Result 406 states and 744 transitions. [2025-01-09 09:43:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:43:44,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 431 [2025-01-09 09:43:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:44,068 INFO L225 Difference]: With dead ends: 406 [2025-01-09 09:43:44,068 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 09:43:44,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 432 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 09:43:44,080 INFO L435 NwaCegarLoop]: 334 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, 334 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 09:43:44,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:43:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 09:43:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-01-09 09:43:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 134 states have (on average 1.492537313432836) internal successors, (200), 134 states have internal predecessors, (200), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 09:43:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 334 transitions. [2025-01-09 09:43:44,138 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 334 transitions. Word has length 431 [2025-01-09 09:43:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:44,139 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 334 transitions. [2025-01-09 09:43:44,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 09:43:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 334 transitions. [2025-01-09 09:43:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 09:43:44,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:44,150 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:44,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:43:44,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:43:44,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:44,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash 678648877, now seen corresponding path program 1 times [2025-01-09 09:43:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:44,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869021134] [2025-01-09 09:43:44,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:44,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:44,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 09:43:44,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 09:43:44,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:44,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 09:43:45,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:45,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869021134] [2025-01-09 09:43:45,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869021134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:43:45,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:43:45,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:43:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621359649] [2025-01-09 09:43:45,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:43:45,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:43:45,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:45,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:43:45,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:43:45,213 INFO L87 Difference]: Start difference. First operand 203 states and 334 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:45,336 INFO L93 Difference]: Finished difference Result 603 states and 996 transitions. [2025-01-09 09:43:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:43:45,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 431 [2025-01-09 09:43:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:45,345 INFO L225 Difference]: With dead ends: 603 [2025-01-09 09:43:45,345 INFO L226 Difference]: Without dead ends: 403 [2025-01-09 09:43:45,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:43:45,351 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 194 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:45,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 984 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:43:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-01-09 09:43:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2025-01-09 09:43:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 264 states have (on average 1.496212121212121) internal successors, (395), 264 states have internal predecessors, (395), 134 states have call successors, (134), 2 states have call predecessors, (134), 2 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 09:43:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 663 transitions. [2025-01-09 09:43:45,443 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 663 transitions. Word has length 431 [2025-01-09 09:43:45,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:45,447 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 663 transitions. [2025-01-09 09:43:45,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 663 transitions. [2025-01-09 09:43:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 09:43:45,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:45,455 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:45,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:43:45,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:45,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash 544635371, now seen corresponding path program 1 times [2025-01-09 09:43:45,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:45,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220212647] [2025-01-09 09:43:45,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:45,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:45,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 09:43:45,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 09:43:45,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:45,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 09:43:46,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:46,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220212647] [2025-01-09 09:43:46,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220212647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:43:46,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:43:46,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:43:46,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644919303] [2025-01-09 09:43:46,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:43:46,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:43:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:46,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:43:46,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:43:46,170 INFO L87 Difference]: Start difference. First operand 401 states and 663 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:46,249 INFO L93 Difference]: Finished difference Result 1197 states and 1983 transitions. [2025-01-09 09:43:46,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:43:46,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 431 [2025-01-09 09:43:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:46,258 INFO L225 Difference]: With dead ends: 1197 [2025-01-09 09:43:46,258 INFO L226 Difference]: Without dead ends: 799 [2025-01-09 09:43:46,260 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 09:43:46,261 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 186 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:46,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 661 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:43:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-01-09 09:43:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 797. [2025-01-09 09:43:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 524 states have (on average 1.4961832061068703) internal successors, (784), 524 states have internal predecessors, (784), 268 states have call successors, (268), 4 states have call predecessors, (268), 4 states have return successors, (268), 268 states have call predecessors, (268), 268 states have call successors, (268) [2025-01-09 09:43:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1320 transitions. [2025-01-09 09:43:46,415 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1320 transitions. Word has length 431 [2025-01-09 09:43:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:46,416 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1320 transitions. [2025-01-09 09:43:46,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 09:43:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1320 transitions. [2025-01-09 09:43:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 09:43:46,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:46,420 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:46,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:43:46,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:46,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:46,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2132983273, now seen corresponding path program 1 times [2025-01-09 09:43:46,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:46,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52822063] [2025-01-09 09:43:46,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:46,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:46,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 09:43:46,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 09:43:46,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:46,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 09:43:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52822063] [2025-01-09 09:43:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52822063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:43:54,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:43:54,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 09:43:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356634220] [2025-01-09 09:43:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:43:54,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 09:43:54,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:54,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 09:43:54,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-01-09 09:43:54,639 INFO L87 Difference]: Start difference. First operand 797 states and 1320 transitions. Second operand has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 09:44:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:21,254 INFO L93 Difference]: Finished difference Result 7709 states and 12416 transitions. [2025-01-09 09:44:21,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-01-09 09:44:21,255 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 431 [2025-01-09 09:44:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:21,293 INFO L225 Difference]: With dead ends: 7709 [2025-01-09 09:44:21,293 INFO L226 Difference]: Without dead ends: 6915 [2025-01-09 09:44:21,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1637 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=1743, Invalid=5063, Unknown=0, NotChecked=0, Total=6806 [2025-01-09 09:44:21,303 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 5700 mSDsluCounter, 7469 mSDsCounter, 0 mSdLazyCounter, 6484 mSolverCounterSat, 1537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5700 SdHoareTripleChecker+Valid, 7895 SdHoareTripleChecker+Invalid, 8021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1537 IncrementalHoareTripleChecker+Valid, 6484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:21,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5700 Valid, 7895 Invalid, 8021 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1537 Valid, 6484 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2025-01-09 09:44:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6915 states. [2025-01-09 09:44:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6915 to 1253. [2025-01-09 09:44:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 916 states have (on average 1.5720524017467248) internal successors, (1440), 920 states have internal predecessors, (1440), 328 states have call successors, (328), 8 states have call predecessors, (328), 8 states have return successors, (328), 324 states have call predecessors, (328), 328 states have call successors, (328) [2025-01-09 09:44:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2096 transitions. [2025-01-09 09:44:21,565 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2096 transitions. Word has length 431 [2025-01-09 09:44:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:21,566 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 2096 transitions. [2025-01-09 09:44:21,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 09:44:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2096 transitions. [2025-01-09 09:44:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 09:44:21,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:21,570 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:21,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:44:21,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:21,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:21,572 INFO L85 PathProgramCache]: Analyzing trace with hash 327544939, now seen corresponding path program 1 times [2025-01-09 09:44:21,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:21,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154827985] [2025-01-09 09:44:21,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:21,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 09:44:21,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 09:44:21,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:21,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 09:44:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:25,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154827985] [2025-01-09 09:44:25,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154827985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:25,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:25,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:44:25,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825205456] [2025-01-09 09:44:25,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:25,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:44:25,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:25,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:44:25,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:44:25,729 INFO L87 Difference]: Start difference. First operand 1253 states and 2096 transitions. Second operand has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 09:44:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:38,086 INFO L93 Difference]: Finished difference Result 8279 states and 13681 transitions. [2025-01-09 09:44:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 09:44:38,087 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 431 [2025-01-09 09:44:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:38,119 INFO L225 Difference]: With dead ends: 8279 [2025-01-09 09:44:38,120 INFO L226 Difference]: Without dead ends: 7029 [2025-01-09 09:44:38,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=637, Invalid=1913, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 09:44:38,128 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 5582 mSDsluCounter, 3834 mSDsCounter, 0 mSdLazyCounter, 4080 mSolverCounterSat, 1886 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5582 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 5966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1886 IncrementalHoareTripleChecker+Valid, 4080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:38,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5582 Valid, 4379 Invalid, 5966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1886 Valid, 4080 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-01-09 09:44:38,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7029 states. [2025-01-09 09:44:38,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7029 to 2363. [2025-01-09 09:44:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 1834 states have (on average 1.609596510359869) internal successors, (2952), 1846 states have internal predecessors, (2952), 508 states have call successors, (508), 20 states have call predecessors, (508), 20 states have return successors, (508), 496 states have call predecessors, (508), 508 states have call successors, (508) [2025-01-09 09:44:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3968 transitions. [2025-01-09 09:44:38,644 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3968 transitions. Word has length 431 [2025-01-09 09:44:38,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:44:38,645 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3968 transitions. [2025-01-09 09:44:38,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 09:44:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3968 transitions. [2025-01-09 09:44:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 09:44:38,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:44:38,649 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:38,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:44:38,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:44:38,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:44:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1738337301, now seen corresponding path program 1 times [2025-01-09 09:44:38,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:44:38,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702619186] [2025-01-09 09:44:38,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:44:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:44:38,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 09:44:38,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 09:44:38,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:44:38,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:44:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 09:44:42,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:44:42,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702619186] [2025-01-09 09:44:42,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702619186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:44:42,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:44:42,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 09:44:42,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078056252] [2025-01-09 09:44:42,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:44:42,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 09:44:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:44:42,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 09:44:42,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-09 09:44:42,914 INFO L87 Difference]: Start difference. First operand 2363 states and 3968 transitions. Second operand has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 09:44:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:44:59,481 INFO L93 Difference]: Finished difference Result 11890 states and 19316 transitions. [2025-01-09 09:44:59,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-09 09:44:59,482 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 431 [2025-01-09 09:44:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:44:59,535 INFO L225 Difference]: With dead ends: 11890 [2025-01-09 09:44:59,536 INFO L226 Difference]: Without dead ends: 9530 [2025-01-09 09:44:59,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1242, Invalid=3450, Unknown=0, NotChecked=0, Total=4692 [2025-01-09 09:44:59,550 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 6447 mSDsluCounter, 6607 mSDsCounter, 0 mSdLazyCounter, 5734 mSolverCounterSat, 1853 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6447 SdHoareTripleChecker+Valid, 6990 SdHoareTripleChecker+Invalid, 7587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1853 IncrementalHoareTripleChecker+Valid, 5734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:44:59,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6447 Valid, 6990 Invalid, 7587 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1853 Valid, 5734 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2025-01-09 09:44:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9530 states.